2 citations · 2 across the 3 of their papers we have counts for
3 papers
On Hardness of Jumbled Indexing
Amihood Amir, Timothy Chan, Moshe Lewenstein +1
Jumbled indexing is the problem of indexing a text for queries that ask whether there is a substring of matching a pattern represented as a Parikh vector, i.e., the vector…
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing
Amihood Amir, Gianni Franceschini, Roberto Grossi +3
This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data…
Pattern Matching under Polynomial Transformation
Ayelet Butman, Peter Clifford, Raphael Clifford +5
We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse…