Journal Article

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

David Mittelman, Ruslan Sadreyev and Nick Grishin

in Bioinformatics

Volume 19, issue 12, pages 1531-1539
Published in print August 2003 | ISSN: 1367-4803
Published online August 2003 | e-ISSN: 1460-2059 | DOI: http://dx.doi.org/10.1093/bioinformatics/btg185
Probabilistic scoring measures for profile–profile
comparison yield more accurate short seed alignments

Show Summary Details

Preview

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@chop.swmed.edu

*

To whom correspondence should be addressed.

Journal Article.  0 words. 

Subjects: Bioinformatics and Computational Biology

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.