Comparative homology agreement search: An effective combination of homology-search methods
AUTOR(ES)
Alam, Intikhab
FONTE
National Academy of Sciences
RESUMO
Many methods have been developed to search for homologous members of a protein family in databases, and the reliability of results and conclusions may be compromised if only one method is used, neglecting the others. Here we introduce a general scheme for combining such methods. Based on this scheme, we implemented a tool called comparative homology agreement search (chase) that integrates different search strategies to obtain a combined “E value.” Our results show that a consensus method integrating distinct strategies easily outperforms any of its component algorithms. More specifically, an evaluation based on the Structural Classification of Proteins database reveals that, on average, a coverage of 47% can be obtained in searches for distantly related homologues (i.e., members of the same superfamily but not the same family, which is a very difficult task), accepting only 10 false positives, whereas the individual methods obtain a coverage of 28–38%.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=518839Documentos Relacionados
- The effect of midazolam on visual search: Implications for understanding amnesia
- Simultaneous remote search: a technique of providing MEDLARS Services to remote locations.
- An effective day case treatment combination for refractory neuropathic mixed incontinence
- The Search for an Effective Clinical Behavior Analysis: The Nonlinear Thinking of Israel Goldiamond
- Nanotechnology, Light and Chemical Action: an Effective Combination to Kill Cancer Cells