Cargando…
Closest string with outliers
BACKGROUND: Given n strings s(1), …, s(n) each of length ℓ and a nonnegative integer d, the CLOSEST STRING problem asks to find a center string s such that none of the input strings has Hamming distance greater than d from s. Finding a common pattern in many – but not necessarily all – input strings...
| Autores principales: | , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2011
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3044313/ https://www.ncbi.nlm.nih.gov/pubmed/21342588 http://dx.doi.org/10.1186/1471-2105-12-S1-S55 |