The greedy path-merging algorithm for sequence assembly
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Separating repeats in DNA sequence assembly
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Highly scalable genome assembly on campus grids
Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers
Proceedings of the second international workshop on Emerging computational methods for the life sciences
DNA fragment assembly: an ant colony system approach
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
DNA fragment assembly by ant colony and nearest neighbour heuristics
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Hi-index | 4.10 |
Ultimately, genome sequencing seeks to provide an organism's complete DNA sequence. Automation of DNA sequencing allowed scientists to decode entire genomes and gave birth to genomics, the analytic and comparative study of genomes. Although genomes can include billions of nucleotides, the chemical reactions researchers use to decode the DNA are accurate for only about 600 to 700 nucleotides at a time.The DNA reads that sequencing produces must then be assembled into a complete picture of the genome. Errors and certain DNA characteristics complicate assembly. Resolving these problemsentails an additional and costly finishing phase that involves extensive human intervention. Assembly programs can dramatically reduce this cost by taking into account additional informationobtained during finishing. Algorithms that can assemble millions of DNA fragments into gene sequences underlie the current revolution in biotechnology, helping researchers build the growingdatabase of complete genomes.