Premium
Using hybrid alignment for iterative sequence database searches
Author(s) -
Li Yuheng,
Lauria Mario,
Bundschuh Ralf
Publication year - 2004
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
ISBN - 0-7695-1926-1
DOI - 10.1002/cpe.809
Subject(s) - computer science , sequence (biology) , sensitivity (control systems) , enhanced data rates for gsm evolution , iterative refinement , multiple sequence alignment , iterative method , data mining , position (finance) , algorithm , sequence alignment , artificial intelligence , engineering , biochemistry , genetics , chemistry , finance , electronic engineering , gene , economics , peptide sequence , biology
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.