A k-mismatch string matching for generalized edit distance using diagonal skipping method. [PDF]
PLoS ONE, 2021 This paper proposes an approximate string matching with k-mismatches when calculating the generalized edit distance. When the edit distance is generalized, more sophisticated string matching can be provided.
HyunJin Kim
doaj +2 more sources
Edit Distance for Pushdown Automata [PDF]
Logical Methods in Computer Science, 2017 The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$.
Krishnendu Chatterjee +3 more
doaj +7 more sources
Locality-sensitive bucketing functions for the edit distance [PDF]
Algorithms for Molecular Biology, 2023 Background Many bioinformatics applications involve bucketing a set of sequences where each sequence is allowed to be assigned into multiple buckets.
Ke Chen, Mingfu Shao
doaj +2 more sources
Secure approximation of edit distance on genomic data [PDF]
BMC Medical Genomics, 2017 Background Edit distance is a well established metric to quantify how dissimilar two strings are by counting the minimum number of operations required to transform one string into the other.
Md Momin Al Aziz +2 more
doaj +2 more sources
Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion [PDF]
BMC Bioinformatics, 2012 Computing the edit distance between two genomes under certain operations is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years.
Shao Mingfu, Lin Yu
doaj +2 more sources
siEDM: An Efficient String Index and Search Algorithm for Edit Distance with Moves
Algorithms, 2016 Although several self-indexes for highly repetitive text collections exist, developing an index and search algorithm with editing operations remains a challenge.
Yoshimasa Takabatake +4 more
doaj +4 more sources
Improved algorithms for approximate string matching (extended abstract) [PDF]
BMC Bioinformatics, 2009 Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition.
Papamichail Georgios +1 more
doaj +5 more sources
Kendall tau sequence distance: Extending Kendall tau from ranks to sequences [PDF]
EAI Endorsed Transactions on Industrial Networks and Intelligent Systems, 2020 An edit distance is a measure of the minimum cost sequence of edit operations to transform one structureinto another. Edit distance can be used as a measure of similarity as part of a pattern recognition system, withlower values of edit distance implying
Vincent Cicirello
doaj +1 more source
Privacy-preserving Hamming and Edit Distance Computation and Applications [PDF]
Jisuanji kexue, 2022 With the rapid development of information technology,privacy-preserving multiparty cooperative computation is becoming more and more popular.Secure multiparty computation is a key technology to address such problems.In scientific research and practical ...
DOU Jia-wei
doaj +1 more source
Toward Efficient Similarity Search under Edit Distance on Hybrid Architectures
Information, 2022 Edit distance is the most widely used method to quantify similarity between two strings. We investigate the problem of similarity search under edit distance.
Madiha Khalid +2 more
doaj +1 more source