Arnab Ganguly

Learn More
The fields of succinct data structures and compressed text indexing have seen quite a bit of progress over the last 15 years. An important achievement, primarily using techniques based on the Burrows-Wheeler Transform (BWT), was obtaining the full functionality of suffix tree in the optimal number of bits. A crucial property that allows the use of BWT for(More)
Two equal-length strings S and S are a parameterized-match (p-match) iff there exists a one-to-one function that renames the characters in S to those in S. Let P be a collection of d patterns of total length n characters that are chosen from an alphabet Σ of cardinality σ. The task is to index P such that we can support the following operations: search(T):(More)
Let S and S be two strings, having the same length, over a totally-ordered alphabet. We consider the following two variants of string matching. Parameterized Matching: The characters of S and S are partitioned into static characters and parameterized characters. The strings are a parameterized match iff the static characters match exactly, and there exists(More)
  • 1