Genome sequence assembly: Algorithms and issues

被引:44
|
作者
Pop, M [1 ]
Salzberg, SL [1 ]
Shumway, M [1 ]
机构
[1] Inst Genom Res, Rockville, MD USA
基金
美国国家科学基金会; 美国国家卫生研究院;
关键词
D O I
10.1109/MC.2002.1016901
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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. 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.
引用
收藏
页码:47 / +
页数:9
相关论文
共 50 条
  • [1] Genome sequence assembly algorithms and misassembly identification methods
    Meng, Yue
    Lei, Yu
    Gao, Jianlong
    Liu, Yuxuan
    Ma, Enze
    Ding, Yunhong
    Bian, Yixin
    Zu, Hongquan
    Dong, Yucui
    Zhu, Xiao
    MOLECULAR BIOLOGY REPORTS, 2022, 49 (11) : 11133 - 11148
  • [2] Genome sequence assembly algorithms and misassembly identification methods
    Yue Meng
    Yu Lei
    Jianlong Gao
    Yuxuan Liu
    Enze Ma
    Yunhong Ding
    Yixin Bian
    Hongquan Zu
    Yucui Dong
    Xiao Zhu
    Molecular Biology Reports, 2022, 49 : 11133 - 11148
  • [3] Exact algorithms for haplotype assembly from whole-genome sequence data
    Chen, Zhi-Zhong
    Deng, Fei
    Wang, Lusheng
    BIOINFORMATICS, 2013, 29 (16) : 1938 - 1945
  • [4] Optimal algorithms for haplotype assembly from whole-genome sequence data
    He, Dan
    Choi, Arthur
    Pipatsrisawat, Knot
    Darwiche, Adnan
    Eskin, Eleazar
    BIOINFORMATICS, 2010, 26 (12) : i183 - i190
  • [5] Computational complexity of algorithms for sequence comparison, short-read assembly and genome alignment
    Baichoo, Shakuntala
    Ouzounis, Christos A.
    BIOSYSTEMS, 2017, 156 : 72 - 85
  • [6] A survey of genome sequence assembly techniques and algorithms using high-performance computing
    Munib Ahmed
    Ishfaq Ahmad
    Mohammad Saad Ahmad
    The Journal of Supercomputing, 2015, 71 : 293 - 339
  • [7] A survey of genome sequence assembly techniques and algorithms using high-performance computing
    Ahmed, Munib
    Ahmad, Ishfaq
    Ahmad, Mohammad Saad
    JOURNAL OF SUPERCOMPUTING, 2015, 71 (01): : 293 - 339
  • [8] Genome Sequence and Assembly of Bos indicus
    Canavez, Flavio C.
    Luche, Douglas D.
    Stothard, Paul
    Leite, Katia R. M.
    Sousa-Canavez, Juliana M.
    Plastow, Graham
    Meidanis, Joao
    Souza, Maria Angelica
    Feijao, Pedro
    Moore, Steve S.
    Camara-Lopes, Luiz H.
    JOURNAL OF HEREDITY, 2012, 103 (03) : 342 - 348
  • [9] The Theory and Practice of Genome Sequence Assembly
    Simpson, Jared T.
    Pop, Mihai
    ANNUAL REVIEW OF GENOMICS AND HUMAN GENETICS, VOL 16, 2015, 16 : 153 - 172
  • [10] Algorithms for solving assembly sequence planning problems
    Su, Yingying
    Mao, Haixu
    Tang, Xianzhao
    NEURAL COMPUTING & APPLICATIONS, 2021, 33 (02): : 525 - 534