3 citations · 4 across the 4 of their papers we have counts for
5 papers
On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and -Mismatches
Amihood Amir, Ayelet Butman, Michael Itzhaki +1
This paper addresses the problem of identifying palindromic factors in texts that include wildcards -- special characters that match all others. These symbols challenge many classi…
2-Dimensional Palindromes with Mismatches
Dina Sokol
This paper extends the problem of 2-dimensional palindrome search into the area of approximate matching. Using the Hamming distance as the measure, we search for 2D palindromes tha…
Dynamic 2D Dictionary Matching in Small Space
Shoshana Marcus, Dina Sokol
The dictionary matching problem preprocesses a set of patterns and finds all occurrences of each of the patterns in a text when it is provided. We focus on the dynamic setting, in…
Engineering Small Space Dictionary Matching
Shoshana Marcus Dina Sokol
The dictionary matching problem is to locate occurrences of any pattern among a set of patterns in a given text. Massive data sets abound and at the same time, there are many setti…
2D Lyndon Words and Applications
Shoshana Marcus, Dina Sokol
A Lyndon word is a primitive string which is lexicographically smallest among cyclic permutations of its characters. Lyndon words are used for constructing bases in free Lie algebr…