Exploiting balanced trees in the computation of elementary flux modes via breadth-first search
In order to rationally design bacteria to produce large quantities of their precious metabolic by-products, we must first understand the metabolic pathways that lead from a starting material (e.g., glucose) to a metabolic product (e.g., hydrogen). Given a set of reactions, elementary flux modes can...
Main Author: | Acosta, Fernando |
---|---|
Other Authors: | Cox, Steven |
Format: | Others |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/1911/17862 |
Similar Items
-
Direction-Optimizing Breadth-First Search
by: Scott Beamer, et al.
Published: (2013-01-01) -
Efficient Breadth-First Reduct Search
by: Veera Boonjing, et al.
Published: (2020-05-01) -
An approach to Graph Isomorphism using Spanning Trees generated by Breadth First Search
by: Ilchenko, Alexey
Published: (2014) -
Scalable parallel and client-server graph algorithms based on breadth first search trees
by: Li, Zhi Chao, et al.
Published: (1994) -
Theory and techniques for synthesizing efficient breadth-first search algorithms
by: Nedunuri, Srinivas
Published: (2012)