Tomás Gedeon

dblp:83/5336 · DBLP profile ↗
← Back
15ranked-venue papers
3as first author
3since 2021 · last 2022
0000-0001-5555-6741ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 7 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 5 · 2 first-authorTheory of computation · 3 · 1 since 2021
YearPublicationVenuePosition
2022 Experimental guidance for discovering genetic networks through hypothesis reduction on time series
abstract
Large programs of dynamic gene expression, like cell cyles and circadian rhythms, are controlled by a relatively small "core" network of transcription factors and post-translational modifiers, working in concerted mutual regulation. Recent work suggests that system-independent, quantitative features of the dynamics of gene expression can be used to identify core regulators. We introduce an approach of iterative network hypothesis reduction from time-series data in which increasingly complex features of the dynamic expression of individual, pairs, and entire collections of genes are used to infer functional network models that can produce the observed transcriptional program. The culmination of our work is a computational pipeline, Iterative Network Hypothesis Reduction from Temporal Dynamics (Inherent dynamics pipeline), that provides a priority listing of targets for genetic perturbation to experimentally infer network structure. We demonstrate the capability of this integrated computational pipeline on synthetic and yeast cell-cycle data.
Breschine Cummins, Francis C. Motta, Robert C. Moseley, Anastasia Deckard, Sophia Campione, Marcio Gameiro, Tomás Gedeon, Konstantin Mischaikow, Steven B. Haase
PLoS Comput. Biol.7
2022 Joint realizability of monotone Boolean functions
Peter Crawford-Kahrl, Breschine Cummins, Tomás Gedeon
Theor. Comput. Sci.3
2021 Rational design of complex phenotype via network models
abstract
We demonstrate a modeling and computational framework that allows for rapid screening of thousands of potential network designs for particular dynamic behavior. To illustrate this capability we consider the problem of hysteresis, a prerequisite for construction of robust bistable switches and hence a cornerstone for construction of more complex synthetic circuits. We evaluate and rank most three node networks according to their ability to robustly exhibit hysteresis where robustness is measured with respect to parameters over multiple dynamic phenotypes. Focusing on the highest ranked networks, we demonstrate how additional robustness and design constraints can be applied. We compare our results to more traditional methods based on specific parameterization of ordinary differential equation models and demonstrate a strong qualitative match at a small fraction of the computational cost.
Marcio Gameiro, Tomás Gedeon, Shane Kepley, Konstantin Mischaikow
PLoS Comput. Biol.2
2020 Multistability in the epithelial-mesenchymal transition network
abstract
BACKGROUND: The transitions between epithelial (E) and mesenchymal (M) cell phenotypes are essential in many biological processes like tissue development and cancer metastasis. Previous studies, both modeling and experimental, suggested that in addition to E and M states, the network responsible for these phenotypes exhibits intermediate phenotypes between E and M states. The number and importance of such states is subject to intense discussion in the epithelial-mesenchymal transition (EMT) community. RESULTS: Previous modeling efforts used traditional bifurcation analysis to explore the number of the steady states that correspond to E, M and intermediate states by varying one or two parameters at a time. Since the system has dozens of parameters that are largely unknown, it remains a challenging problem to fully describe the potential set of states and their relationship across all parameters. We use the computational tool DSGRN (Dynamic Signatures Generated by Regulatory Networks) to explore the intermediate states of an EMT model network by computing summaries of the dynamics across all of parameter space. We find that the only attractors in the system are equilibria, that E and M states dominate across parameter space, but that bistability and multistability are common. Even at extreme levels of some of the known inducers of the transition, there is a certain proportion of the parameter space at which an E or an M state co-exists with other stable steady states. CONCLUSIONS: Our results suggest that the multistability is broadly present in the EMT network across parameters and thus response of cells to signals may strongly depend on the particular cell line and genetic background.
Breschine Cummins, Tomás Gedeon
BMC Bioinform.3
2018 Identifying robust hysteresis in networks
abstract
We present a new modeling and computational tool that computes rigorous summaries of network dynamics over large sets of parameter values. These summaries, organized in a database, can be searched for observed dynamics, e.g., bistability and hysteresis, to discover parameter regimes over which they are supported. We illustrate our approach on several networks underlying the restriction point of the cell cycle in humans and yeast. We rank networks by how robustly they support hysteresis, which is the observed phenotype. We find that the best 6-node human network and the yeast network share similar topology and robustness of hysteresis, in spite of having no homology between the corresponding nodes of the network. Our approach provides a new tool linking network structure and dynamics.
Tomás Gedeon, Breschine Cummins, Shaun Harker, Konstantin Mischaikow
PLoS Comput. Biol.1
2016 A Mechanistic Model for Cooperative Behavior of Co-transcribing RNA Polymerases
abstract
In fast-transcribing prokaryotic genes, such as an rrn gene in Escherichia coli, many RNA polymerases (RNAPs) transcribe the DNA simultaneously. Active elongation of RNAPs is often interrupted by pauses, which has been observed to cause RNAP traffic jams; yet some studies indicate that elongation seems to be faster in the presence of multiple RNAPs than elongation by a single RNAP. We propose that an interaction between RNAPs via the torque produced by RNAP motion on helically twisted DNA can explain this apparent paradox. We have incorporated the torque mechanism into a stochastic model and simulated transcription both with and without torque. Simulation results illustrate that the torque causes shorter pause durations and fewer collisions between polymerases. Our results suggest that the torsional interaction of RNAPs is an important mechanism in maintaining fast transcription times, and that transcription should be viewed as a cooperative group effort by multiple polymerases.
Tamra Heberling, Lisa Davis, Jakub Gedeon, Charles G. Morgan, Tomás Gedeon
PLoS Comput. Biol.5
2011 Temporal Encoding in a Nervous System
abstract
We examined the extent to which temporal encoding may be implemented by single neurons in the cercal sensory system of the house cricket Acheta domesticus. We found that these neurons exhibit a greater-than-expected coding capacity, due in part to an increased precision in brief patterns of action potentials. We developed linear and non-linear models for decoding the activity of these neurons. We found that the stimuli associated with short-interval patterns of spikes (ISIs of 8 ms or less) could be predicted better by second-order models as compared to linear models. Finally, we characterized the difference between these linear and second-order models in a low-dimensional subspace, and showed that modification of the linear models along only a few dimensions improved their predictive power to parity with the second order models. Together these results show that single neurons are capable of using temporal patterns of spikes as fundamental symbols in their neural code, and that they communicate specific stimulus distributions to subsequent neural structures.
Zane N. Aldworth, Alexander G. Dimitrov, Graham I. Cummins, Tomás Gedeon, John P. Miller 0001
PLoS Comput. Biol.4
2010 Somitogenesis Clock-Wave Initiation Requires Differential Decay and Multiple Binding Sites for Clock Protein
abstract
Somitogenesis is a process common to all vertebrate embryos in which repeated blocks of cells arise from the presomitic mesoderm (PSM) to lay a foundational pattern for trunk and tail development. Somites form in the wake of passing waves of periodic gene expression that originate in the tailbud and sweep posteriorly across the PSM. Previous work has suggested that the waves result from a spatiotemporally graded control protein that affects the oscillation rate of clock-gene expression. With a minimally constructed mathematical model, we study the contribution of two control mechanisms to the initial formation of this gene-expression wave. We test four biologically motivated model scenarios with either one or two clock protein transcription binding sites, and with or without differential decay rates for clock protein monomers and dimers. We examine the sensitivity of wave formation with respect to multiple model parameters and robustness to heterogeneity in cell population. We find that only a model with both multiple binding sites and differential decay rates is able to reproduce experimentally observed waveforms. Our results show that the experimentally observed characteristics of somitogenesis wave initiation constrain the underlying genetic control mechanisms.
Mark Campanelli, Tomás Gedeon
PLoS Comput. Biol.2
2010 Hyperbolicity of the fixed point set for the simple genetic algorithm
Christina Hayes, Tomás Gedeon
Theor. Comput. Sci.2
2010 Symmetry breaking in soft clustering decoding of neural codes
abstract
Information-based distortion methods have been used successfully in the analysis of neural coding problems. These approaches allow the discovery of neural symbols and the corresponding stimulus space of a neuron or neural ensemble quantitatively, while making few assumptions about the nature of either the code or of relevant stimulus features. The neural codebook is derived by quantizing sensory stimuli and neural responses into a small set of clusters, and optimizing the quantization to minimize an information distortion function. The method of annealing has been used to solve the corresponding high-dimensional nonlinear optimization problem. The annealing solutions undergo a series of bifurcations, which we study using bifurcation theory in the presence of symmetries. In this contribution we describe these symmetry breaking bifurcations in detail, and indicate some of the consequences of the form of the bifurcations. In particular, we show that the annealing solutions break symmetry at pitchfork bifurcations, and that subcritical branches can exist. Thus, at a subcritical bifurcation, there are local information distortion solutions which are not found by the method of annealing. Since the annealing procedure is guaranteed to converge to a local solution eventually, the subcritical branch must turn and become optimal at some later saddle-node bifurcation, which we have shown occur generically for this class of problems. This implies that the rate distortion curve, while convex for noninformation-based distortion measures, is not convex for information-based distortion methods.
Albert E. Parker, Alexander G. Dimitrov, Tomás Gedeon
IEEE Trans. Inf. Theory3
2008 Annealing and the normalized N-cut
Tomás Gedeon, Albert E. Parker, Collette Campion, Zane N. Aldworth
Pattern Recognit.1
2004 Finding neural codes using random projections
Brendan Mumey, Aditi Sarkar, Tomás Gedeon, Alexander G. Dimitrov, John P. Miller 0001
Neurocomputing3
2002 Annealing and the Rate Distortion Problem
abstract
In this paper we introduce methodology to determine the bifurcation structure of optima for a class of similar cost functions from Rate Distortion Theory, Determin- istic Annealing, Information Distortion and the Information Bottleneck Method. We also introduce a numerical algorithm which uses the explicit form of the bifur- cating branches to find optima at a bifurcation point.
Albert E. Parker, Tomás Gedeon, Alexander G. Dimitrov
NIPS2
2001 Non-uniform quantization of neural spike sequences through an information distortion measure
Alexander G. Dimitrov, John P. Miller 0001, Zane N. Aldworth, Tomás Gedeon
Neurocomputing4
1999 Additive neural networks and periodic patterns
Tomás Gedeon
Neural Networks1