2018
DOI: 10.2174/2213235x05666161221160658
|View full text |Cite
|
Sign up to set email alerts
|

On a Queueing Theory Method to Simulate In-Silico Metabolic Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Conversely, during inflow the scaling is inversely proportional. As previously mentioned, we have used queues to describe additional biological pathways and have provided detailed explanations of the proposed queueing theory methods [41], [42]. Additionally, the pseudocode of the queueing theory application is provided as a supplementary file.…”
Section: Methodsmentioning
confidence: 99%
“…Conversely, during inflow the scaling is inversely proportional. As previously mentioned, we have used queues to describe additional biological pathways and have provided detailed explanations of the proposed queueing theory methods [41], [42]. Additionally, the pseudocode of the queueing theory application is provided as a supplementary file.…”
Section: Methodsmentioning
confidence: 99%
“…For example, queuing networks were able to accurately model nonviral gene delivery incorporating mitosis in cells (Wysocki et al, 2014). A more comprehensive assessment of the disadvantages of ODEs compared to the advantages of queuing theory has been reviewed previously (Clement et al, 2018). To summarize, alteration of initial conditions and their dependency on time and random factors makes achieving a solution to ODEs computationally intensive.…”
Section: Methodsmentioning
confidence: 99%
“…Given the interdependency of the concentrations C 1 ( t 0 ), …, C N ( t 0 ), which is usually highly non-linear, and further dependency of other time varying and/or random factors, achieving the solution of such sets of equations is not only extremely computationally intensive, but also not guaranteed to produce a numerically stable result. The problem is further complicated by the fact that the concentrations C 1 ( t ), …, C N ( t ) are always non-negative, and as reported by Infante et al [30], and Erbe et al[31], this is a non-trivial task or such a solution may not even exist. One can force the numerical solver to produce the non-negative solution, for example by using MATLAB’s ‘NonNegative’ option is in the ‘odeset’ solver [32].…”
Section: Methodsmentioning
confidence: 99%