8 citations · 16 across the 5 of their papers we have counts for
5 papers
On pattern matching with k mismatches and few don't cares
Marius Nicolae, Sanguthevar Rajasekaran
We consider the problem of pattern matching with mismatches, where there can be don't care or wild card characters in the pattern. Specifically, given a pattern of length $…
An error correcting parser for context free grammars that takes less than cubic time
Sanguthevar Rajasekaran, Marius Nicolae
The problem of parsing has been studied extensively for various formal grammars. Given an input string and a grammar, the parsing problem is to check if the input string belongs to…
An Elegant Algorithm for the Construction of Suffix Arrays
Sanguthevar Rajasekaran, Marius Nicolae
The suffix array is a data structure that finds numerous applications in string processing problems for both linguistic texts and biological data. It has been introduced as a memor…
On string matching with k mismatches
Marius Nicolae, Sanguthevar Rajasekaran
In this paper we consider several variants of the pattern matching problem. In particular, we investigate the following problems: 1) Pattern matching with k mismatches; 2) Approxim…
Efficient Sequential and Parallel Algorithms for Planted Motif Search
Marius Nicolae, Sanguthevar Rajasekaran
Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One formulation of the problem is known as (l,d)-motif search o…