Results 1 to 10 of about 18,471 (230)

String correction using the Damerau-Levenshtein distance [PDF]

open access: yesBMC 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

Spheres of Strings Under the Levenshtein Distance [PDF]

open access: goldAxioms
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   +3 more sources

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

open access: yesIEEE 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
exaly   +6 more sources

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

open access: yesBMC 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   +6 more
doaj   +2 more sources

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

open access: yesBMC 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

Voice Control in Calorie Tracker Application using Levenshtein Distance Algorithm [PDF]

open access: goldAceh International Journal of Science and Technology, 2018
Each food consumed by people contains a number of calories needed by the body to perform an activity. Calories can be described as fuel of engine to move and carry out tasks.
Daniel Halim, Seng Hansun
doaj   +2 more sources

Marker Codes Using the Decoding Based on Weighted Levenshtein Distance in the Presence of Insertions/Deletions [PDF]

open access: goldIEEE Access, 2020
A random marker code is inserted into the information sequences periodically, and a novel symbol-level decoding algorithm considering the weighted Levenshtein distance (WLD) is designed for correcting insertions, deletions, as well as substitutions in ...
Yuan Liu   +4 more
doaj   +2 more sources

Query Suggestion on Drugs e-Dictionary Using the Levenshtein Distance Algorithm

open access: goldLontar Komputer, 2019
Dictionary of medicine in the form of a thick book has many disadvantages, one of which is impractical. This is the reason for Indonesian developers to create drugs e-Dictionary.
Halimah Tus Sadiah   +2 more
doaj   +3 more sources

Computing Hamming Distance and Levenshtein Distance Using ReLU Neural Networks

open access: goldIEEE 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   +2 more
doaj   +2 more sources

Home - About - Disclaimer - Privacy