Cargando…
String correction using the Damerau-Levenshtein distance
BACKGROUND: In the string correction problem, we are to transform one string into another using a set of prescribed edit operations. In string correction using the Damerau-Levenshtein (DL) distance, the permissible edit operations are: substitution, insertion, deletion and transposition. Several alg...
Autores principales: | Zhao, Chunchun, Sahni, Sartaj |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6551241/ https://www.ncbi.nlm.nih.gov/pubmed/31167641 http://dx.doi.org/10.1186/s12859-019-2819-0 |
Ejemplares similares
-
Linear space string correction algorithm using the Damerau-Levenshtein distance
por: Zhao, Chunchun, et al.
Publicado: (2020) -
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations
por: Ho, ThienLuan, et al.
Publicado: (2017) -
Levenshtein Distance, Sequence Comparison and Biological Database Search
por: Berger, Bonnie, et al.
Publicado: (2020) -
3GOLD: optimized Levenshtein distance for clustering third-generation sequencing data
por: Logan, Robert, et al.
Publicado: (2022) -
Levenshtein error-correcting barcodes for multiplexed DNA sequencing
por: Buschmann, Tilo, et al.
Publicado: (2013)