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

Bioinformatics Vol. 19 Suppl. 2 2003
pages ii122-ii129
© 2003 Oxford University Press

Artificial gene networks for objective comparison of analysis algorithms

Pedro Mendes 1,*, Wei Sha 1 and Keying Ye 2

1 Virginia Bioinformatics Institute, USA
2 Statistics Department, Virginia Polytechnic Institute and State University, 1880 Pratt Drive, Blacksburg, VA 24061, USA

Received on March 17, 2003 ; accepted on June 9, 2003

Motivation: Large-scale gene expression profiling generates data sets that are rich in observed features but poor in numbers of observations. The analysis of such data sets is a challenge that has been object of vigorous research. The algorithms in use for this purpose have been poorly documented and rarely compared objectively, posing a problem of uncertainty about the outcomes of the analyses. One way to objectively test such analysis algorithms is to apply them on computational gene network models for which the mechanisms are completely know.

Results: We present a system that generates random artificial gene networks according to well-defined topological and kinetic properties. These are used to run in silico experiments simulating real laboratory microarray experiments. Noise with controlled properties is added to the simulation results several times emulating measurement replicates, before expression ratios are calculated.

Availability: The data sets and kinetic models described here are available from http://www.vbi.vt.edu/~mendes/AGN/as biochemical dynamic models in SBML and Gepasi formats.

Contact: mendes{at}vt.edu

* To whom correspondence should be addressed.


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
M. Zampieri, N. Soranzo, and C. Altafini
Discerning static and causal interactions in genome-wide reverse engineering problems
Bioinformatics, July 1, 2008; 24(13): 1510 - 1515.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
V. Vyshemirsky and M. A. Girolami
Bayesian ranking of biochemical system models
Bioinformatics, March 15, 2008; 24(6): 833 - 839.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
N. Soranzo, G. Bianconi, and C. Altafini
Comparing association network algorithms for reverse engineering of large-scale gene regulatory networks: synthetic versus real data
Bioinformatics, July 1, 2007; 23(13): 1640 - 1647.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
R. C. Taylor, A. Shah, C. Treatman, and M. Blevins
SEBINI: Software Environment for BIological Network Inference
Bioinformatics, November 1, 2006; 22(21): 2706 - 2708.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
R. Steuer
Review: On the analysis and interpretation of correlations in metabolomic data
Brief Bioinform, June 1, 2006; 7(2): 151 - 158.
[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.