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 条
  • [41] mrsFAST: a cache-oblivious algorithm for short-read mapping
    Hach, Faraz
    Hormozdiari, Fereydoun
    Alkan, Can
    Hormozdiari, Farhad
    Birol, Inanc
    Eichler, Evan E.
    Sahinalp, S. Cenk
    [J]. NATURE METHODS, 2010, 7 (08) : 576 - 577
  • [42] Benchmarking short sequence mapping tools
    Hatem, Ayat
    Bozdag, Doruk
    Toland, Amanda E.
    Catalyuerek, Uemit V.
    [J]. BMC BIOINFORMATICS, 2013, 14
  • [43] Annotating large genomes with exact word matches
    Healy, J
    Thomas, EE
    Schwartz, JT
    Wigler, M
    [J]. GENOME RESEARCH, 2003, 13 (10) : 2306 - 2315
  • [44] BFAST: An Alignment Tool for Large Scale Genome Resequencing
    Homer, Nils
    Merriman, Barry
    Nelson, Stanley F.
    [J]. PLOS ONE, 2009, 4 (11): : A95 - A106
  • [45] Hyyro H., 2003, Nordic Journal of Computing, V10, P29
  • [46] SeqMap: mapping massive amount of oligonucleotides to the genome
    Jiang, Hui
    Wong, Wing Hung
    [J]. BIOINFORMATICS, 2008, 24 (20) : 2395 - 2396
  • [47] Genome-wide mapping of in vivo protein-DNA interactions
    Johnson, David S.
    Mortazavi, Ali
    Myers, Richard M.
    Wold, Barbara
    [J]. SCIENCE, 2007, 316 (5830) : 1497 - 1502
  • [48] JOKINEN P, 1991, LECT NOTES COMPUT SC, V520, P240
  • [49] Karkkainen J., 1996, Proceedings of the Third South American Workshop on String Processing. WSP 1996, P141
  • [50] Kärkkäinen J, 2007, SIAM PROC S, P84