5 Result(s)
within
Amihood Amir
Mathematics
-
Chapter and Conference Paper
On Suffix Tree Detection
A suffix tree is a fundamental data structure for string processing and information retrieval, however, its structure is still not well understood. The suffix trees reverse engineering problem, which its research...
-
Chapter and Conference Paper
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays
Reconstructing input from a data structure entails determining whether an instance of the data structure is in fact valid or not, and if valid, discovering the underlying data that it represents. In this paper...
-
Article
On Representations of Ternary Order Relations in Numeric Strings
Order-preserving matching is a string matching problem of two numeric strings where the relative orders of consecutive substrings are matched instead of the characters themselves. The order relation between tw...
-
Chapter and Conference Paper
Two-Dimensional Pattern Matching with Rotations
The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such diffe...
-
Chapter and Conference Paper
Fast Parallel and Serial Multidimensional Approximate Array Matching
Consider the multidimensional array matching problem, where differences between characters of the pattern and characters of the text are permitted. A difference may be due to a mismatch between a text and patt...
