摘要
The main way of analyzing biological sequences is by comparing and aligning them to each other. It remains difficult, however, to compare modern multi-billionbase DNA data sets. The difficulty is caused by the nonuniform (oligo)nucleotide composition of these sequences, rather than their size per se. To solve this problem, we modified the standard seed-and-extend approach (e.g., BLAST) to use adaptive seeds. Adaptive seeds are matches that are chosen based on their rareness, instead of using fixed-length matches. This method guarantees that the number of matches, and thus the running time, increases linearly, instead of quadratically, with sequence length. LAST, our open source implementation of adaptive seeds, enables fast and sensitive comparison of large sequences with arbitrarily nonuniform composition.
| 原文 | English |
|---|---|
| 頁(從 - 到) | 487-493 |
| 頁數 | 7 |
| 期刊 | Genome Research |
| 卷 | 21 |
| 發行號 | 3 |
| DOIs | |
| 出版狀態 | Published - 2011 3月 |
All Science Journal Classification (ASJC) codes
- 遺傳學
- 遺傳學(臨床)
指紋
深入研究「Adaptive seeds tame genomic sequence comparison」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver