Samuel Pastva

Mr. Samuel Pastva

Masaryk University, Brno, Czech Republic
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 September 2022 in Bioinformatics
Verified
Journal Article
Closed access
PDF file
NBNikola Beneš
Nikola Beneš
LBLuboš Brim
Luboš Brim
OHOndřej Huvar
Ondřej Huvar
SPSamuel Pastva
Samuel Pastva
DŠDavid Šafránek
David Šafránek
EŠEva Šmijáková
Eva Šmijáková
AEON.py is a Python library for the analysis of the long-term behaviour in very large asynchronous Boolean networks. It provides significant computational improvements over the state-of-the-art methods for attractor detection. Furthermore, it admits the analysis of partially specified Boolean networks with uncertain update functions. It also includes techniques for identifying viable source-target control strategies and the assessment of their robustness with respect to parameter perturbations. All relevant results are available in Supplementary Materials . The tool is accessible through https://github.com/sybila/biodivine-aeon-py. Supplementary data are available at Bioinformatics online.

14 July 2020
Verified
Book Chapter
Open access
PDF file
NBNikola Beneš
Nikola Beneš
LBLuboš Brim
Luboš Brim
JKJakub Kadlecaj
Jakub Kadlecaj
SPSamuel Pastva
Samuel Pastva
DŠDavid Šafránek
David Šafránek
Boolean networks (BNs) provide an effective modelling tool for various phenomena from science and engineering. Any long-term behaviour of a BN eventually converges to a so-called attractor. Depending on various logical parameters, the structure and quality of attractors can undergo a significant change, known as a bifurcation. We present a tool for analysing bifurcations in asynchronous parametrised Boolean networks. To fight the state-space and parameter-space explosion problem the tool uses a parallel semi-symbolic algorithm.

12 June 2023 in bioRxiv
Verified
Preprint
Open access
PDF file
SPSamuel Pastva
Samuel Pastva
DŠDavid Šafránek
David Šafránek
NBNikola Beneš
Nikola Beneš
LBLuboš Brim
Luboš Brim
THThomas Henzinger
Thomas Henzinger
Recent developments in both computational analysis and data-driven synthesis enable a new era of automated reasoning with logical models (Boolean networks in particular) in systems biology. However, these advancements also motivate an increased focus on quality control and performance comparisons between tools. At the moment, to illustrate real-world applicability, authors typically test their approaches on small sets of manually curated models that are inherently limited in scope. This further complicates reuse and comparisons, because benchmark models often contain ad hoc modifications or are outright not available. In this paper, we describe a new, comprehensive, open source dataset of 210+ Boolean network models compiled from available databases and a literature survey. The models are available in a wide range of formats. Furthermore, the dataset is accompanied by a validation pipeline that ensures the integrity and logical consistency of each model. Using this pipeline, we identified and repaired 400+ potential problems in a number of widely used models.

2 September 2015
Verified
Book Chapter
Closed access
PDF file
LBLuboš Brim
Luboš Brim
MČMilan Češka
Milan Češka
MDMartin Demko
Martin Demko
SPSamuel Pastva
Samuel Pastva
DŠDavid Šafránek
David Šafránek

5 May 2017
Verified
Book Chapter
Closed access
PDF file
ADAndreas E. Dalsgaard
Andreas E. Dalsgaard
SESøren Enevoldsen
Søren Enevoldsen
PFPeter Fogh
Peter Fogh
LJLasse S. Jensen
Lasse S. Jensen
TJTobias S. Jepsen
Tobias S. Jepsen
JSJiří Srba
Jiří Srba

6 May 2025 in Bioinformatics
Verified
Journal Article
Open access
VTVan-Giang Trinh
Van-Giang Trinh
KPKyu Hyong Park
Kyu Hyong Park
SPSamuel Pastva
Samuel Pastva
JRJordan Christopher Rozum
Jordan Christopher Rozum
Motivation: Boolean networks are popular dynamical models of cellular processes in systems biology. Their attractors model phenotypes that arise from the interplay of key regulatory subcircuits. A succession diagram (SD) describes this interplay in a discrete analog of Waddington’s epigenetic attractor landscape that allows for fast identification of attractors and attractor control strategies. Efficient computational tools for studying SDs are essential for the understanding of Boolean attractor landscapes and connecting them to their biological functions. Results: We present a new approach to SD construction for asynchronously updated Boolean networks, implemented in the biologist’s Boolean attractor landscape mapper, biobalm. We compare biobalm to similar tools and find a substantial performance increase in SD construction, attractor identification, and attractor control. We perform the most comprehensive comparative analysis to date of the SD structure in experimentally-validated Boolean models of cell processes and random ensembles. We find that random models (including critical Kauffman networks) have relatively small SDs, indicating simple decision structures. In contrast, nonrandom models from the literature are enriched in extremely large SDs, indicating an abundance of decision points and suggesting the presence of complex Waddington landscapes in nature. Availability and implementation: The tool biobalm is available online at https://github.com/jcrozum/biobalm. Further data, scripts for testing, analysis, and figure generation are available online at https://github.com/jcrozum/biobalm-analysis and in the reproducibility artefact at https://doi.org/10.5281/zenodo.13854760.