English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

De novo identification of highly diverged protein repeats by probabilistic consistency.

MPS-Authors
/persons/resource/persons128572

Söding,  J.
Research Group of Computational Biology, MPI for Biophysical Chemistry, Max Planck Society;

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

1944238.pdf
(Publisher version), 755KB

Supplementary Material (public)

1944238_Suppl_1.pdf
(Supplementary material), 2MB

Citation

Biegert, A., & Söding, J. (2008). De novo identification of highly diverged protein repeats by probabilistic consistency. Bioinformatics, 24(6), 807-814. doi:10.1093/bioinformatics/btn039.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0017-DADF-9
Abstract
Motivation: An estimated 25% of all eukaryotic proteins contain repeats, which underlines the importance of duplication for evolving new protein functions. Internal repeats often correspond to structural or functional units in proteins. Methods capable of identifying diverged repeated segments or domains at the sequence level can therefore assist in predicting domain structures, inferring hypotheses about function and mechanism, and investigating the evolution of proteins from smaller fragments. Results: We present HHrepID, a method for the de novo identification of repeats in protein sequences. It is able to detect the sequence signature of structural repeats in many proteins that have not yet been known to possess internal sequence symmetry, such as outer membrane β-barrels. HHrepID uses HMM–HMM comparison to exploit evolutionary information in the form of multiple sequence alignments of homologs. In contrast to a previous method, the new method (1) generates a multiple alignment of repeats; (2) utilizes the transitive nature of homology through a novel merging procedure with fully probabilistic treatment of alignments; (3) improves alignment quality through an algorithm that maximizes the expected accuracy; (4) is able to identify different kinds of repeats within complex architectures by a probabilistic domain boundary detection method and (5) improves sensitivity through a new approach to assess statistical significance.