Pattern matching with mismatches and wildcards
G Bathie, P Charalampopoulos… - arXiv preprint arXiv …, 2024 - arxiv.org
In this work, we address the problem of approximate pattern matching with wildcards. Given
a pattern $ P $ of length $ m $ containing $ D $ wildcards, a text $ T $ of length $ n $, and an …
a pattern $ P $ of length $ m $ containing $ D $ wildcards, a text $ T $ of length $ n $, and an …
Truly subquadratic-time extension queries and periodicity detection in strings with uncertainties
CS Iliopoulos, J Radoszewski - 27th Annual Symposium on …, 2016 - drops.dagstuhl.de
Strings with don't care symbols, also called partial words, and more general indeterminate
strings are a natural representation of strings containing uncertain symbols. A considerable …
strings are a natural representation of strings containing uncertain symbols. A considerable …
Longest common extensions with wildcards: Trade-off and applications
G Bathie, P Charalampopoulos… - arXiv preprint arXiv …, 2024 - arxiv.org
We study the Longest Common Extension (LCE) problem in a string containing wildcards.
Wildcards (also called" don't cares" or" holes") are special characters that match any other …
Wildcards (also called" don't cares" or" holes") are special characters that match any other …
Longest common extension
B Bollobás, S Letzter - European Journal of Combinatorics, 2018 - Elsevier
Given a word w of length n and i, j∈[n], the longest common extension is the longest
substring starting at both i and j. In this note we estimate the average length of the longest …
substring starting at both i and j. In this note we estimate the average length of the longest …
Longest common extensions in partial words
Abstract The Longest Common Extension of a pair of positions (i, j) in a string, or word, is the
longest substring starting at i and j. The LCE problem considers a word and a set of pairs of …
longest substring starting at i and j. The LCE problem considers a word and a set of pairs of …
Efficient enumeration of non-equivalent squares in partial words with few holes
P Charalampopoulos, M Crochemore… - Journal of Combinatorial …, 2019 - Springer
A word of the form WW for some word W ∈\varSigma^* W∈ Σ∗ is called a square. A partial
word is a word possibly containing holes (also called don't cares). The hole is a special …
word is a word possibly containing holes (also called don't cares). The hole is a special …
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes
CS Iliopoulos, T Kociumaka, SP Pissis… - … 2017, Hong Kong …, 2017 - books.google.com
A word of the form WW for some word W∈ Σ* is called a square, where Σ is an alphabet. A
partial word is a word possibly containing holes (also called don't cares). The hole is a …
partial word is a word possibly containing holes (also called don't cares). The hole is a …
Computing longest common extensions in partial words
F Blanchet-Sadri, S Osborne - Discrete Applied Mathematics, 2018 - Elsevier
Abstract The Longest Common Extension of a pair of positions (i, j) in a string, or word, is the
longest substring starting at i and j. The LCE problem considers a word and a set of pairs of …
longest substring starting at i and j. The LCE problem considers a word and a set of pairs of …