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 Wise, M. J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Wise, M. J.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 90001 2001
Pages S288-S295
© 2001 Oxford University Press

0j.py: a software tool for low complexity proteins and protein domains

Michael J. Wise

Centre for Communications Systems Research, 10 Downing Street, Cambridge, CB2 3DS, England

Received on February 5, 2001 ; revised on March 29, 2001 ; accepted on March 29, 2001

Low complexity proteins and protein domains have sequences which appear highly non-random. Over the years, these sequences have been routinely filtered out during sequence similarity searches because interest has been focused on globular proteins, and inclusion of these domains can severely skew search results. However, early work on these proteins and more recent studies of the related area of repeated protein sequences suggests that low complexity protein domains have function and therefore are in need of further investigation. 0j.py is a new tool for demarcating low complexity protein domains more accurately than has been possible to date. The paper describes 0j.py and its use in revealing proteins with repeated and poly-amino-acid peptides. Statistical methods are then employed to to examine the distribution of these proteins across species, while keyword clustering is used to suggest roles performed by proteins through the use of low complexity domains.

Contact: M.Wise{at}ccsr.cam.ac.uk


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
X. Li and T. Kahveci
A Novel algorithm for identifying low-complexity regions in a protein sequence
Bioinformatics, December 15, 2006; 22(24): 2980 - 2987.
[Abstract] [Full Text] [PDF]

Home page
 Mol. Cell. ProteomicsHome page
Y. Benita, M. J. Wise, M. C. Lok, I. Humphery-Smith, and R. S. Oosting
Analysis of High Throughput Protein Expression in Escherichia coli
Mol. Cell. Proteomics, September 1, 2006; 5(9): 1567 - 1580.
[Abstract] [Full Text] [PDF]

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]


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.