Skip Navigation

Nucleic Acids Research 2006 34(Web Server issue):W143-W146; doi:10.1093/nar/gkl157
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (292K) Freely available
Right arrow Screen PDF (294K) Freely available
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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Bhadra, R.
Right arrow Articles by Srinivasan, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bhadra, R.
Right arrow Articles by Srinivasan, N.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved
The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article for non-commercial purposes provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated. For commercial re-use, please contact journals.permissions@oxfordjournals.org


Article

Cascade PSI-BLAST web server: a remote homology search tool for relating protein domains

R. Bhadra1, S. Sandhya1,2, K. R. Abhinandan1, S. Chakrabarti2, R. Sowdhamini2 and N. Srinivasan1,*

1 Molecular Biophysics Unit, Indian Institute of Science 560 012, Bangalore, India 2 National Center for Biological Sciences, Tata Institute of Fundamental Research GKVK Campus, Bellary Road, Bangalore 560 065, India

*To whom correspondence should be addressed. Tel: +91 80 2293 2837; Fax: +91 80 2360 0535; Email: ns{at}mbu.iisc.ernet.in

Received February 3, 2006. Revised February 22, 2006. Accepted March 20, 2006.

Owing to high evolutionary divergence, it is not always possible to identify distantly related protein domains by sequence search techniques. Intermediate sequences possess sequence features of more than one protein and facilitate detection of remotely related proteins. We have demonstrated recently the employment of Cascade PSI-BLAST where we perform PSI-BLAST for many ‘generations’, initiating searches from new homologues as well. Such a rigorous propagation through generations of PSI-BLAST employs effectively the role of intermediates in detecting distant similarities between proteins. This approach has been tested on a large number of folds and its performance in detecting superfamily level relationships is ~35% better than simple PSI-BLAST searches. We present a web server for this search method that permits users to perform Cascade PSI-BLAST searches against the Pfam, SCOP and SwissProt databases. The URL for this server is http://crick.mbu.iisc.ernet.in/~CASCADE/CascadeBlast.html.


Present addresses: K. R. Abhinandan, Department of Biochemistry and Molecular Biology, University College, London, Gower Street, London WC1E 6BT, England

S. Chakrabarti, Computational Biology Branch, National Center for Biotechnology, Information (NCBI), National Library of Medicine (NLM), NIH, 8600, Rockville Pike, Bethesda, MD 20894, USA


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




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.