Results 1 to 10 of about 17,779 (162)
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 +6 more
doaj +5 more sources
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 +6 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 +5 more sources
Levenshtein Distance, Sequence Comparison and Biological Database Search. [PDF]
IEEE Trans Inf 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
Berger B, Waterman MS, Yu YW.
europepmc +5 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
Indo-European languages tree by Levenshtein distance [PDF]
EPL (Europhysics Letters), 2007 The evolution of languages closely resembles the evolution of haploid organisms. This similarity has been recently exploited \cite{GA,GJ} to construct language trees. The key point is the definition of a distance among all pairs of languages which is the
Petroni, Filippo, Serva, Maurizio
core +4 more sources
Spheres of Strings Under the Levenshtein Distance
AxiomsLet Σ 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
Adapting Off-the-Shelf Speech Recognition Systems for Novel Words
Information, 2023 Current speech recognition systems with fixed vocabularies have difficulties recognizing Out-of-Vocabulary words (OOVs) such as proper nouns and new words. This leads to misunderstandings or even failures in dialog systems.
Wiam Fadel +3 more
doaj +1 more source
A New String Edit Distance and Applications
Algorithms, 2022 String edit distances have been used for decades in applications ranging from spelling correction and web search suggestions to DNA analysis. Most string edit distances are variations of the Levenshtein distance and consider only single-character edits ...
Taylor Petty +3 more
doaj +1 more source
Surprises in approximating Levenshtein distances [PDF]
Journal of Theoretical Biology, 2006 The Levenshtein distance is an important tool for the comparison of symbolic sequences, with many appearances in genome research, linguistics and other areas. For efficient applications, an approximation by a distance of smaller computational complexity is highly desirable.
Baake, Michael +2 more
openaire +3 more sources