 | 2012 |
| 25 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models.
Natural Computing 11(2): 199-207 (2012) |
| 2011 |
| 24 |  | Sanguthevar Rajasekaran,
Hieu Dinh,
Vamsi Kundeti:
Workshop: Efficient sequential and parallel algorithms for sequence assembly.
ICCABS 2011: 274 |
| 23 |  | Hieu Dinh,
Sanguthevar Rajasekaran,
Vamsi Kundeti:
PMS5: an efficient exact algorithm for the (l, d)-motif finding problem.
BMC Bioinformatics 12: 410 (2011) |
| 22 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Efficient out-of-core sorting algorithms for the Parallel Disks Model.
J. Parallel Distrib. Comput. 71(11): 1427-1433 (2011) |
| 21 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Efficient algorithms for self assembling non-rectangular nano structures.
Natural Computing 10(1): 583-594 (2011) |
| 2010 |
| 20 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran,
Hieu Dinh:
On the border length minimization problem (BLMP) on a square array.
BCB 2010: 112-119 |
| 19 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran,
Dinh Heiu:
An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs.
COCOA (1) 2010: 184-196 |
| 18 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Randomized Self Assembly of Rectangular Nano Structures.
DNA 2010: 100-111 |
| 17 |  | Jay Vyas,
Ronald J. Nowling,
Thomas Meusburger,
David P. Sargeant,
Krishna Kadaveru,
Michael R. Gryk,
Vamsi Kundeti,
Sanguthevar Rajasekaran,
Martin R. Schiller:
MimoSA: a system for minimotif annotation.
BMC Bioinformatics 11: 328 (2010) |
| 16 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran,
Hieu Dinh,
Matthew Vaughn,
Vishal Thapar:
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
BMC Bioinformatics 11: 560 (2010) |
| 15 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran,
Hieu Dinh:
Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs
CoRR abs/1003.1940: (2010) |
| 14 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran,
Hieu Dinh:
On the Border Length Minimization Problem (BLMP) on a Square Array
CoRR abs/1003.2839: (2010) |
| 13 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran,
Hieu Dinh:
An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs
CoRR abs/1006.4828: (2010) |
| 12 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
On the Hardness of the Border Length Minimization Problem on a Rectangular Array.
Int. J. Found. Comput. Sci. 21(6): 1089-1100 (2010) |
| 11 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Fast algorithms for placing large entries along the diagonal of a sparse matrix.
J. Computational Applied Mathematics 235(3): 756-764 (2010) |
| 2009 |
| 10 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
On the Hardness of the Border Length Minimization Problem.
BIBE 2009: 248-253 |
| 9 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran,
R. Birge:
Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories.
IEEE Congress on Evolutionary Computation 2009: 1585-1590 |
| 8 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Efficient Algorithms for Self Assembling Triangular and Other Nano Structures.
ISBRA 2009: 148-158 |
| 7 |  | Vamsi Kundeti:
A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication
CoRR abs/0912.3925: (2009) |
| 6 |  | Sanguthevar Rajasekaran,
Vamsi Kundeti:
Spectrum Based Techniques for Graph Isomorphism.
Int. J. Found. Comput. Sci. 20(3): 479-499 (2009) |
| 5 |  | 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:
Minimotif miner 2nd release: a database and web system for motif search.
Nucleic Acids Research 37(Database-Issue): 185-190 (2009) |
| 2008 |
| 4 |  | Vamsi Kundeti,
Yunsi Fei,
Sanguthevar Rajasekaran:
An efficient digital circuit for implementing Sequence Alignment algorithm in an extended processor.
ASAP 2008: 156-161 |
| 3 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
A local structural alignment algorithm with Variable Length Alignment Fragment Pairs.
BIBE 2008: 1-7 |
| 2 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Efficient PDM Sorting Algorithms.
HiPC 2008: 97-107 |
| 1 |  | Vamsi Kundeti,
Sanguthevar Rajasekaran:
Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space.
ICCS (1) 2008: 893-902 |