Research Article
Using hybrid alignment for iterative sequence database searches
Article first published online: 6 JUL 2004
DOI: 10.1002/cpe.809
Copyright © 2004 John Wiley & Sons, Ltd.
Issue
1532-0634/asset/cover.gif?v=1&s=6094df24c795ce080ff6df6ff3b6bcec19adb708)
Concurrency and Computation: Practice and Experience
Special Issue: High Performance Computational Biology
Volume 16, Issue 9, pages 841–853, 10 August 2004
Additional Information
How to Cite
Li, Y., Lauria, M. and Bundschuh, R. (2004), Using hybrid alignment for iterative sequence database searches. Concurrency and Computation: Practice and Experience, 16: 841–853. doi: 10.1002/cpe.809
Publication History
- Issue published online: 6 JUL 2004
- Article first published online: 6 JUL 2004
- Manuscript Accepted: 8 SEP 2003
- Manuscript Received: 13 JUN 2003
- Abstract
- References
- Cited By
Keywords:
- sequence alignment;
- hybrid algorithm;
- length correction;
- PSI-BLAST;
- MPI
Abstract
Progressive sequence model refinement by means of iterative searches is an effective technique for high sensitivity database searches and is currently employed in popular tools such as PSI-BLAST and SAM. Recently, a novel alignment algorithm has been proposed that offers features expected to improve the sensitivity of such iterative approaches, specifically a well-characterized theory of its statistics even in the presence of position-specific gap costs. Here, we demonstrate that the new hybrid alignment algorithm is ready to be used as the alignment core of PSI-BLAST. In addition, we evaluate the accuracy of two proposed approaches to edge effect correction in short sequence alignment statistics that turns out to be one of the crucial issues in developing a hybrid-alignment based version of PSI-BLAST. Copyright © 2004 John Wiley & Sons, Ltd.

1532-0634/asset/olbannerleft.gif?v=1&s=a4e4e145787de94e1d91eaab3c8c29d8a9d96a26)