Vamsi K Kundeti

Summary

Affiliation: University of Connecticut
Country: USA

Publications

  1. pmc Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
    Vamsi K Kundeti
    Department of Computer Science and Engineering, University of Connecticut, 371 Fairfield Way, U 2155, Storrs, CT 06269, USA
    BMC Bioinformatics 11:560. 2010
  2. pmc PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
    Hieu Dinh
    Department of CSE, University of Connecticut, Storrs, CT 06269, USA
    BMC Bioinformatics 12:410. 2011

Detail Information

Publications2

  1. pmc Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
    Vamsi K Kundeti
    Department of Computer Science and Engineering, University of Connecticut, 371 Fairfield Way, U 2155, Storrs, CT 06269, USA
    BMC Bioinformatics 11:560. 2010
    ..Here n is the size of the input and p is the number of processors. This algorithm enumerates all possible bi-directed edges which can overlap with a node and ends up generating Θ(nΣ) messages (Σ being the size of the alphabet)...
  2. pmc PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
    Hieu Dinh
    Department of CSE, University of Connecticut, Storrs, CT 06269, USA
    BMC Bioinformatics 12:410. 2011
    ..They are helpful in finding transcriptional regulatory elements, transcription factor binding sites, and so on. As a result, the problem of identifying motifs is very crucial in biology...