Skip Navigation


Bioinformatics Advance Access originally published online on November 22, 2005
Bioinformatics 2006 22(2):149-156; doi:10.1093/bioinformatics/bti791
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
22/2/149    most recent
bti791v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mihalek, I.
Right arrow Articles by Lichtarge, O.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Mihalek, I.
Right arrow Articles by Lichtarge, O.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oxfordjournals.org

A structure and evolution-guided Monte Carlo sequence selection strategy for multiple alignment-based analysis of proteins

I. Mihalek *, I. Res and O. Lichtarge

Department of Molecular and Human Genetics, Baylor College of Medicine One Baylor Plaza, Houston, TX 77030, USA

*To whom correspondence should be addressed.

Motivation: Various multiple sequence alignment-based methods have been proposed to detect functional surfaces in proteins, such as active sites or protein interfaces. The effect that the choice of sequences has on the conclusions of such analysis has seldom been discussed. In particular, no method has been discussed in terms of its ability to optimize the sequence selection for the reliable detection of functional surfaces.

Results: Here we propose, for the case of proteins with known structure, a heuristic Metropolis Monte Carlo strategy to select sequences from a large set of homologues, in order to improve detection of functional surfaces. The quantity guiding the optimization is the clustering of residues which are under increased evolutionary pressure, according to the sample of sequences under consideration. We show that we can either improve the overlap of our prediction with known functional surfaces in comparison with the sequence similarity criteria of selection or match the quality of prediction obtained through more elaborate non-structure based-methods of sequence selection. For the purpose of demonstration we use a set of 50 homodimerizing enzymes which were co-crystallized with their substrates and cofactors.

Contact: imihalek{at}bcm.tmc.edu

Supplementary information: Supplementary data are available at Bioinformatics online.


Received on May 18, 2005; revised on November 15, 2005; accepted on November 16, 2005

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
D. H. Morgan, D. M. Kristensen, D. Mittelman, and O. Lichtarge
ET viewer: an application for predicting and visualizing functional sites in protein structures
Bioinformatics, August 15, 2006; 22(16): 2049 - 2050.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
I. Mihalek, I. Res, and O. Lichtarge
Evolutionary trace report_maker: a new type of service for comparative analysis of proteins
Bioinformatics, July 1, 2006; 22(13): 1656 - 1657.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.