Construction of simple pathways and simple cycles in ecosystems.
We present software tools for overcoming the problem of combinatorics in the enumeration of simple pathways and simple cycles in a first flow-through analysis of carbon transfer in large ecosystems. Rather than search through the very large number of potential routes in a reasonably sized ecosystem for the relatively small number of actual routes, our main algorithm performs an efficient rule-based construction of the actual routes. The enumeration of the unique pathways becomes tractable in terms of CPU time, which increases linearly with ecosystem size and connectedness. Networks of up to 80 entities can be evaluated using our software.
Kincaid
D T
DT
Department of Biological Sciences, Lehman College, City University of New York, Bronx 10468.
Pilette
R
R
D000465:Algorithms; D002244:Carbon / Q000378:metabolism; D004463:Ecology; D008954:Models, Biological; D012984:Software
D002244:Carbon