Compressed indexing and local alignment of DNA Export

@article{citeulike:2835102, abstract = {Motivation: Recent experimental studies on compressed indexes (BWT, CSA, FM-index) have confirmed their practicality for indexing very long strings such as the human genome in the main memory. For example, a BWT index for the human genome (with about 3 billion characters) occupies just around 1 G bytes. However, these indexes are designed for exact pattern matching, which is too stringent for biological applications. The demand is often on finding local alignments (pairs of similar substrings with gaps allowed). Without indexing, one can use dynamic programming to find all the local alignments between a text T and a pattern P in O(|T||P|) time, but this would be too slow when the text is of genome scale (e.g. aligning a gene with the human genome would take tens to hundreds of hours). In practice, biologists use heuristic-based software such as BLAST, which is very efficient but does not guarantee to find all local alignments. Results: In this article, we show how to build a software called BWT-SW that exploits a BWT index of a text T to speed up the dynamic programming for finding all local alignments. Experiments reveal that BWT-SW is very efficient (e.g. aligning a pattern of length 3 000 with the human genome takes less than a minute). We have also analyzed BWT-SW mathematically for a simpler similarity model (with gaps disallowed), and we show that the expected running time is O(|T|0.628|P|) for random strings. As far as we know, BWT-SW is the first practical tool that can find all local alignments. Yet BWT-SW is not meant to be a replacement of BLAST, as BLAST is still several times faster than BWT-SW for long patterns and BLAST is indeed accurate enough in most cases (we have used BWT-SW to check against the accuracy of BLAST and found that only rarely BLAST would miss some significant alignments). Availability: www.cs.hku.hk/\~{}ckwong3/bwtsw Contact: twlam@cs.hku.hk 10.1093/bioinformatics/btn032}, author = {Lam, T. W. and Sung, W. K. and Tam, S. L. and Wong, C. K. and Yiu, S. M.}, citeulike-article-id = {2835102}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/bioinformatics/btn032}, citeulike-linkout-1 = {http://bioinformatics.oxfordjournals.org/content/24/6/791.abstract}, citeulike-linkout-2 = {http://bioinformatics.oxfordjournals.org/content/24/6/791.full.pdf}, citeulike-linkout-3 = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/24/6/791}, citeulike-linkout-4 = {http://www.ingentaconnect.com/content/oup/cabios/2008/00000024/00000006/art00008}, citeulike-linkout-5 = {http://view.ncbi.nlm.nih.gov/pubmed/18227115}, citeulike-linkout-6 = {http://www.hubmed.org/display.cgi?uids=18227115}, day = {15}, doi = {10.1093/bioinformatics/btn032}, issn = {1367-4811}, journal = {Bioinformatics}, keywords = {algorithms, alignment}, month = {March}, number = {6}, pages = {791--797}, posted-at = {2008-08-06 11:58:08}, priority = {2}, publisher = {Oxford University Press}, title = {Compressed indexing and local alignment of DNA}, url = {http://dx.doi.org/10.1093/bioinformatics/btn032}, volume = {24}, year = {2008} }

TY - JOUR ID - citeulike:2835102 L3 - citeulike-article-id:2835102 N2 - Motivation: Recent experimental studies on compressed indexes (BWT, CSA, FM-index) have confirmed their practicality for indexing very long strings such as the human genome in the main memory. For example, a BWT index for the human genome (with about 3 billion characters) occupies just around 1 G bytes. However, these indexes are designed for exact pattern matching, which is too stringent for biological applications. The demand is often on finding local alignments (pairs of similar substrings with gaps allowed). Without indexing, one can use dynamic programming to find all the local alignments between a text T and a pattern P in O(|T||P|) time, but this would be too slow when the text is of genome scale (e.g. aligning a gene with the human genome would take tens to hundreds of hours). In practice, biologists use heuristic-based software such as BLAST, which is very efficient but does not guarantee to find all local alignments. Results: In this article, we show how to build a software called BWT-SW that exploits a BWT index of a text T to speed up the dynamic programming for finding all local alignments. Experiments reveal that BWT-SW is very efficient (e.g. aligning a pattern of length 3 000 with the human genome takes less than a minute). We have also analyzed BWT-SW mathematically for a simpler similarity model (with gaps disallowed), and we show that the expected running time is O(|T|0.628|P|) for random strings. As far as we know, BWT-SW is the first practical tool that can find all local alignments. Yet BWT-SW is not meant to be a replacement of BLAST, as BLAST is still several times faster than BWT-SW for long patterns and BLAST is indeed accurate enough in most cases (we have used BWT-SW to check against the accuracy of BLAST and found that only rarely BLAST would miss some significant alignments). Availability: www.cs.hku.hk/~ckwong3/bwtsw Contact: twlam@cs.hku.hk 10.1093/bioinformatics/btn032 IS - 6 JF - Bioinformatics SN - 1367-4811 EP - 797 TI - Compressed indexing and local alignment of DNA PB - Oxford University Press VL - 24 SP - 791 KW - algorithms KW - alignment AU - Lam, TW AU - Sung, WK AU - Tam, SL AU - Wong, CK AU - Yiu, SM PY - 2008/03/15/ UR - http://dx.doi.org/10.1093/bioinformatics/btn032 ER -