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)
Given a string X[1, n] and a position k ∈ [1, n], the Shortest Unique Substring of X covering k, denoted by S k , is a substring X[i, j] of X which satisfies the following conditions: (i) i ≤ k ≤ j, (ii) i is the only position where there is an occurrence of X[i, j], and (iii) j − i is minimized. The best-known algorithm [Hon et al., ISAAC 2015] can find S(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)
J o u r n a l o f P r o b a b i l i t y Electron. Abstract The paper deals with convergence of solutions of a class of stochastic differential equations driven by infinite-dimensional semimartingales. The infinite-dimensional semimartingales considered in the paper are Hilbert-space valued. The theorems presented generalize the convergence result obtained(More)