CGAP-Align: A High Performance DNA Short Read Alignment Tool

被引:1
作者
Chen, Yaoliang [1 ]
Hong, Ji [1 ]
Cui, Wanyun [1 ]
Zaneveld, Jacques [2 ]
Wang, Wei [1 ]
Gibbs, Richard [2 ]
Xiao, Yanghua [1 ]
Chen, Rui [2 ]
机构
[1] Fudan Univ, Sch Comp Sci, Shanghai 200433, Peoples R China
[2] Baylor Coll Med, Human Genome Sequencing Ctr, Dept Mol & Human Genet, Houston, TX 77030 USA
来源
PLOS ONE | 2013年 / 8卷 / 04期
基金
中国国家自然科学基金;
关键词
GENOME; OLIGONUCLEOTIDES; SEQUENCES; ULTRAFAST; PROGRAM;
D O I
10.1371/journal.pone.0061033
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: Next generation sequencing platforms have greatly reduced sequencing costs, leading to the production of unprecedented amounts of sequence data. BWA is one of the most popular alignment tools due to its relatively high accuracy. However, mapping reads using BWA is still the most time consuming step in sequence analysis. Increasing mapping efficiency would allow the community to better cope with ever expanding volumes of sequence data. Results: We designed a new program, CGAP-align, that achieves a performance improvement over BWA without sacrificing recall or precision. This is accomplished through the use of Suffix Tarray, a novel data structure combining elements of Suffix Array and Suffix Tree. We also utilize a tighter lower bound estimation for the number of mismatches in a read, allowing for more effective pruning during inexact mapping. Evaluation of both simulated and real data suggests that CGAP-align consistently outperforms the current version of BWA and can achieve over twice its speed under certain conditions, all while obtaining nearly identical results. Conclusion: CGAP-align is a new time efficient read alignment tool that extends and improves BWA. The increase in alignment speed will be of critical assistance to all sequence-based research and medicine. CGAP-align is freely available to the academic community at http://sourceforge.net/p/cgap-align under the GNU General Public License (GPL).
引用
收藏
页数:8
相关论文
共 24 条
[1]  
Abouelhoda M. I., 2004, Journal of Discrete Algorithms, V2, P53, DOI 10.1016/S1570-8667(03)00065-0
[2]   EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].
AHO, AV ;
CORASICK, MJ .
COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340
[3]  
Burrows M, 1994, BLOCK SORTING LOSSLE, V124
[4]   PASS: a program to align short sequences [J].
Campagna, Davide ;
Albiero, Alessandro ;
Bilardi, Alessandra ;
Caniato, Elisa ;
Forcato, Claudio ;
Manavski, Svetlin ;
Vitulo, Nicola ;
Valle, Giorgio .
BIOINFORMATICS, 2009, 25 (07) :967-968
[5]   MOM: maximum oligonucleotide mapping [J].
Eaves, Hugh L. ;
Gao, Yuan .
BIOINFORMATICS, 2009, 25 (07) :969-970
[6]   Opportunistic data structures with applications [J].
Ferragina, P ;
Manzini, G .
41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, :390-398
[7]  
Hon W.K., 2004, ALENEX ANALC
[8]   SeqMap: mapping massive amount of oligonucleotides to the genome [J].
Jiang, Hui ;
Wong, Wing Hung .
BIOINFORMATICS, 2008, 24 (20) :2395-2396
[9]   ProbeMatch: rapid alignment of oligonucleotides to genome allowing both gaps and mismatches [J].
Kim, You Jung ;
Teletia, Nikhil ;
Ruotti, Victor ;
Maher, Christopher A. ;
Chinnaiyan, Arul M. ;
Stewart, Ron ;
Thomson, James A. ;
Patel, Jignesh M. .
BIOINFORMATICS, 2009, 25 (11) :1424-1425
[10]  
Ko P., 2003, LNCS, V2676, P203