Skip Navigation


Nucleic Acids Research Advance Access originally published online on October 31, 2008
Nucleic Acids Research 2009 37(Database issue):D185-D190; doi:10.1093/nar/gkn865
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (1760K) Freely available
Right arrow Screen PDF (256K) Freely available
Right arrowOA All Versions of this Article:
37/suppl_1/D185    most recent
gkn865v1
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 Rajasekaran, S.
Right arrow Articles by Schiller, M. R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Rajasekaran, S.
Right arrow Articles by Schiller, M. R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2009, Vol. 37, Database issue D185-D190
© 2008 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

This article appears in the following Nucleic Acids Research issue: Database issue [View the issue table of contents]

Articles

Minimotif miner 2nd release: a database and web system for motif search

Sanguthevar Rajasekaran1,*, Sudha Balla3, Patrick Gradie1, Michael R. Gryk2, Krishna Kadaveru2, Vamsi Kundeti1, Mark W. Maciejewski2, Tian Mi1, Nicholas Rubino1, Jay Vyas2 and Martin R. Schiller2

1Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06029-2155, 2Department of Molecular, Microbial, and Structural Biology, Biological System Modeling Group, University of Connecticut Health Center, 263 Farmington Ave. Farmington, CT 06030-3305 and 3Memorial Sloan-Kettering Cancer Center, NY 10021, USA

*To whom correspondence should be addressed. Tel: +860 486 2428; Fax: +860 486 4817; Email: rajasek{at}engr.uconn.edu

Correspondence may also be addressed to Martin R. Schiller. Tel: +860 6794610; Fax: +860 679 1726; Email: schiller{at}nso.uchc.edu

Received August 15, 2008. Accepted October 16, 2008.

Minimotif Miner (MnM) consists of a minimotif database and a web-based application that enables prediction of motif-based functions in user-supplied protein queries. We have revised MnM by expanding the database more than 10-fold to approximately 5000 motifs and standardized the motif function definitions. The web-application user interface has been redeveloped with new features including improved navigation, screencast-driven help, support for alias names and expanded SNP analysis. A sample analysis of prion shows how MnM 2 can be used. Weblink: http://mnm.engr.uconn.edu, weblink for version 1 is http://sms.engr.uconn.edu.


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
Nucleic Acids ResHome page
C. M. Gould, F. Diella, A. Via, P. Puntervoll, C. Gemund, S. Chabanis-Davidson, S. Michael, A. Sayadi, J. C. Bryne, C. Chica, et al.
ELM: the status of the 2010 eukaryotic linear motif resource
Nucleic Acids Res., November 17, 2009; (2009) gkp1016v1.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
D. T.-H. Chang, T.-Y. Chien, and C.-Y. Chen
seeMotif: exploring and visualizing sequence motifs in 3D structures
Nucleic Acids Res., July 1, 2009; 37(suppl_2): W552 - W558.
[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.