Results 31 to 40 of about 50,367 (275)
Enhanced Levenshtein Edit Distance Method functioning as a String-to-String Similarity Measure
Iraqi Journal for Computers and Informatics, 2016 Levenshtein is a Minimum Edit Distance method; it is usually used in spell checking applications for generating candidates. The method computes the number of the required edit operations to transform one string to another and it can recognize three types
Abbas Al-Bakry, Marwa Al-Rikaby
doaj +1 more source
A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks
Mathematics, 2023 The secure computation of the graph structure is an important element in the field of secure calculation of graphs, which is important in querying data in graphs, since there are no algorithms for the graph edit distance problem that can resist attacks ...
Xin Liu +6 more
doaj +1 more source
Accel-Align: a fast sequence mapper and aligner based on the seed–embed–extend method
BMC Bioinformatics, 2021 Background Improvements in sequencing technology continue to drive sequencing cost towards $100 per genome. However, mapping sequenced data to a reference genome remains a computationally-intensive task due to the dependence on edit distance for dealing ...
Yiqing Yan +2 more
doaj +1 more source
A contextual normalised edit distance [PDF]
2008 IEEE 24th International Conference on Data Engineering Workshop, 2008 In order to better fit a variety of pattern recognition problems over strings, using a normalised version of the edit or Levenshtein distance is considered to be an appropriate approach. The goal of normalisation is to take into account the lengths of the strings.
Higuera, Colin de la +1 more
openaire +2 more sources
Accelerating Edit-Distance Sequence Alignment on GPU Using the Wavefront Algorithm
IEEE Access, 2022 Sequence alignment remains a fundamental problem with practical applications ranging from pattern recognition to computational biology. Traditional algorithms based on dynamic programming are hard to parallelize, require significant amounts of memory ...
Quim Aguado-Puig +6 more
doaj +1 more source
Discovering Lexical Similarity Using Articulatory Feature-Based Phonetic Edit Distance
IEEE Access, 2022 Lexical Similarity (LS) between two languages uncovers many interesting linguistic insights such as phylogenetic relationship, mutual intelligibility, common etymology, and loan words. There are various methods through which LS is evaluated.
Tafseer Ahmed +3 more
doaj +1 more source
Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time
, 2018 Edit distance is a measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other.
Chakraborty, Diptarka +4 more
core +1 more source
Learning Stochastic Tree Edit Distance [PDF]
, 2006 pages 42-53International audienceTrees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured documents.
A. Dempster +7 more
core +2 more sources
Edit Distance and its Computation [PDF]
The Electronic Journal of Combinatorics, 2008 In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemerédi's Regularity Lemma directly. Using this new method, we are able to compute the edit distance from hereditary properties for which it was ...
Balogh, József, Martin, Ryan
openaire +3 more sources
Applied Sciences, 2021 Japanese medical device adverse events terminology, published by the Japan Federation of Medical Devices Associations (JFMDA terminology), contains entries for 89 terminology items, with each of the terminology entries created independently.
Ayako Yagahara +2 more
doaj +1 more source