Results 11 to 20 of about 18,990 (308)
Permuted Pattern Matching Algorithms on Multi-Track Strings [PDF]
Algorithms, 2019 A multi-track string is a tuple of strings of the same length. Given the pattern and text of two multi-track strings, the permuted pattern matching problem is to find the occurrence positions of all permutations of the pattern in the text. In this paper,
Diptarama Hendrian +4 more
doaj +2 more sources
ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS [PDF]
International Journal of Foundations of Computer Science, 2005 Computing approximate patterns in strings or sequences has important applications in DNA sequence analysis, data compression, musical text analysis, and so on. In this paper, we introduce approximate k-covers and study them under various commonly used distance measures.
Lili Zhang, Francine Blanchet-Sadri
openaire +3 more sources
Consensus Algorithms for Trees and Strings. [PDF]
, 2003 This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science.
Jansson, Jesper
openaire +4 more sources
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
Algorithms for Molecular Biology, 2020 Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings.
Felipe A. Louza +4 more
doaj +1 more source
Compression and information entropy of binary strings from the collision history of three hard balls
Journal of Physics Communications, 2023 We investigate how to measure and define the entropy of a simple chaotic system, three hard spheres on a ring. A novel approach is presented, which does not assume the ergodic hypothesis.
M Vedak, G J Ackland
doaj +1 more source
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines. [PDF]
PLoS ONE, 2014 Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings.
Fernando Soler-Toscano +3 more
doaj +1 more source
Linear space string correction algorithm using the Damerau-Levenshtein distance
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 +1 more source
Efficient and effectiveness retrieval of information using some of the approximate string matching algorithms [PDF]
مجلة التربية والعلم, 2008 The research aims at buliding integral computer database for sales ,by using six algorithms of approximate string matching with practicable example;soundex,information metaphone,longest common subsequence ,dice cofficient,levenshtein distance and fuzzy ...
Anhar Mohammed, Suhiar Essa
doaj +1 more source
Counting Suffix Arrays and Strings [PDF]
, 2005 Schürmann K-B, Stoye J. Counting Suffix Arrays and Strings. In: Proc. of SPIRE 2005. LNCS. Vol 3772.
Jens Stoye +3 more
core +2 more sources
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