Loading…
Optimal data collection for correlated mutation analysis
The main objective of correlated mutation analysis (CMA) is to predict intraprotein residue–residue interactions from sequence alone. Despite considerable progress in algorithms and computer capabilities, the performance of CMA methods remains quite low. Here we examine whether, and to what extent,...
Saved in:
Published in: | Proteins, structure, function, and bioinformatics structure, function, and bioinformatics, 2009-02, Vol.74 (3), p.545-555 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The main objective of correlated mutation analysis (CMA) is to predict intraprotein residue–residue interactions from sequence alone. Despite considerable progress in algorithms and computer capabilities, the performance of CMA methods remains quite low. Here we examine whether, and to what extent, the quality of CMA methods depends on the sequences that are included in the multiple sequence alignment (MSA). The results revealed a strong correlation between the number of homologs in an MSA and CMA prediction strength. Furthermore, many of the current methods include only orthologs in the MSA, we found that it is beneficial to include both orthologs and paralogs in the MSA. Remarkably, even remote homologs contribute to the improved accuracy. Based on our findings we put forward an automated data collection procedure, with a minimal coverage of 50% between the query protein and its orthologs and paralogs. This procedure improves accuracy even in the absence of manual curation. In this era of massive sequencing and exploding sequence data, our results suggest that correlated mutation‐based methods have not reached their inherent performance limitations and that the role of CMA in structural biology is far from being fulfilled. Proteins 2009. © 2008 Wiley‐Liss, Inc. |
---|---|
ISSN: | 0887-3585 1097-0134 |
DOI: | 10.1002/prot.22168 |