Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Kundeti Vamsi"'
Publikováno v:
BMC Bioinformatics, Vol 12, Iss 1, p 410 (2011)
Abstract Background Motifs are patterns found in biological sequences that are vital for understanding gene function, human disease, drug design, etc. They are helpful in finding transcriptional regulatory elements, transcription factor binding sites
Externí odkaz:
https://doaj.org/article/d272bdf1c21a4a129f5ec0d7751546e8
Publikováno v:
BMC Bioinformatics, Vol 11, Iss 1, p 560 (2010)
Abstract Background Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories - based on the data structure
Externí odkaz:
https://doaj.org/article/51fe4b97cde54b25abde63d1a19714ae
Autor:
Kundeti Vamsi, Gryk Michael R, Kadaveru Krishna, Sargeant David, Meusburger Thomas, Nowling Ronald J, Vyas Jay, Rajasekaran Sanguthevar, Schiller Martin R
Publikováno v:
BMC Bioinformatics, Vol 11, Iss 1, p 328 (2010)
Abstract Background Minimotifs are short peptide sequences within one protein, which are recognized by other proteins or molecules. While there are now several minimotif databases, they are incomplete. There are reports of many minimotifs in the prim
Externí odkaz:
https://doaj.org/article/1dce432d09994222b8fe21111a1338e8
Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However finding a Shortest Double stranded DNA st
Externí odkaz:
http://arxiv.org/abs/1006.4828
Protein/Peptide microarrays are rapidly gaining momentum in the diagnosis of cancer. High-density and highthroughput peptide arrays are being extensively used to detect tumor biomarkers, examine kinase activity, identify antibodies having low serum t
Externí odkaz:
http://arxiv.org/abs/1003.2839
Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories -- based on the data structures which they employ
Externí odkaz:
http://arxiv.org/abs/1003.1940
Autor:
Kundeti, Vamsi K.
Fingerprinting is a well known technique, which is often used in designing Monte Carlo algorithms for verifying identities involving ma- trices, integers and polynomials. The book by Motwani and Raghavan [1] shows how this technique can be applied to
Externí odkaz:
http://arxiv.org/abs/0912.3925
Publikováno v:
In Journal of Parallel and Distributed Computing 2011 71(11):1427-1433
Publikováno v:
In Journal of Computational and Applied Mathematics 2010 235(3):756-764
Autor:
Kundeti, Vamsi K.1 vamsik@engr.uconn.edu, Rajasekaran, Sanguthevar1 rajasek@engr.uconn.edu, Hieu Dinh1, Vaughn, Matthew2, Thapar, Vishal3
Publikováno v:
BMC Bioinformatics. 2010, Vol. 11, p560-573. 14p.