Sciweavers

22 search results - page 3 / 5
» A Comparison of DNA Fragment Assembly Algorithms
Sort
View
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 7 months ago
Faster exon assembly by sparse spliced alignment
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
Alexandre Tiskin
IPPS
2009
IEEE
14 years 2 months ago
Accelerating error correction in high-throughput short-read DNA sequencing data with CUDA
Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are signif...
Haixiang Shi, Bertil Schmidt, Weiguo Liu, Wolfgang...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
13 years 12 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
BMCBI
2011
13 years 2 months ago
RAIphy: Phylogenetic classification of metagenomics samples using iterative refinement of relative abundance index profiles
Background: Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diver...
Ozkan U. Nalbantoglu, Samuel F. Way, Steven H. Hin...
BMCBI
2004
106views more  BMCBI 2004»
13 years 7 months ago
ESTIMA, a tool for EST management in a multi-project environment
Background: Single-pass, partial sequencing of complementary DNA (cDNA) libraries generates thousands of chromatograms that are processed into high quality expressed sequence tags...
Charu G. Kumar, Richard LeDuc, George Gong, Levan ...