Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (27)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mittelman, D.
Right arrow Articles by Grishin, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Mittelman, D.
Right arrow Articles by Grishin, N.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 12 2003
Pages 1531-1539
© 2003 Oxford University Press

Probabilistic scoring measures for profile–profile comparison yield more accurate short seed alignments

David Mittelman 2, Ruslan Sadreyev 1,* and Nick Grishin 1,2

1 Howard Hughes Medical Institute
2 Department of Biochemistry, University of Texas Southwestern Medical Center, 5323 Harry Hines Blvd, Dallas, TX 75390-9050, USA

Received on November 18, 2002 ; revised on February 6, 2003 ; accepted on February 20, 2003

Motivation: The development of powerful automatic methods for the comparison of protein sequences has become increasingly important. Profile-to-profile comparisons allow for the use of broader information about protein families, resulting in more sensitive and accurate comparisons of distantly related sequences. A key part in the comparison of two profiles is the method for the calculation of scores for the position matches. A number of methods based on various theoretical considerations have been proposed. We implemented several previously reported scoring functions as well as our own functions, and compared them on the basis of their ability to produce accurate short ungapped alignments of a given length.

Results: Our results suggest that the family of the probabilistic methods (log-odds based methods and prof_sim) may be the more appropriate choice for the generation of initial ‘seeds’ as the first step to produce local profile–profile alignments. The most effective scoring systems were the closely related modifications of functions previously implemented in the COMPASS and Picasso methods.

Contact: sadreyev{at}chop.swmed.edu

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
J. H. Fong and A. Marchler-Bauer
CORAL: aligning conserved core regions across domain families
Bioinformatics, August 1, 2009; 25(15): 1862 - 1868.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
A. Lobley, M. I. Sadowski, and D. T. Jones
pGenTHREADER and pDomTHREADER: new methods for improved protein fold recognition and superfamily discrimination
Bioinformatics, July 15, 2009; 25(14): 1761 - 1767.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
O. Fornes, R. Aragues, J. Espadaler, M. A. Marti-Renom, A. Sali, and B. Oliva
ModLink+: improving fold recognition by using protein-protein interactions
Bioinformatics, June 15, 2009; 25(12): 1506 - 1512.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
N. Shu, T. Zhou, and S. Hovmoller
Prediction of zinc-binding sites in proteins from sequence
Bioinformatics, March 15, 2008; 24(6): 775 - 782.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. Rangwala and G. Karypis
Incremental window-based protein sequence alignment algorithms
Bioinformatics, January 15, 2007; 23(2): e17 - e23.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Cheng and P. Baldi
A machine learning information retrieval approach to protein fold recognition
Bioinformatics, June 15, 2006; 22(12): 1456 - 1463.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
H. Rangwala and G. Karypis
Profile-based direct kernels for remote homology detection and fold recognition
Bioinformatics, December 1, 2005; 21(23): 4239 - 4247.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. Frenkel-Morgenstern, H. Voet, and S. Pietrokovski
Enhanced statistics for local alignment of multiple alignments improves prediction of protein function and structure
Bioinformatics, July 1, 2005; 21(13): 2950 - 2956.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
J. Espadaler, R. Aragues, N. Eswar, M. A. Marti-Renom, E. Querol, F. X. Aviles, A. Sali, and B. Oliva
Detecting remotely related proteins by their interactions and sequence similarity
PNAS, May 17, 2005; 102(20): 7151 - 7156.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
R. Y. Kahsay, G. Wang, G. Gao, L. Liao, and R. Dunbrack
Quasi-consensus-based comparison of profile hidden Markov models for protein sequences
Bioinformatics, May 15, 2005; 21(10): 2287 - 2293.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
J. Soding
Protein homology detection by HMM-HMM comparison
Bioinformatics, April 1, 2005; 21(7): 951 - 960.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
V. A. Simossis, J. Kleinjung, and J. Heringa
Homology-extended sequence alignment
Nucleic Acids Res., February 7, 2005; 33(3): 816 - 824.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.