ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies

BACKGROUND: Identifying motifs in biological networks is essential in uncovering key functions served by these networks. Finding non-overlapping motif instances is however a computationally challenging task. The fact that biological interactions are uncertain events further complicates the problem,...

Descripción completa

Detalles Bibliográficos
Autores principales: Ren, Yuanfang, Sarkar, Aisharjya, Kahveci, Tamer
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2018
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6020255/
https://www.ncbi.nlm.nih.gov/pubmed/29940838
http://dx.doi.org/10.1186/s12859-018-2236-9

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6020255/
https://www.ncbi.nlm.nih.gov/pubmed/29940838
http://dx.doi.org/10.1186/s12859-018-2236-9

Ejemplares similares