Cargando…
Optimising orbit counting of arbitrary order by equation selection
BACKGROUND: Graphlets are useful for bioinformatics network analysis. Based on the structure of Hočevar and Demšar’s ORCA algorithm, we have created an orbit counting algorithm, named Jesse. This algorithm, like ORCA, uses equations to count the orbits, but unlike ORCA it can count graphlets of any...
Autores principales: | Melckenbeeck, Ine, Audenaert, Pieter, Van Parys, Thomas, Van De Peer, Yves, Colle, Didier, Pickavet, Mario |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6334470/ https://www.ncbi.nlm.nih.gov/pubmed/30646859 http://dx.doi.org/10.1186/s12859-018-2483-9 |
Ejemplares similares
-
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations
por: Melckenbeeck, Ine, et al.
Publicado: (2016) -
A construction heuristic for the capacitated Steiner tree problem
por: Van den Eynde, Simon, et al.
Publicado: (2022) -
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
por: Houbraken, Maarten, et al.
Publicado: (2014) -
Characterizing regulatory path motifs in integrated networks using perturbational data
por: Joshi, Anagha, et al.
Publicado: (2010) -
Jabba: hybrid error correction for long sequencing reads
por: Miclotte, Giles, et al.
Publicado: (2016)