Results 11 to 20 of about 70,442,116 (202)
Permuted Pattern Matching Algorithms on Multi-Track Strings
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
Repetitions in strings: Algorithms and combinatorics [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maxime Crochemore +2 more
openaire +6 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 +3 more sources
Generic Algorithms for Factoring Strings
, 2013 In this paper we describe algorithms for factoring words over sets of strings known as circ-UMFFs, generalizations of the well-known Lyndon words based on lexorder, whose properties were first studied in 1958 by Chen, Fox and Lyndon. In 1983 Duval designed an elegant linear-time sequential (RAM) Lyndon factorization algorithm; a corresponding parallel (
David E. Daykin +3 more
openaire +2 more sources
Combinatorial Algorithms for String Sanitization [PDF]
ACM Transactions on Knowledge Discovery from Data, 2020 String data are often disseminated to support applications such as location-based service provision or DNA sequence analysis. This dissemination, however, may expose sensitive patterns that model confidential knowledge (e.g., trips to mental health clinics from a string representing a user’s location history).
G. Bernardini (Giulia) +8 more
openaire +6 more sources
Algorithms for anti-powers in strings [PDF]
Information Processing Letters, 2018 A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$ if it can decomposed into $k$ consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an
Golnaz Badkobeh +2 more
openaire +3 more sources
Faster algorithm of string comparison [PDF]
Pattern Analysis & Applications, 2003 In many applications, it is necessary to determine the string similarity. Edit distance[WF74] approach is a classic method to determine Field Similarity. A well known dynamic programming algorithm [GUS97] is used to calculate edit distance with the time complexity O(nm).
Qi Xiao Yang +4 more
openaire +5 more sources
Algorithms for bitmasking strings
, 2006 In this paper we present algorithms for efficiently bitmasking strings. In particular, we assume a pattern (the bitmask) consisting of zeroes and ones as well as a text over an alphabet Sigma and the goal is to extract information efficiently when we ...
Iliopoulos, C +3 more
core +4 more sources
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 +1 more source