Encoded expansion: an efficient algorithm to discover identical string motifs.
A major task in computational biology is the discovery of short recurring string patterns known as motifs. Most of the schemes to discover motifs are either stochastic or combinatorial in nature. Stochastic approaches do not guarantee finding the correct motifs, while the combinatorial schemes tend...
Guardado en:
Autores principales: | Aqil M Azmi, Abdulrakeeb Al-Ssulami |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2014
|
Materias: | |
Acceso en línea: | https://doaj.org/article/8a2d791cfe784acd818d51af3c5fa7fa |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A quantum algorithm for string matching
por: Pradeep Niroula, et al.
Publicado: (2021) -
String theory--the physics of string-bending and other electric guitar techniques.
por: David Robert Grimes
Publicado: (2014) -
PairMotif: A new pattern-driven algorithm for planted (l, d) DNA motif search.
por: Qiang Yu, et al.
Publicado: (2012) -
Rapid encoding of musical tones discovered in whole-brain connectivity
por: L. Bonetti, et al.
Publicado: (2021) -
Novel method to decrease the exposure time of the extraction string of the ureteral stent and its efficiency and safety verification in the clinic
por: WenGang Hu, et al.
Publicado: (2021)