DocumentCode :
778320
Title :
Genome sequence assembly: algorithms and issues
Author :
Pop, Mihai ; Salzberg, Steven L. ; Shumway, Martin
Author_Institution :
Inst. for Genomic Res., Rockville, MD, USA
Volume :
35
Issue :
7
fYear :
2002
fDate :
7/1/2002 12:00:00 AM
Firstpage :
47
Lastpage :
54
Abstract :
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 problems entails an additional and costly finishing phase that involves extensive human intervention. Assembly programs can dramatically reduce this cost by taking into account additional information obtained during finishing. The paper considers how algorithms that can assemble millions of DNA fragments into gene sequences underlie the current revolution in biotechnology, helping researchers build the growing database of complete genomes
Keywords :
biology computing; biotechnology; database management systems; genetics; DNA fragments; DNA sequence; biotechnology; chemical reactions; database; gene sequences; genome sequence assembly; genomics; nucleotides; Assembly; Automation; Bioinformatics; Chemicals; DNA; Decoding; Finishing; Genomics; Humans; Sequences;
fLanguage :
English
Journal_Title :
Computer
Publisher :
ieee
ISSN :
0018-9162
Type :
jour
DOI :
10.1109/MC.2002.1016901
Filename :
1016901
Link To Document :
بازگشت