Results 11 to 20 of about 147,630 (190)
String correction using the Damerau-Levenshtein distance
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 +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
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
Review on String-Matching Algorithm
SHS Web of Conferences, 2022 String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content.
openaire +2 more sources
Algorithmic Clustering of Music Based on String Compression [PDF]
Computer Music Journal, 2004 Cilibrasi, Vitanyi, and de Wolf Computer Music Journal, 28:4, pp. 49–67, Winter 2004 2004 Massachusetts Institute of Technology Rudi Cilibrasi,* Paul Vitanyi,*† and Ronald de Wolf* *Centrum voor Wiskunde en Informatica Kruislaan 413 1098 SJ Amsterdam, The Netherlands †Institute for Logic, Language, and Computation University of Amsterdam Plantage ...
Cilibrasi, R. +2 more
openaire +2 more sources
An efficient rank based approach for closest string and closest substring. [PDF]
PLoS ONE, 2012 This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings.
Liviu P Dinu, Radu Ionescu
doaj +1 more source
Higher-Order Quantum-Inspired Genetic Algorithms [PDF]
, 2014 This paper presents a theory and an empirical evaluation of Higher-Order Quantum-Inspired Genetic Algorithms. Fundamental notions of the theory have been introduced, and a novel Order-2 Quantum-Inspired Genetic Algorithm (QIGA2) has been presented ...
Kucharski, Jacek, Nowotniak, Robert
core +2 more sources
Compressibility-Aware Quantum Algorithms on Strings
, 2023 Sublinear time quantum algorithms have been established for many fundamental problems on strings. This work demonstrates that new, faster quantum algorithms can be designed when the string is highly compressible. We focus on two popular and theoretically significant compression algorithms -- the Lempel-Ziv77 algorithm (LZ77) and the Run-length-encoded ...
Gibney, Daniel, Thankachan, Sharma V.
openaire +2 more sources
Quantum Algorithms for Classical Probability Distributions [PDF]
, 2019 We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and study their ...
Belovs, Aleksandrs
core +2 more sources
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms.
Abdul Fadlil +2 more
doaj +1 more source