Skip Navigation


Bioinformatics Advance Access originally published online on November 29, 2005
Bioinformatics 2006 22(3):346-353; doi:10.1093/bioinformatics/bti800
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
22/3/346    most recent
bti800v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 ISI Web of Science
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 Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Vallabhajosyula, R. R.
Right arrow Articles by Sauro, H. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Vallabhajosyula, R. R.
Right arrow Articles by Sauro, H. M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Conservation analysis of large biochemical networks

Ravishankar Rao Vallabhajosyula *, Vijay Chickarmane and Herbert M. Sauro

Keck Graduate Institute 535 Watson Drive, Claremont, CA 91711, USA

*To whom correspondence should be addressed.

Motivation: Large biochemical networks pose a unique challenge from the point of view of evaluating conservation laws. The computational problem in most cases exceeds the capability of available software tools, often resulting in inaccurate computation of the number and form of conserved cycles. Such errors have profound effects on subsequent calculations, particularly in the evaluation of the Jacobian which is a critical quantity in many other calculations. The goal of this paper is to outline a new algorithm that is computationally efficient and robust at extracting the correct conservation laws for very large biochemical networks.

Results: We show that our algorithm can perform the conservation analysis of large biochemical networks, and can evaluate the correct conserved cycles when compared with other similar software tools. Biochemical simulators such as Jarnac and COPASI are successful at extracting only a subset of the conservation laws that our algorithm can. This is illustrated with examples for some large networks which show the advantages of our method.

Availability: The software is available as part of the latest release of Systems Biology Workbench (SBW version 2.5.0) and can be downloaded from http://www.sys-bio.org. The software is licensed under the BSD open source license and is freely available at sourceforge.

Contact: rrao{at}kgi.edu

Received on September 23, 2005; revised on November 22, 2005; accepted on November 23, 2005

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
S. Hoops, S. Sahle, R. Gauges, C. Lee, J. Pahle, N. Simus, M. Singhal, L. Xu, P. Mendes, and U. Kummer
COPASI--a COmplex PAthway SImulator
Bioinformatics, December 15, 2006; 22(24): 3067 - 3074.
[Abstract] [Full Text] [PDF]

Home page
 J R Soc InterfaceHome page
F. J Doyle III and J. Stelling
Systems interface biology
J R Soc Interface, October 22, 2006; 3(10): 603 - 616.
[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.