Vamsi Kundeti, PhD
Cited by
Cited by
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
H Dinh, S Rajasekaran, VK Kundeti
BMC bioinformatics 12 (1), 1-10, 2011
Minimotif miner 2nd release: a database and web system for motif search
S Rajasekaran, S Balla, P Gradie, MR Gryk, K Kadaveru, V Kundeti, ...
Nucleic acids research 37 (suppl_1), D185-D190, 2009
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
VK Kundeti, S Rajasekaran, H Dinh, M Vaughn, V Thapar
BMC bioinformatics 11 (1), 1-14, 2010
A computational tool for identifying minimotifs in protein–protein interactions and improving the accuracy of minimotif predictions
S Rajasekaran, JC Merlin, V Kundeti, T Mi, A Oommen, J Vyas, I Alaniz, ...
Proteins: Structure, Function, and Bioinformatics 79 (1), 153-164, 2011
Secondary structure, a missing component of sequence-based minimotif definitions
DP Sargeant, MR Gryk, MW Maciejewski, V Thapar, V Kundeti, ...
PloS one 7 (12), e49957, 2012
MimoSA: a system for minimotif annotation
J Vyas, RJ Nowling, T Meusburger, D Sargeant, K Kadaveru, MR Gryk, ...
BMC bioinformatics 11 (1), 1-10, 2010
Efficient out-of-core sorting algorithms for the parallel disks model
V Kundeti, S Rajasekaran
Journal of parallel and distributed computing 71 (11), 1427-1433, 2011
Efficient algorithms for computing with protein-based volumetric memory processors
S Rajasekaran, V Kundeti, R Birge, V Kumar, S Sahni
IEEE transactions on nanotechnology 10 (4), 881-890, 2010
Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories
V Kundeti, S Rajasekaran, R Birge
2009 IEEE Congress on Evolutionary Computation, 1585-1590, 2009
Extending the four Russian algorithm to compute the edit script in linear space
V Kundeti, S Rajasekaran
International Conference on Computational Science, 893-902, 2008
On the hardness of the border length minimization problem
V Kundeti, S Rajasekaran
2009 Ninth IEEE International Conference on Bioinformatics and …, 2009
An efficient algorithm for chinese postman walk on bi-directed de bruijn graphs
V Kundeti, S Rajasekaran, H Dinh
International Conference on Combinatorial Optimization and Applications, 184-196, 2010
Spectrum based techniques for graph isomorphism
S Rajasekaran, V Kundeti
International Journal of Foundations of Computer Science 20 (03), 479-499, 2009
Border length minimization problem on a square array
V Kundeti, S Rajasekaran, H Dinh
Journal of Computational Biology 21 (6), 446-455, 2014
An efficient algorithm for Chinese postman walk on bi-directed de Bruijn graphs
V Kundeti, S Rajasekaran, H Dinh
Discrete Mathematics, Algorithms and Applications 4 (02), 1250019, 2012
Algorithms for Local Structural Alignment and Structural Motif Identification
S Rajasekaran, V Kundeti, M Schiller
Algorithms in Computational Molecular Biology, 261, 2011
Fearless: Flash enabled active replication of low end survivable storage
V Kundeti, JA Chandy
Proceedings of 1st (ACM ASPLOS-09) satellite Workshop on Integrating Solid …, 2009
Synthesizable, Space and Time Efficient Algorithms for String Editing Problem
VK Kundeti
University of Connecticut, 2008
A structure based algorithm for improving motifs prediction
S Pathak, VK Kundeti, MR Schiller, S Rajasekaran
IAPR International Conference on Pattern Recognition in Bioinformatics, 242-252, 2013
Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models
V Kundeti, S Rajasekaran
Natural computing 11 (2), 199-207, 2012
The system can't perform the operation now. Try again later.
Articles 1–20