Cargando…
Levenshtein Distance, Sequence Comparison and Biological Database Search
Levenshtein edit distance has played a central role—both past and present—in sequence alignment in particular and biological database similarity search in general. We start our review with a history of dynamic programming algorithms for computing Levenshtein distance and sequence alignments. Followi...
Autores principales: | Berger, Bonnie, Waterman, Michael S., Yu, Yun William |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8274556/ https://www.ncbi.nlm.nih.gov/pubmed/34257466 http://dx.doi.org/10.1109/tit.2020.2996543 |
Ejemplares similares
-
String correction using the Damerau-Levenshtein distance
por: Zhao, Chunchun, et al.
Publicado: (2019) -
3GOLD: optimized Levenshtein distance for clustering third-generation sequencing data
por: Logan, Robert, et al.
Publicado: (2022) -
Linear space string correction algorithm using the Damerau-Levenshtein distance
por: Zhao, Chunchun, et al.
Publicado: (2020) -
Levenshtein error-correcting barcodes for multiplexed DNA sequencing
por: Buschmann, Tilo, et al.
Publicado: (2013) -
Interpreting Sequence-Levenshtein distance for determining error type and frequency between two embedded sequences of equal length
por: Logan, Robert, et al.
Publicado: (2023)