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...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhao, Chunchun, Sahni, Sartaj
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2019
Materias:
Research
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

Internet

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