Results 11 to 20 of about 3,338 (175)

String correction using the Damerau-Levenshtein distance [PDF]

BMC Bioinformatics, 2019
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 ...
Chunchun Zhao, Sartaj Sahni
doaj   +5 more sources

Levenshtein Distance, Sequence Comparison and Biological Database Search [PDF]

IEEE Transactions on Information Theory, 2021
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. Following, we describe how those algorithms led to heuristics
Bonnie Berger, Yun William Yu, Michael S Waterman   +2 more
exaly   +6 more sources

3GOLD: optimized Levenshtein distance for clustering third-generation sequencing data [PDF]

BMC Bioinformatics, 2022
Background Third-generation sequencing offers some advantages over next-generation sequencing predecessors, but with the caveat of harboring a much higher error rate. Clustering-related sequences is an essential task in modern biology.
Robert Logan, Zoe Fleischmann, Sofia Annis, Amy Wangsness Wehe, Jonathan L. Tilly, Dori C. Woods, Konstantin Khrapko   +6 more
doaj   +2 more sources

Linear space string correction algorithm using the Damerau-Levenshtein distance [PDF]

BMC Bioinformatics, 2020
Background The Damerau-Levenshtein (DL) distance metric has been widely used in the biological science. It tries to identify the similar region of DNA,RNA and protein sequences by transforming one sequence to the another using the substitution, insertion,
Chunchun Zhao, Sartaj Sahni
doaj   +2 more sources

Kombinasi Damerau Levenshtein dan Jaro-Winkler Distance Untuk Koreksi Kata Bahasa Inggris [PDF]

JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2020
Writing is one of the efforts made by the writer to express ideas and ideas to others. But sometimes when writing, there are many errors in typing spelling, especially English spelling, resulting in errors in capturing the meaning and meaning of the ...
Bonifacius Vicky Indriyono
doaj   +3 more sources

Using Polars to Improve String Similarity Performance in Python [PDF]

International Journal of Population Data Science
Introduction String similarity is central to textual record linkage, and is often calculated with Levenshtein distance or Jaro-Winkler distance. In polars-strsim, we leverage the Polars DataFrame interface to surpass all existing Python libraries in ...
Jeremy Foxcroft, Luiza Antonie
doaj   +2 more sources

Spheres of Strings Under the Levenshtein Distance

Axioms
Let Σ be a nonempty set of characters, called an alphabet. The run-length encoding (RLE) algorithm processes any nonempty string u over Σ and produces two outputs: a k-tuple (b1,b2,…,bk), where each bi is a character and bi+1≠bi; and a corresponding k ...
Said Algarni, Othman Echi
doaj   +2 more sources

Computing Hamming Distance and Levenshtein Distance Using ReLU Neural Networks

IEEE Access
Measuring the similarity or difference of two strings is a fundamental task in computer science and engineering. Among the various measures, Hamming distance and Levenshtein distance have been widely utilized.
Masahiro Ohtomo, Atsuhiro Takasu, Tatsuya Akutsu   +2 more
doaj   +2 more sources

Slice Distance: An Insert-Only Levenshtein Distance with a Focus on Security Applications

2018 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS), 2018
Levenshtein distance is well known for its use in comparing two strings for similarity. However, the set of considered edit operations used when comparing can be reduced in a number of situations. In such cases, the application of the generic Levenshtein distance can result in degraded detection and computational performance.
Anna Brunstrom, Johan Garcia, Stefan Lindskog   +2 more
exaly   +4 more sources

Faster Algorithm for Bounded Damerau–Levenshtein Distance

Lecture Notes in Computer Science
Abstract The Damerau–Levenshtein distance between two strings is the minimum number of insertions, deletions, substitutions, and adjacent transpositions required to transform one string into the other. Unlike the standard Levenshtein distance, it accounts for the common typing error of adjacent character swaps. When edits are restricted
Tetsuo Shibuya, Shibuya Tetsuo
exaly   +2 more sources