4 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 2 cited
Efficient Algorithms for the Closest Pair Problem and Applications
Sanguthevar Rajasekaran, Sudipta Pathak
The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of clo…
q-bio.QM2011★ 4 cited
An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search
Dolly Sharma, Sanguthevar Rajasekaran, Hieu Dinh
Extracting meaningful patterns from voluminous amount of biological data is a very big challenge. Motifs are biological patterns of great interest to biologists. Many different ver…