2 citations · 2 across the 4 of their papers we have counts for
7 papers
Counting Distinct Patterns in Internal Dictionary Matching
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed +5
We consider the problem of preprocessing a text of length and a dictionary in order to be able to efficiently answer queries , that is, gi…
Internal Dictionary Matching
Panagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed +3
We introduce data structures answering queries concerning the occurrences of patterns from a given dictionary in fragments of a given string of length . The di…
Longest Unbordered Factor in Quasilinear Time
Tomasz Kociumaka, Ritu Kundu, Manal Mohamed +1
A border u of a word w is a proper factor of w occurring both as a prefix and as a suffix. The maximal unbordered factor of w is the longest factor of w which does not have a borde…
Optimal Computation of Overabundant Words
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao +4
The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word in a given sequence can be used for classifying as avoid…
Optimal Computation of Avoided Words
Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao +4
The deviation of the observed frequency of a word from its expected frequency in a given sequence is used to determine whether or not the word is avoided. This concept is p…
Linear Algorithm for Conservative Degenerate Pattern Matching
Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu +2
A degenerate symbol x* over an alphabet A is a non-empty subset of A, and a sequence of such symbols is a degenerate string. A degenerate string is said to be conservative if its n…