Cargando…
Combinatorial algorithm for counting small induced graphs and orbits
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly faster than the existing approaches based on direct enumeration o...
Autores principales: | Hočevar, Tomaž, Demšar, Janez |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5300269/ https://www.ncbi.nlm.nih.gov/pubmed/28182743 http://dx.doi.org/10.1371/journal.pone.0171428 |
Ejemplares similares
-
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations
por: Melckenbeeck, Ine, et al.
Publicado: (2016) -
Gems of combinatorial optimization and graph algorithms
por: Schulz, Andreas, et al.
Publicado: (2015) -
Handbook of graph theory, combinatorial optimization, and algorithms
por: Thulasiraman, Krishnaiyan, et al.
Publicado: (2010) -
Faster algorithms for counting subgraphs in sparse graphs
por: Bressan, Marco
Publicado: (2021) -
Combinatorial optimization and graph algorithms: communications of NII Shonan meetings
por: Fukunaga, Takuro, et al.
Publicado: (2017)