Family pairwise search with embedded motif models

14Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

Motivation: Statistical models of protein families, such as position-specific scoring matrices, profiles and hidden Markov models, have been used effectively to find remote homologs when given a set of known protein family members. Unfortunately, training these models typically requires a relatively large set of training sequences. Recent work has shown that, when only a few family members are known, several theorectically justified statistical modeling techniques fail to provide homology detection performance on a par with Family Pairwise Search (FPS), an algorithm that combines scores from a pairwise sequence similarity algorithm such as BLAST. Results: The present paper provides a model-based algorithm that improves FPS by incorporating hybrid motif-based models of the form generated by Cobbler. For the 73 protein families investigated here, this cobbled FPS algorithm provides better homology detection performance than either Cobbler of FPS alone. This improvement is maintained when BLAST is replaced with the full Smith-Waterman algorithm.

Cite

CITATION STYLE

APA

Grundy, W. N., & Bailey, T. L. (1999). Family pairwise search with embedded motif models. Bioinformatics, 15(6), 463–470. https://doi.org/10.1093/bioinformatics/15.6.463

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free