Choosing the best heuristic for seeded alignment of DNA sequences |
| |
Authors: | Yanni Sun Jeremy Buhler |
| |
Affiliation: | (1) Department of Computer Science and Engineering, Washington University, St. Louis, MO, USA |
| |
Abstract: | Background Seeded alignment is an important component of algorithms for fast, large-scale DNA similarity search. A good seed matching heuristic can reduce the execution time of genomic-scale sequence comparison without degrading sensitivity. Recently, many types of seed have been proposed to improve on the performance of traditional contiguous seeds as used in, e.g., NCBI BLASTN. Choosing among these seed types, particularly those that use information besides the presence or absence of matching residue pairs, requires practical guidance based on a rigorous comparison, including assessment of sensitivity, specificity, and computational efficiency. This work performs such a comparison, focusing on alignments in DNA outside widely studied coding regions. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|