Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
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 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Müller, T.
Right arrow Articles by Rehmsmeier, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Müller, T.
Right arrow Articles by Rehmsmeier, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 90001 2001
Pages S182-S189
© 2001 Oxford University Press

Non-symmetric score matrices and the detection of homologous transmembrane proteins

Tobias Müller 1,2, Sven Rahmann 1,2 and Marc Rehmsmeier 1

1 Theoretische Bioinformatik (TBI), Deutsches Krebsforschungszentrum, Im Neuenheimer Feld 280, Heidelberg, D-61920, Germany
2 Dept. of Computational Molecular Biology, MPI für Molekulare Genetik, Ihnestraße 73, Berlin, D-14195, Germany

Received on February 5, 2001 ; revised on April 2, 2001 ; accepted on April 2, 2001

Given a transmembrane protein, we wish to find related ones by a database search. Due to the strongly hydrophobic amino acid composition of transmembrane domains, suboptimal results are obtained when general-purpose scoring matrices such as BLOSUM are used. Recently, a transmembrane-specific score matrix called PHAT was shown to perform much better than BLOSUM. In this article, we derive a transmembrane score matrix family, called SLIM, which has several distinguishing features. In contrast to currently used matrices, SLIM is non-symmetric. The asymmetry arises because different background compositions are assumed for the transmembrane query and the unknown database sequences. We describe the mathematical model behind SLIM in detail and show that SLIM outperforms PHAT both on simulated data and in a realistic setting. Since non-symmetric score matrices are a new concept in database search methods, we discuss some important theoretical and practical issues.

Contact: muelle_t{at}molgen.mpg.de


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
 Eukaryot CellHome page
J. E. Coronado, O. Attie, S. L. Epstein, W.-G. Qiu, and P. N. Lipke
Composition-Modified Matrices Improve Identification of Homologs of Saccharomyces cerevisiae Low-Complexity Glycoproteins.
Eukaryot. Cell, April 1, 2006; 5(4): 628 - 637.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
T. J. Urban, R. Sebro, E. H. Hurowitz, M. K. Leabman, I. Badagnani, L. L. Lagpacan, N. Risch, and K. M. Giacomini
Functional genomics of membrane transporters in human populations
Genome Res., February 1, 2006; 16(2): 223 - 230.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
Y.-K. Yu and S. F. Altschul
The construction of amino acid substitution matrices for the comparison of proteins with non-standard compositions
Bioinformatics, April 1, 2005; 21(7): 902 - 911.
[Abstract] [Full Text] [PDF]

Home page
 Proc. Natl. Acad. Sci. USAHome page
Y.-K. Yu, J. C. Wootton, and S. F. Altschul
The compositional adjustment of amino acid substitution matrices
PNAS, December 23, 2003; 100(26): 15688 - 15693.
[Abstract] [Full Text] [PDF]

Home page
 Protein Sci.Home page
M. Hedman, H. Deloof, G. Von Heijne, and A. Elofsson
Improved detection of homologous membrane proteins by inclusion of information from topology predictions
Protein Sci., March 1, 2002; 11(3): 652 - 658.
[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.