default search action
Vamsi Kundeti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j12]Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
Border Length Minimization Problem on a Square Array. J. Comput. Biol. 21(6): 446-455 (2014) - 2013
- [c12]Sudipta Pathak, Vamsi Krishna Kundeti, Martin R. Schiller
, Sanguthevar Rajasekaran:
A Structure Based Algorithm for Improving Motifs Prediction. PRIB 2013: 242-252 - 2012
- [j11]Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs. Discret. Math. Algorithms Appl. 4(2) (2012) - [j10]Vamsi Kundeti, Sanguthevar Rajasekaran:
Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models. Nat. Comput. 11(2): 199-207 (2012) - 2011
- [j9]Hieu Dinh, Sanguthevar Rajasekaran, Vamsi Kundeti:
PMS5: an efficient exact algorithm for the (l, d)-motif finding problem. BMC Bioinform. 12: 410 (2011) - [j8]Vamsi Kundeti, Sanguthevar Rajasekaran:
Efficient out-of-core sorting algorithms for the Parallel Disks Model. J. Parallel Distributed Comput. 71(11): 1427-1433 (2011) - [j7]Vamsi Kundeti, Sanguthevar Rajasekaran:
Efficient algorithms for self assembling non-rectangular nano structures. Nat. Comput. 10(1): 583-594 (2011) - [c11]Sanguthevar Rajasekaran, Hieu Dinh, Vamsi Kundeti:
Workshop: Efficient sequential and parallel algorithms for sequence assembly. ICCABS 2011: 274 - 2010
- [j6]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 Bioinform. 11: 328 (2010) - [j5]Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh, Matthew Vaughn
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs. BMC Bioinform. 11: 560 (2010) - [j4]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) - [j3]Vamsi Kundeti, Sanguthevar Rajasekaran:
Fast algorithms for placing large entries along the diagonal of a sparse matrix. J. Comput. Appl. Math. 235(3): 756-764 (2010) - [c10]Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
On the border length minimization problem (BLMP) on a square array. BCB 2010: 112-119 - [c9]Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs. COCOA (1) 2010: 184-196 - [c8]Vamsi Kundeti, Sanguthevar Rajasekaran:
Randomized Self Assembly of Rectangular Nano Structures. DNA 2010: 100-111 - [i4]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) - [i3]Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
On the Border Length Minimization Problem (BLMP) on a Square Array. CoRR abs/1003.2839 (2010) - [i2]Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh:
An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs. CoRR abs/1006.4828 (2010)
2000 – 2009
- 2009
- [j2]Sanguthevar Rajasekaran, Vamsi Kundeti:
Spectrum Based Techniques for Graph Isomorphism. Int. J. Found. Comput. Sci. 20(3): 479-499 (2009) - [j1]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 Res. 37(Database-Issue): 185-190 (2009) - [c7]Vamsi Kundeti, Sanguthevar Rajasekaran:
On the Hardness of the Border Length Minimization Problem. BIBE 2009: 248-253 - [c6]Vamsi Kundeti, Sanguthevar Rajasekaran, Robert Birge:
Generalized algorithms for generating balanced modulation codes in protein-based volumetric memories. IEEE Congress on Evolutionary Computation 2009: 1585-1590 - [c5]Vamsi Kundeti, Sanguthevar Rajasekaran:
Efficient Algorithms for Self Assembling Triangular and Other Nano Structures. ISBRA 2009: 148-158 - [i1]Vamsi Kundeti:
A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication. CoRR abs/0912.3925 (2009) - 2008
- [c4]Vamsi Kundeti, Yunsi Fei
An efficient digital circuit for implementing Sequence Alignment algorithm in an extended processor. ASAP 2008: 156-161 - [c3]Vamsi Kundeti, Sanguthevar Rajasekaran:
A local structural alignment algorithm with Variable Length Alignment Fragment Pairs. BIBE 2008: 1-7 - [c2]Vamsi Kundeti, Sanguthevar Rajasekaran:
Efficient PDM Sorting Algorithms. HiPC 2008: 97-107 - [c1]Vamsi Kundeti, Sanguthevar Rajasekaran:
Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space. ICCS (1) 2008: 893-902
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: