An efficient digital circuit for implementing Sequence Alignment algorithm in an extended processor. - Vamsi Kundeti; Yunsi Fei; Sanguthevar Rajasekaran (ASAP, 2008)

A local structural alignment algorithm with Variable Length Alignment Fragment Pairs. - Vamsi Kundeti; Sanguthevar Rajasekaran (BIBE, 2008)

Efficient PDM Sorting Algorithms. - Vamsi Kundeti; Sanguthevar Rajasekaran (HiPC, 2008)

Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space. - Vamsi Kundeti; Sanguthevar Rajasekaran (ICCS (1), 2008)

On the Hardness of the Border Length Minimization Problem. - Vamsi Kundeti; Sanguthevar Rajasekaran (BIBE, 2009)

Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories. - Vamsi Kundeti; Sanguthevar Rajasekaran; Robert Birge (IEEE Congress on Evolutionary Computation, 2009)

Efficient Algorithms for Self Assembling Triangular and Other Nano Structures. - Vamsi Kundeti; Sanguthevar Rajasekaran (ISBRA, 2009)

A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication - Vamsi Kundeti (CoRR, 2009)

Spectrum Based Techniques for Graph Isomorphism. - Sanguthevar Rajasekaran; Vamsi Kundeti (Int. J. Found. Comput. Sci., 2009)

Minimotif miner 2nd release: a database and web system for motif search. - Sanguthevar Rajasekaran; Sudha Balla; Patrick Gradie; Michael R. Gryk; Krishna Kadaveru; Vamsi Kundeti; Mark W. Maciejewski; Tian Mi; Nicholas Rubino; Jay Vyas; Martin R. Schiller (Nucleic Acids Res., 2009)

On the border length minimization problem (BLMP) on a square array. - Vamsi Kundeti; Sanguthevar Rajasekaran; Hieu Dinh (BCB, 2010)

Randomized Self Assembly of Rectangular Nano Structures. - Vamsi Kundeti; Sanguthevar Rajasekaran (DNA, 2010)

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs. - Vamsi Kundeti; Sanguthevar Rajasekaran; Hieu Dinh; Matthew Vaughn; Vishal Thapar (BMC Bioinform., 2010)

MimoSA: a system for minimotif annotation. - Jay Vyas; Ronald J. Nowling; Thomas Meusburger; David P. Sargeant; Krishna Kadaveru; Michael R. Gryk; Vamsi Kundeti; Sanguthevar Rajasekaran; Martin R. Schiller (BMC Bioinform., 2010)

Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs - Vamsi Kundeti; Sanguthevar Rajasekaran; Hieu Dinh (CoRR, 2010)

On the Hardness of the Border Length Minimization Problem on a Rectangular Array. - Vamsi Kundeti; Sanguthevar Rajasekaran (Int. J. Found. Comput. Sci., 2010)

Fast algorithms for placing large entries along the diagonal of a sparse matrix. - Vamsi Kundeti; Sanguthevar Rajasekaran (J. Comput. Appl. Math., 2010)

Workshop: Efficient sequential and parallel algorithms for sequence assembly. - Sanguthevar Rajasekaran; Hieu Dinh; Vamsi Kundeti (ICCABS, 2011)

PMS5: an efficient exact algorithm for the (l, d)-motif finding problem. - Hieu Dinh; Sanguthevar Rajasekaran; Vamsi Kundeti (BMC Bioinform., 2011)

Efficient out-of-core sorting algorithms for the Parallel Disks Model. - Vamsi Kundeti; Sanguthevar Rajasekaran (J. Parallel Distributed Comput., 2011)

Efficient algorithms for self assembling non-rectangular nano structures. - Vamsi Kundeti; Sanguthevar Rajasekaran (Nat. Comput., 2011)

An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs. - Vamsi Kundeti; Sanguthevar Rajasekaran; Hieu Dinh (Discret. Math. Algorithms Appl., 2012)

Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models. - Vamsi Kundeti; Sanguthevar Rajasekaran (Nat. Comput., 2012)

A Structure Based Algorithm for Improving Motifs Prediction. - Sudipta Pathak; Vamsi Krishna Kundeti; Martin R. Schiller; Sanguthevar Rajasekaran (PRIB, 2013)

Border Length Minimization Problem on a Square Array. - Vamsi Kundeti; Sanguthevar Rajasekaran; Hieu Dinh (J. Comput. Biol., 2014)