Sciweavers

32 search results - page 3 / 7
» Fragment assembly with short reads
Sort
View
BMCBI
2010
154views more  BMCBI 2010»
13 years 6 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
IPPS
2009
IEEE
14 years 24 days 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...
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
13 years 8 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri
BMCBI
2010
183views more  BMCBI 2010»
13 years 6 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
CEC
2008
IEEE
14 years 19 days ago
A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
Bernabé Dorronsoro, Enrique Alba, Gabriel L...