Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jorge G. T. Zañudo

dblp:162/4209 · also Jorge Gómez Tejeda Zañudo · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0002-1092-0068ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 50% Computational science and engineering · 50%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › dynamical systems
attractor control
0.612022
pystablemotifs: Python library for attractor identification and control in Boolean networks · Bioinform. 2022
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network analysis
boolean network analysis
0.612022
pystablemotifs: Python library for attractor identification and control in Boolean networks · Bioinform. 2022

Methods — techniques the papers use, named apart from their topics

exhaustive attractor identification algorithm · 0.6
YearPublicationVenuePosition
2022 pystablemotifs: Python library for attractor identification and control in Boolean networks
abstract
SUMMARY: pystablemotifs is a Python 3 library for analyzing Boolean networks. Its non-heuristic and exhaustive attractor identification algorithm was previously presented in Rozum et al. (2021). Here, we illustrate its performance improvements over similar methods and discuss how it uses outputs of the attractor identification process to drive a system to one of its attractors from any initial state. We implement six attractor control algorithms, five of which are new in this work. By design, these algorithms can return different control strategies, allowing for synergistic use. We also give a brief overview of the other tools implemented in pystablemotifs. AVAILABILITY AND IMPLEMENTATION: The source code is on GitHub at https://github.com/jcrozum/pystablemotifs/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Jordan C. Rozum, David Deritei, Kyu Hyong Park, Jorge G. T. Zañudo, Réka Albert
Bioinform.4
2021 Mathematical modeling of the Candida albicans yeast to hyphal transition reveals novel control strategies
abstract
Candida albicans, an opportunistic fungal pathogen, is a significant cause of human infections, particularly in immunocompromised individuals. Phenotypic plasticity between two morphological phenotypes, yeast and hyphae, is a key mechanism by which C. albicans can thrive in many microenvironments and cause disease in the host. Understanding the decision points and key driver genes controlling this important transition and how these genes respond to different environmental signals is critical to understanding how C. albicans causes infections in the host. Here we build and analyze a Boolean dynamical model of the C. albicans yeast to hyphal transition, integrating multiple environmental factors and regulatory mechanisms. We validate the model by a systematic comparison to prior experiments, which led to agreement in 17 out of 22 cases. The discrepancies motivate alternative hypotheses that are testable by follow-up experiments. Analysis of this model revealed two time-constrained windows of opportunity that must be met for the complete transition from the yeast to hyphal phenotype, as well as control strategies that can robustly prevent this transition. We experimentally validate two of these control predictions in C. albicans strains lacking the transcription factor UME6 and the histone deacetylase HDA1, respectively. This model will serve as a strong base from which to develop a systems biology understanding of C. albicans morphogenesis.
David J. Wooten, Jorge G. T. Zañudo, David Murrugarra, Austin M. Perry, Anna Dongari-Bagtzoglou, Reinhard C. Laubenbacher, Clarissa J. Nobile, Réka Albert
PLoS Comput. Biol.2
2015 Cell Fate Reprogramming by Control of Intracellular Network Dynamics
abstract
Identifying control strategies for biological networks is paramount for practical applications that involve reprogramming a cell's fate, such as disease therapeutics and stem cell reprogramming. Here we develop a novel network control framework that integrates the structural and functional information available for intracellular networks to predict control targets. Formulated in a logical dynamic scheme, our approach drives any initial state to the target state with 100% effectiveness and needs to be applied only transiently for the network to reach and stay in the desired state. We illustrate our method's potential to find intervention targets for cancer treatment and cell differentiation by applying it to a leukemia signaling network and to the network controlling the differentiation of helper T cells. We find that the predicted control targets are effective in a broad dynamic framework. Moreover, several of the predicted interventions are supported by experiments.
Jorge G. T. Zañudo, Réka Albert
PLoS Comput. Biol.1