Search bioRxivSearch

Biology subjects

Vera-Licona, P.

Publications and source records attributed to Vera-Licona, P..

2 recordsLinked to original sources

Benchmarking Time-Series Data Discretization on Inference Methods

The rapid development in quantitatively measuring DNA, RNA, and protein has generated a great interest in the development of reverse-engineering methods, that is, data-driven approaches to infer the network structure or dynamical model of the system. Many reverse-engineering methods require discrete quantitative data as input, while many experimental data are continuous. Some studies have started to reveal the impact that the choice of data discretization has on the performance of reverse-engineering methods. However, more comprehensive studies are still greatly needed to systematically and quantitatively understand the impact that discretization methods have on inference methods. Furthermore, there is an urgent need for systematic comparative methods that can help select between discretization methods. In this work, we consider 4 published intracellular networks inferred with their respective time-series datasets. We discretized the data using different discretization methods. Across all datasets, changing the data discretization to a more appropriate one improved the reverse-engineering methods performance. We observed no universal best discretization method across different time-series datasets. Thus, we propose DiscreeTest, a two-step evaluation metric for ranking discretization methods for time-series data. The underlying assumption of DiscreeTest is that an optimal discretization method should preserve the dynamic patterns observed in the original data across all variables. We used the same datasets and networks to show that DiscreeTest is able to identify an appropriate discretization among several candidate methods. To our knowledge, this is the first time that a method for benchmarking and selecting an appropriate discretization method for time-series data has been proposed.\n\nAvailabilityAll the datasets, reverse-engineering methods and source code used in this paper are available in Vera-Liconas lab Github repository: https://github.com/VeraLiconaResearchGroup/Benchmarking_TSDiscretizations

systems biology

COMPUTING SIGNAL TRANSDUCTION IN SIGNALING NETWORKS MODELED AS BOOLEAN NETWORKS, PETRI NETS AND HYPERGRAPHS

Mathematical frameworks circumventing the need of mechanistic detail to build models of signal transduction networks include graphs, hypergraphs, Boolean Networks, and Petri Nets. Predicting how a signal transduces in a signaling network is essential to understand cellular functions and disease. Different formalisms exist to describe how a signal transduces in a given intracellular signaling network represented in the aforementioned modeling frameworks: elementary signaling modes, T-invariants, extreme pathway analysis, elementary flux modes, and simple paths. How do these formalisms compare?\n\nWe present an overview of how signal transduction networks have been modelled using graphs, hypergraphs, Boolean Networks, and Petri Nets in the literature. We provide a review of the different formalisms for capturing signal transduction in a given model of an intracellular signaling network. We also discuss the existing translations between the different modeling frameworks, and the relationships between their corresponding signal transduction representations that have been described in the literature. Furthermore, as a new formalism of signal transduction, we show how minimal functional routes proposed for signaling networks modeled as Boolean Networks can be captured by computing topological factories, a methodology found in the metabolic networks literature. We further show that in the case of signaling networks represented with an acyclic B-hypergraph structure, the definitions are equivalent. In signaling networks represented as directed graphs, it has been shown that computations of elementary modes via its incidence matrix correspond to computations of simple paths and feedback loops. We show that computing elementary modes based on the incidence matrix of a B-hypergraph fails to capture minimal functional routes.

systems biology