Cargando…
A fast weak motif-finding algorithm based on community detection in graphs
BACKGROUND: Identification of transcription factor binding sites (also called ‘motif discovery’) in DNA sequences is a basic step in understanding genetic regulation. Although many successful programs have been developed, the problem is far from being solved on account of diversity in gene expressio...
Autores principales: | Jia, Caiyan, Carson, Matthew B, Yu, Jian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3726413/ https://www.ncbi.nlm.nih.gov/pubmed/23865838 http://dx.doi.org/10.1186/1471-2105-14-227 |
Ejemplares similares
-
RecMotif: a novel fast algorithm for weak motif discovery
por: Sun, He Quan, et al.
Publicado: (2010) -
Kavosh: a new algorithm for finding network motifs
por: Kashani, Zahra Razaghi Moghadam, et al.
Publicado: (2009) -
A graph-based algorithm for detecting rigid domains in protein structures
por: Dang, Truong Khanh Linh, et al.
Publicado: (2021) -
A New Exhaustive Method and Strategy for Finding Motifs in ChIP-Enriched Regions
por: Jia, Caiyan, et al.
Publicado: (2014) -
METAMVGL: a multi-view graph-based metagenomic contig binning algorithm by integrating assembly and paired-end graphs
por: Zhang, Zhenmiao, et al.
Publicado: (2021)