Skip Navigation

Nucleic Acids Research 2004 32(Web Server Issue):W445-W448; doi:10.1093/nar/gkh407
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (344K) 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 Jensen, L. J.
Right arrow Articles by Bork, P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Jensen, L. J.
Right arrow Articles by Bork, P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2004, the authors
Nucleic Acids Research, Vol. 32, Web Server issue © Oxford University Press 2004; all rights reserved

ArrayProspector: a web resource of functional associations inferred from microarray expression data

Lars Juhl Jensen1,2, Julien Lagarde1, Christian von Mering1,2 and Peer Bork1,2,*

1 European Molecular Biology Laboratory, Meyerhofstrasse 1, D-69117 Heidelberg, Germany and 2 Max-Delbrück-Centre for Molecular Medicine, Robert-Rössle-Strasse 10, D-13092 Berlin, Germany

* To whom correspondence should be addressed. Tel: +49 6221 387 526; Fax: +49 6221 387 519; Email: Peer.Bork{at}embl-Heidelberg.De

Received February 14, 2004; Revised and Accepted March 29, 2004

DNA microarray experiments have provided vast amounts of data which can be used for inferring gene function. However, most methods for predicting functional associations between genes from expression data are not suited to simultaneous analysis of multiple datasets, and a comprehensive resource of coexpression-based predictions is currently lacking. Here, we present an interactive web resource of gene associations predicted by applying a novel algorithm to all expression data in the Stanford Microarray Database. The underlying pre-computed database currently contains more than 200 000 high-confidence gene associations in 12 different species sampled from a broad taxonomic range. The resource allows every association to be inspected visually and can be accessed at http://www.bork.embl.de/ArrayProspector.


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 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.


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
G. Robertson, M. Bilenky, K. Lin, A. He, W. Yuen, M. Dagpinar, R. Varhol, K. Teague, O. L. Griffith, X. Zhang, et al.
cisRED: a database system for genome-scale computational discovery of regulatory elements
Nucleic Acids Res., January 1, 2006; 34(suppl_1): D68 - D73.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
C. von Mering, L. J. Jensen, B. Snel, S. D. Hooper, M. Krupp, M. Foglierini, N. Jouffre, M. A. Huynen, and P. Bork
STRING: known and predicted protein-protein associations, integrated and transferred across organisms
Nucleic Acids Res., January 1, 2005; 33(suppl_1): D433 - D437.
[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.