#### Filter Results:

#### Publication Year

2010

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
- CPM
- 2015

- Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
- FSTTCS
- 2015

Document retrieval is one of the most fundamental problem in information retrieval. The objective is to retrieve all documents from a document collection that are relevant to an input pattern. Several variations of this problem such as ranked document retrieval, document listing with two patterns and forbidden patterns have been studied. We introduce the… (More)

- H Koeppl, M Hafner, A Ganguly, A Mehrotra
- Physical biology
- 2011

On top of the many external perturbations, cellular oscillators also face intrinsic perturbations due the randomness of chemical kinetics. Biomolecular oscillators, distinct in their parameter sets or distinct in their architecture, show different resilience with respect to such intrinsic perturbations. Assessing this resilience can be done by ensemble… (More)

- Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
- SODA
- 2017

- Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
- ArXiv
- 2016

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)

- Arnab Ganguly, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan
- ISAAC
- 2016

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)

- Arnab Ganguly, Wing-Kai Hon, Rahul Shah
- SWAT
- 2016

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)

- Sudip Biswas, Arnab Ganguly, Rahul Shah
- DEXA
- 2015