Elena Dimitrova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Elena Dimitrova has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Brandilyn Stigler
Southern Methodist University
5 shared publications - Abdul Salam Jarrah
Department of Mathematics and Statistics, American University of Sharjah, Sharjah, United Arab Emirates
3 shared publications - Paola Vera-Licona
UConn Health
2 shared publications - Qijun He
Biocomplexity Institute, University of Virginia, Charlottesville, USA
2 shared publications - Reinhard Laubenbacher
Department of Medicine, University of Florida, Gainesville, USA
2 shared publications - Reinhard Laubenbacher
Virginia Tech
2 shared publications
Latest Publications
- Open Access
Algebraic Experimental Design: Theory and Computation
Over the past several decades, algebraic geometry has provided innovative approaches to biological experimental design that resolved theoretical questions and improved computational efficiency. However, guaranteeing uniqueness and perfect recovery of models are still open problems. In this work we study the problem of uniqueness of wiring diagrams. We use as a modeling framework polynomial dynamical systems and utilize the correspondence between simplicial complexes and square-free monomial ideals from Stanley-Reisner theory to develop theory and construct an algorithm for identifying input data sets $V\subset \mathbb F_p^n$ that are guaranteed to correspond to a unique minimal wiring diagram regardless of the experimental output. We apply the results on a tumor-suppression network mediated by epidermal derived growth factor receptor and demonstrate how careful experimental design decisions can lead to a unique minimal wiring diagram identification. One of the insights of the theoretical work is the connection between the uniqueness of a wiring diagram for a given $V\subset \mathbb F_p^n$ and the uniqueness of the reduced Gr\"obner basis of the polynomial ideal $I(V)\subset \mathbb F_p[x_1,\ldots, x_n]$. We discuss existing results and introduce a new necessary condition on the points in $V$ for uniqueness of the reduced Gr\"obner basis of $I(V)$. These results also point to the importance of the relative proximity of the experimental input points on the number of minimal wiring diagrams, which we then study computationally. We find that there is a concrete heuristic way to generate data that tends to result in fewer minimal wiring diagrams.Open AccessAlgebraic Experimental Design: Theory and Computation
Over the past several decades, algebraic geometry has provided innovative approaches to biological experimental design that resolved theoretical questions and improved computational efficiency. However, guaranteeing uniqueness and perfect recovery of models are still open problems. In this work we study the problem of uniqueness of wiring diagrams. We use as a modeling framework polynomial dynamical systems and utilize the correspondence between simplicial complexes and square-free monomial ideals from Stanley-Reisner theory to develop theory and construct an algorithm for identifying input data sets $V\subset \mathbb F_p^n$ that are guaranteed to correspond to a unique minimal wiring diagram regardless of the experimental output. We apply the results on a tumor-suppression network mediated by epidermal derived growth factor receptor and demonstrate how careful experimental design decisions can lead to a unique minimal wiring diagram identification. One of the insights of the theoretical work is the connection between the uniqueness of a wiring diagram for a given $V\subset \mathbb F_p^n$ and the uniqueness of the reduced Gr\"obner basis of the polynomial ideal $I(V)\subset \mathbb F_p[x_1,\ldots, x_n]$. We discuss existing results and introduce a new necessary condition on the points in $V$ for uniqueness of the reduced Gr\"obner basis of $I(V)$. These results also point to the importance of the relative proximity of the experimental input points on the number of minimal wiring diagrams, which we then study computationally. We find that there is a concrete heuristic way to generate data that tends to result in fewer minimal wiring diagrams. - Open Access
- 21 October 2019
- Published by Springer Nature in BMC Bioinformatics
- Vol. 20 (1) , 1-11
PlantSimLab - a modeling and simulation web tool for plant biologists
Background: At the molecular level, nonlinear networks of heterogeneous molecules control many biological processes, so that systems biology provides a valuable approach in this field, building on the integration of experimental biology with mathematical modeling. One of the biggest challenges to making this integration a reality is that many life scientists do not possess the mathematical expertise needed to build and manipulate mathematical models well enough to use them as tools for hypothesis generation. Available modeling software packages often assume some modeling expertise. There is a need for software tools that are easy to use and intuitive for experimentalists.Results: This paper introduces PlantSimLab, a web-based application developed to allow plant biologists to construct dynamic mathematical models of molecular networks, interrogate them in a manner similar to what is done in the laboratory, and use them as a tool for biological hypothesis generation. It is designed to be used by experimentalists, without direct assistance from mathematical modelers.Conclusions: Mathematical modeling techniques are a useful tool for analyzing complex biological systems, and there is a need for accessible, efficient analysis tools within the biological community. PlantSimLab enables users to build, validate, and use intuitive qualitative dynamic computer models, with a graphical user interface that does not require mathematical modeling expertise. It makes analysis of complex models accessible to a larger community, as it is platform-independent and does not require extensive mathematical expertise.
- 21 October 2019
- Published by Springer Nature in BMC Bioinformatics
- Vol. 20 (1) , 1-11
Open AccessPlantSimLab - a modeling and simulation web tool for plant biologists
Background: At the molecular level, nonlinear networks of heterogeneous molecules control many biological processes, so that systems biology provides a valuable approach in this field, building on the integration of experimental biology with mathematical modeling. One of the biggest challenges to making this integration a reality is that many life scientists do not possess the mathematical expertise needed to build and manipulate mathematical models well enough to use them as tools for hypothesis generation. Available modeling software packages often assume some modeling expertise. There is a need for software tools that are easy to use and intuitive for experimentalists.Results: This paper introduces PlantSimLab, a web-based application developed to allow plant biologists to construct dynamic mathematical models of molecular networks, interrogate them in a manner similar to what is done in the laboratory, and use them as a tool for biological hypothesis generation. It is designed to be used by experimentalists, without direct assistance from mathematical modelers.Conclusions: Mathematical modeling techniques are a useful tool for analyzing complex biological systems, and there is a need for accessible, efficient analysis tools within the biological community. PlantSimLab enables users to build, validate, and use intuitive qualitative dynamic computer models, with a graphical user interface that does not require mathematical modeling expertise. It makes analysis of complex models accessible to a larger community, as it is platform-independent and does not require extensive mathematical expertise.
- 10 May 2019
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 19 (05)
Small Gröbner fans of ideals of points
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Gröbner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this property. Moreover, we provide methodologies for constructing such ideals. We then relax the condition of uniqueness. The second and most relevant topic discussed here is to consider and identify pairs of ideals with the same number of reduced Gröbner bases, that is, with the same cardinality of their associated Gröbner fan.
- 10 May 2019
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 19 (05)
Small Gröbner fans of ideals of points
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Gröbner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this property. Moreover, we provide methodologies for constructing such ideals. We then relax the condition of uniqueness. The second and most relevant topic discussed here is to consider and identify pairs of ideals with the same number of reduced Gröbner bases, that is, with the same cardinality of their associated Gröbner fan.
- Open Access
Small Groebner Fans of Ideals of Points
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this property. Moreover, we provide methodologies for constructing such ideals. We then relax the condition of uniqueness. The second and most relevant topic discussed here is to consider and identify pairs of ideals with the same number of reduced Groebner bases, that is, with the same cardinality of their associated Groebner fan.
Open AccessSmall Groebner Fans of Ideals of Points
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this property. Moreover, we provide methodologies for constructing such ideals. We then relax the condition of uniqueness. The second and most relevant topic discussed here is to consider and identify pairs of ideals with the same number of reduced Groebner bases, that is, with the same cardinality of their associated Groebner fan.
- Open Access
The Innate Immune Response to Ischemic Injury: a Multiscale Modeling Perspective
Background: Cell death as a result of ischemic injury triggers powerful mechanisms regulated by germline-encoded Pattern Recognition Receptors (PRRs) with shared specificity that recognize invading pathogens and endogenous ligands released from dying cells, and as such are essential to human health. Alternatively, dysregulation of these mechanisms contributes to extreme inflammation, deleterious tissue damage and impaired healing in various diseases. The Toll-like receptors (TLRs) are a prototypical family of PRRs that may be powerful anti-inflammatory targets if agents can be designed that antagonize their harmful effects while preserving host defense functions. This requires an understanding of the complex interactions and consequences of targeting the TLR-mediated pathways as well as technologies to analyze and interpret these, which will then allow the simulation of perturbations targeting specific pathway components, predict potential outcomes and identify safe and effective therapeutic targets. Results: We constructed a multiscale mathematical model that spans the tissue and intracellular scales, and captures the consequences of targeting various regulatory components of injury-induced TLR4 signal transduction on potential pro-inflammatory or pro-healing outcomes. We applied known interactions to simulate how inactivation of specific regulatory nodes affects dynamics in the context of injury and to predict phenotypes of potential therapeutic interventions. We propose rules to link model behavior to qualitative estimates of pro-inflammatory signal activation, macrophage infiltration, production of reactive oxygen species and resolution. We tested the validity of the model by assessing its ability to reproduce published data not used in its construction. Conclusions: These studies will enable us to form a conceptual framework focusing on TLR4-mediated ischemic repair to assess potential molecular targets that can be utilized therapeutically to improve efficacy and safety in treating ischemic/inflammatory injury.
Open AccessThe Innate Immune Response to Ischemic Injury: a Multiscale Modeling Perspective
Background: Cell death as a result of ischemic injury triggers powerful mechanisms regulated by germline-encoded Pattern Recognition Receptors (PRRs) with shared specificity that recognize invading pathogens and endogenous ligands released from dying cells, and as such are essential to human health. Alternatively, dysregulation of these mechanisms contributes to extreme inflammation, deleterious tissue damage and impaired healing in various diseases. The Toll-like receptors (TLRs) are a prototypical family of PRRs that may be powerful anti-inflammatory targets if agents can be designed that antagonize their harmful effects while preserving host defense functions. This requires an understanding of the complex interactions and consequences of targeting the TLR-mediated pathways as well as technologies to analyze and interpret these, which will then allow the simulation of perturbations targeting specific pathway components, predict potential outcomes and identify safe and effective therapeutic targets. Results: We constructed a multiscale mathematical model that spans the tissue and intracellular scales, and captures the consequences of targeting various regulatory components of injury-induced TLR4 signal transduction on potential pro-inflammatory or pro-healing outcomes. We applied known interactions to simulate how inactivation of specific regulatory nodes affects dynamics in the context of injury and to predict phenotypes of potential therapeutic interventions. We propose rules to link model behavior to qualitative estimates of pro-inflammatory signal activation, macrophage infiltration, production of reactive oxygen species and resolution. We tested the validity of the model by assessing its ability to reproduce published data not used in its construction. Conclusions: These studies will enable us to form a conceptual framework focusing on TLR4-mediated ischemic repair to assess potential molecular targets that can be utilized therapeutically to improve efficacy and safety in treating ischemic/inflammatory injury.
- Open Access
Determining Parameters Leading to Chaotic Dynamics in Systems
Many biological ecosystems exhibit chaotic behavior, demonstrated either analytically using parameter choices in an associated dynamical systems model or empirically through analysis of experimental data. In this paper, we provide a computational framework which can be used to both explore the parameter space for the existence of positive Lyapunov exponents and visualize the connections between parameters leading to these positive values. We demonstrate the effectiveness of the framework on several dynamical systems used to model bacterial populations with a nutrient source. We provide sample graphics to show the possible ways this framework can be used to gather insight of an underlying system without requiring detailed mathematical analysis.
Open AccessDetermining Parameters Leading to Chaotic Dynamics in Systems
Many biological ecosystems exhibit chaotic behavior, demonstrated either analytically using parameter choices in an associated dynamical systems model or empirically through analysis of experimental data. In this paper, we provide a computational framework which can be used to both explore the parameter space for the existence of positive Lyapunov exponents and visualize the connections between parameters leading to these positive values. We demonstrate the effectiveness of the framework on several dynamical systems used to model bacterial populations with a nutrient source. We provide sample graphics to show the possible ways this framework can be used to gather insight of an underlying system without requiring detailed mathematical analysis.
- 23 June 2015
- Published by American Physical Society (APS) in Physical Review E
- Vol. 91 (6) , 062812
Difference equation for tracking perturbations in systems of Boolean nested canalyzing functions
This paper studies the spread of perturbations through networks composed of Boolean functions with special canalyzing properties. Canalyzing functions have the property that at least for one value of one of the inputs the output is fixed, irrespective of the values of the other inputs. In this paper the focus is on partially nested canalyzing functions, in which multiple, but not all inputs have this property in a cascading fashion. They naturally describe many relationships in real networks. For example, in a gene regulatory network, the statement “if gene is expressed, then gene is not expressed regardless of the states of other genes” implies that is canalyzing. On the other hand, the additional statement “if gene is not expressed, and gene is expressed, then gene is automatically expressed; otherwise gene 's state is determined by some other type of rule” implies that gene is expressed by a partially nested canalyzing function with more than two variables, but with two canalyzing variables. In this paper a difference equation model of the probability that a network node's value is affected by an initial perturbation over time is developed, analyzed, and validated numerically. It is shown that the effect of a perturbation decreases towards zero over time if the Boolean functions are canalyzing in sufficiently many variables. The maximum dynamical impact of a perturbation is shown to be comparable to the average impact for a wide range of values of the average sensitivity of the network. Percolation limits are also explored; these are parameter values which generate a transition of the expected perturbation effect to zero as other parameters are varied, so that the initial perturbation does not scale up with the parameters once the percolation limits are reached.- 23 June 2015
- Published by American Physical Society (APS) in Physical Review E
- Vol. 91 (6) , 062812
Difference equation for tracking perturbations in systems of Boolean nested canalyzing functions
This paper studies the spread of perturbations through networks composed of Boolean functions with special canalyzing properties. Canalyzing functions have the property that at least for one value of one of the inputs the output is fixed, irrespective of the values of the other inputs. In this paper the focus is on partially nested canalyzing functions, in which multiple, but not all inputs have this property in a cascading fashion. They naturally describe many relationships in real networks. For example, in a gene regulatory network, the statement “if gene is expressed, then gene is not expressed regardless of the states of other genes” implies that is canalyzing. On the other hand, the additional statement “if gene is not expressed, and gene is expressed, then gene is automatically expressed; otherwise gene 's state is determined by some other type of rule” implies that gene is expressed by a partially nested canalyzing function with more than two variables, but with two canalyzing variables. In this paper a difference equation model of the probability that a network node's value is affected by an initial perturbation over time is developed, analyzed, and validated numerically. It is shown that the effect of a perturbation decreases towards zero over time if the Boolean functions are canalyzing in sufficiently many variables. The maximum dynamical impact of a perturbation is shown to be comparable to the average impact for a wide range of values of the average sensitivity of the network. Percolation limits are also explored; these are parameter values which generate a transition of the expected perturbation effect to zero as other parameters are varied, so that the initial perturbation does not scale up with the parameters once the percolation limits are reached.- Open Access
- 6 June 2011
- Published by Springer Nature in EURASIP Journal on Bioinformatics and Systems Biology
- Vol. 2011 (1) , 1
Probabilistic polynomial dynamical systems for reverse engineering of gene regulatory networks
Elucidating the structure and/or dynamics of gene regulatory networks from experimental data is a major goal of systems biology. Stochastic models have the potential to absorb noise, account for un-certainty, and help avoid data overfitting. Within the frame work of probabilistic polynomial dynamical systems, we present an algorithm for the reverse engineering of any gene regulatory network as a discrete, probabilistic polynomial dynamical system. The resulting stochastic model is assembled from all minimal models in the model space and the probability assignment is based on partitioning the model space according to the likeliness with which a minimal model explains the observed data. We used this method to identify stochastic models for two published synthetic network models. In both cases, the generated model retains the key features of the original model and compares favorably to the resulting models from other algorithms.
- 6 June 2011
- Published by Springer Nature in EURASIP Journal on Bioinformatics and Systems Biology
- Vol. 2011 (1) , 1
Open AccessProbabilistic polynomial dynamical systems for reverse engineering of gene regulatory networks
Elucidating the structure and/or dynamics of gene regulatory networks from experimental data is a major goal of systems biology. Stochastic models have the potential to absorb noise, account for un-certainty, and help avoid data overfitting. Within the frame work of probabilistic polynomial dynamical systems, we present an algorithm for the reverse engineering of any gene regulatory network as a discrete, probabilistic polynomial dynamical system. The resulting stochastic model is assembled from all minimal models in the model space and the probability assignment is based on partitioning the model space according to the likeliness with which a minimal model explains the observed data. We used this method to identify stochastic models for two published synthetic network models. In both cases, the generated model retains the key features of the original model and compares favorably to the resulting models from other algorithms.
- 1 June 2010
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 17 (6) , 853-868
Discretization of Time Series Data
An increasing number of algorithms for biochemical network inference from experimental data require discrete data as input. For example, dynamic Bayesian network methods and methods that use the framework of finite dynamical systems, such as Boolean networks, all take discrete input. Experimental data, however, are typically continuous and represented by computer floating point numbers. The translation from continuous to discrete data is crucial in preserving the variable dependencies and thus has a significant impact on the performance of the network inference algorithms. We compare the performance of two such algorithms that use discrete data using several different discretization algorithms. One of the inference methods uses a dynamic Bayesian network framework, the other—a time‐and state‐discrete dynamical system framework. The discretization algorithms are quantile, interval discretization, and a new algorithm introduced in this article, SSD. SSD is especially designed for short time series data and is capable of determining the optimal number of discretization states. The experiments show that both inference methods perform better with SSD than with the other methods. In addition, SSD is demonstrated to preserve the dynamic features of the time series, as well as to be robust to noise in the experimental data. A C++ implementation of SSD is available from the authors at http://polymath.vbi.vt.edu/discretization .
- 1 June 2010
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 17 (6) , 853-868
Discretization of Time Series Data
An increasing number of algorithms for biochemical network inference from experimental data require discrete data as input. For example, dynamic Bayesian network methods and methods that use the framework of finite dynamical systems, such as Boolean networks, all take discrete input. Experimental data, however, are typically continuous and represented by computer floating point numbers. The translation from continuous to discrete data is crucial in preserving the variable dependencies and thus has a significant impact on the performance of the network inference algorithms. We compare the performance of two such algorithms that use discrete data using several different discretization algorithms. One of the inference methods uses a dynamic Bayesian network framework, the other—a time‐and state‐discrete dynamical system framework. The discretization algorithms are quantile, interval discretization, and a new algorithm introduced in this article, SSD. SSD is especially designed for short time series data and is capable of determining the optimal number of discretization states. The experiments show that both inference methods perform better with SSD than with the other methods. In addition, SSD is demonstrated to preserve the dynamic features of the time series, as well as to be robust to noise in the experimental data. A C++ implementation of SSD is available from the authors at http://polymath.vbi.vt.edu/discretization .
- 13 April 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 3 (4) , 457-463
Estimating the Volumes of the Cones in a Gröbner Fan
- 13 April 2010
- Published by Springer Nature in Mathematics in Computer Science
- Vol. 3 (4) , 457-463
Estimating the Volumes of the Cones in a Gröbner Fan