Skip Navigation


Bioinformatics Advance Access originally published online on April 7, 2005
Bioinformatics 2005 21(12):2821-2826; doi:10.1093/bioinformatics/bti432
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
21/12/2821    most recent
bti432v1
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 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 (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Anand, B.
Right arrow Articles by Srinivasan, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Anand, B.
Right arrow Articles by Srinivasan, N.
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}oupjournals.org

Use of multiple profiles corresponding to a sequence alignment enables effective detection of remote homologues

B. Anand {dagger}, V.S. Gowri and N. Srinivasan *

Molecular Biophysics Unit, Indian Institute of Science Bangalore 560 012, India

*To whom correspondence should be addressed.

Motivation: Position specific scoring matrices (PSSMs) corresponding to aligned sequences of homologous proteins are commonly used in homology detection. A PSSM is generated on the basis of one of the homologues as a reference sequence, which is the query in the case of PSI-BLAST searches. The reference sequence is chosen arbitrarily while generating PSSMs for reverse BLAST searches. In this work we demonstrate that the use of multiple PSSMs corresponding to a given alignment and variable reference sequences is more effective than using traditional single PSSMs and hidden Markov models.

Results: Searches for proteins with known 3-D structures have been made against three databases of protein family profiles corresponding to known structures: (1) One PSSM per family; (2) multiple PSSMs corresponding to an alignment and variable reference sequences for every family; and (3) hidden Markov models. A comparison of the performances of these three approaches suggests that the use of multiple PSSMs is most effective.

Contact: ns{at}mbu.iisc.ernet.in


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
Q.-w. Dong, X.-l. Wang, and L. Lin
Application of latent semantic analysis to protein remote homology detection
Bioinformatics, February 1, 2006; 22(3): 285 - 290.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
V. S. Gowri, O. Krishnadev, C. S. Swamy, and N. Srinivasan
MulPSSM: a database of multiple position-specific scoring matrices of protein domain families
Nucleic Acids Res., January 1, 2006; 34(suppl_1): D243 - D246.
[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.