14 citations · 71 across the 21 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013
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…
cs.DS2013★ 3 cited
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…
cs.DS2013
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…