14 citations · 71 across the 21 of their papers we have counts for
4 papers · 1 filter
A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly
Hieu Dinh, Sanguthevar Rajasekaran
An exact-match overlap graph of given strings of length is an edge-weighted graph in which each vertex is associated with a string and there is an edge of weight…
An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string g…
On the Border Length Minimization Problem (BLMP) on a Square Array
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
Protein/Peptide microarrays are rapidly gaining momentum in the diagnosis of cancer. High-density and highthroughput peptide arrays are being extensively used to detect tumor bioma…
Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into…