PairMotif: A new pattern-driven algorithm for planted (l, d) DNA motif search.
Motif search is a fundamental problem in bioinformatics with an important application in locating transcription factor binding sites (TFBSs) in DNA sequences. The exact algorithms can report all (l, d) motifs and find the best one under a specific objective function. However, it is still a challengi...
Guardado en:
Autores principales: | Qiang Yu, Hongwei Huo, Yipu Zhang, Hongzhi Guo |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2012
|
Materias: | |
Acceso en línea: | https://doaj.org/article/f23df5d3df90474c820280cc1b2055be |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
qPMS7: a fast algorithm for finding (ℓ, d)-motifs in DNA and protein sequences.
por: Hieu Dinh, et al.
Publicado: (2012) -
Inconsistencies in the specific nucleobase pairing motif prone to photodimerization in a MOF nanoreactor
por: Pascale Clivio
Publicado: (2021) -
Encoded expansion: an efficient algorithm to discover identical string motifs.
por: Aqil M Azmi, et al.
Publicado: (2014) -
Plant diversity alters the representation of motifs in food webs
por: Darren P. Giling, et al.
Publicado: (2019) -
DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries
por: Jordan K. Matelsky, et al.
Publicado: (2021)