Short Read Mapping: An Algorithmic Tour

被引:48
作者
Canzar, Stefan [1 ,2 ]
Salzberg, Steven L. [3 ,4 ,5 ,6 ]
机构
[1] Johns Hopkins Univ, Sch Med, Ctr Computat Biol, McKusick Nathans Inst Genet Med, Baltimore, MD 21205 USA
[2] Toyota Technol Inst, Chicago, IL USA
[3] Johns Hopkins Univ, Ctr Computat Biol, McKusick Nathans Inst Genet Med, Baltimore, MD 21205 USA
[4] Johns Hopkins Univ, Inst Med Genet, Baltimore, MD 21205 USA
[5] Johns Hopkins Univ, Bloomberg Sch Publ Hlth, Dept Biostat, Baltimore, MD 21205 USA
[6] Johns Hopkins Univ, Dept Comp Sci, Baltimore, MD 21218 USA
基金
美国国家卫生研究院;
关键词
Burrows-Wheeler transform; DNA sequencing; sequence alignment; string matching; suffix trees; BASIC LOCAL ALIGNMENT; LARGE GENOMES; DE-NOVO; SEQUENCING READS; ACCURATE; SEARCH; GENERATION; FASTER; ALIGNER; TOOL;
D O I
10.1109/JPROC.2015.2455551
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Ultra-high-throughput next-generation sequencing (NGS) technology allows us to determine the sequence of nucleotides of many millions of DNA molecules in parallel. Accompanied by a dramatic reduction in cost since its introduction in 2004, NGS technology has provided a new way of addressing a wide range of biological and biomedical questions, from the study of human genetic disease to the analysis of gene expression, protein-DNA interactions, and patterns of DNA methylation. The data generated by NGS instruments comprise huge numbers of very short DNA sequences, or ``reads,'' that carry little information by themselves. These reads therefore have to be pieced together by well-engineered algorithms to reconstruct biologically meaningful measurements, such as the level of expression of a gene. To solve this complex, high-dimensional puzzle, reads must be mapped back to a reference genome to determine their origin. Due to sequencing errors and to genuine differences between the reference genome and the individual being sequenced, this mapping process must be tolerant of mismatches, insertions, and deletions. Although optimal alignment algorithms to solve this problem have long been available, the practical requirements of aligning hundreds of millions of short reads to the 3-billion-base-pair-long human genome have stimulated the development of new, more efficient methods, which today are used routinely throughout the world for the analysis of NGS data.
引用
收藏
页码:436 / 458
页数:23
相关论文
共 118 条
  • [81] SOAP3-dp: Fast, Accurate and Sensitive GPU-Based Short Read Aligner
    Luo, Ruibang
    Wong, Thomas
    Zhu, Jianqiao
    Liu, Chi-Man
    Zhu, Xiaoqian
    Wu, Edward
    Lee, Lap-Kei
    Lin, Haoxiang
    Zhu, Wenjuan
    Cheung, David W.
    Ting, Hing-Fung
    Yiu, Siu-Ming
    Peng, Shaoliang
    Yu, Chang
    Li, Yingrui
    Li, Ruiqiang
    Lam, Tak-Wah
    [J]. PLOS ONE, 2013, 8 (05):
  • [82] PatternHunter: faster and more sensitive homology search
    Ma, B
    Tromp, J
    Li, M
    [J]. BIOINFORMATICS, 2002, 18 (03) : 440 - 445
  • [83] Mäkinen V, 2010, LECT NOTES COMPUT SC, V6060, P182, DOI 10.1007/978-3-642-12476-1_13
  • [84] SUFFIX ARRAYS - A NEW METHOD FOR ONLINE STRING SEARCHES
    MANBER, U
    MYERS, G
    [J]. SIAM JOURNAL ON COMPUTING, 1993, 22 (05) : 935 - 948
  • [85] Marco-Sola S, 2012, NAT METHODS, V9, P1185, DOI [10.1038/NMETH.2221, 10.1038/nmeth.2221]
  • [86] TotalReCaller: improved accuracy and performance via integrated alignment and base-calling
    Menges, Fabian
    Narzisi, Giuseppe
    Mishra, Bud
    [J]. BIOINFORMATICS, 2011, 27 (17) : 2330 - 2337
  • [87] Anatomy of a hash-based long read sequence mapping algorithm for next generation DNA sequencing
    Misra, Sanchit
    Agrawal, Ankit
    Liao, Wei-keng
    Choudhary, Alok
    [J]. BIOINFORMATICS, 2011, 27 (02) : 189 - 195
  • [88] Mapping and quantifying mammalian transcriptomes by RNA-Seq
    Mortazavi, Ali
    Williams, Brian A.
    McCue, Kenneth
    Schaeffer, Lorian
    Wold, Barbara
    [J]. NATURE METHODS, 2008, 5 (07) : 621 - 628
  • [89] A fast bit-vector algorithm for approximate string matching based on dynamic programming
    Myers, G
    [J]. JOURNAL OF THE ACM, 1999, 46 (03) : 395 - 415
  • [90] Narzisi G, 2014, NAT METHODS, V11, P1033, DOI [10.1038/NMETH.3069, 10.1038/nmeth.3069]