Cargando…
RecMotif: a novel fast algorithm for weak motif discovery
BACKGROUND: Weak motif discovery in DNA sequences is an important but unresolved problem in computational biology. Previous algorithms that aimed to solve the problem usually require a large amount of memory or execution time. In this paper, we proposed a fast and memory efficient algorithm, RecMoti...
Autores principales: | Sun, He Quan, Low, Malcolm Yoke Hean, Hsu, Wen Jing, Rajapakse, Jagath C |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2010
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3024859/ https://www.ncbi.nlm.nih.gov/pubmed/21172058 http://dx.doi.org/10.1186/1471-2105-11-S11-S8 |
Ejemplares similares
-
PairMotif+: A Fast and Effective Algorithm for De Novo Motif Discovery in DNA sequences
por: Yu, Qiang, et al.
Publicado: (2013) -
A fast weak motif-finding algorithm based on community detection in graphs
por: Jia, Caiyan, et al.
Publicado: (2013) -
Limitations and potentials of current motif discovery algorithms
por: Hu, Jianjun, et al.
Publicado: (2005) -
Classification and assessment tools for structural motif discovery algorithms
por: Badr, Ghada, et al.
Publicado: (2013) -
An Affinity Propagation-Based DNA Motif Discovery Algorithm
por: Sun, Chunxiao, et al.
Publicado: (2015)