Cargando…
Swiftly Computing Center Strings
BACKGROUND: The center string (or closest string) problem is a classic computer science problem with important applications in computational biology. Given k input strings and a distance threshold d, we search for a string within Hamming distance at most d to each input string. This problem is NP co...
Autores principales: | Hufsky, Franziska, Kuchenbecker, Léon, Jahn, Katharina, Stoye, Jens, Böcker, Sebastian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3108310/ https://www.ncbi.nlm.nih.gov/pubmed/21504573 http://dx.doi.org/10.1186/1471-2105-12-106 |
Ejemplares similares
-
Identifying gene clusters by discovering common intervals in indeterminate
strings
por: Doerr, Daniel, et al.
Publicado: (2014) -
Finding approximate gene clusters with Gecko 3
por: Winter, Sascha, et al.
Publicado: (2016) -
Computational mass spectrometry for small molecules
por: Scheubert, Kerstin, et al.
Publicado: (2013) -
Statistics for approximate gene clusters
por: Jahn, Katharina, et al.
Publicado: (2013) -
Fast alignment of fragmentation trees
por: Hufsky, Franziska, et al.
Publicado: (2012)