MOTIVATION: Systems biology aims to better understand living systems through mathematical modelling of experimental and clinical data. A pervasive challenge in quantitative dynamical modelling is the integration of time series measurements, which often have high variability and low sampling resolution. Approaches are required to utilize such information while consistently handling uncertainties. RESULTS: We present BayModTS (Bayesian modelling of time series data), a new FAIR (findable, accessible, interoperable, and reusable) workflow for processing and analysing sparse and highly variable time series data. BayModTS consistently transfers uncertainties from data to model predictions, including process knowledge via parameterized models. Further, credible differences in the dynamics of different conditions can be identified by filtering noise. To demonstrate the power and versatility of BayModTS, we applied it to three hepatic datasets gathered from three different species and with different measurement techniques: (i) blood perfusion measurements by magnetic resonance imaging in rat livers after portal vein ligation, (ii) pharmacokinetic time series of different drugs in normal and steatotic mice, and (iii) CT-based volumetric assessment of human liver remnants after clinical liver resection. AVAILABILITY AND IMPLEMENTATION: The BayModTS codebase is available on GitHub at https://github.com/Systems-Theory-in-Systems-Biology/BayModTS. The repository contains a Python script for the executable BayModTS workflow and a widely applicable SBML (systems biology markup language) model for retarded transient functions. In addition, all examples from the paper are included in the repository. Data and code of the application examples are stored on DaRUS: https://doi.org/10.18419/darus-3876. The raw MRI ROI voxel data were uploaded to DaRUS: https://doi.org/10.18419/darus-3878. The steatosis metabolite data are published on FairdomHub: 10.15490/fairdomhub.1.study.1070.1.

With the rapid development of semantic Web and big data technology, ontology data has the characteristics of large scale, high speed growth and diversity which big data has. On one hand, the conventional ontology reasoners do not scale well for large amounts of ontologies because they are designed for run on a single machine. On the other hand, the existing scalable reasoners are not perfect enough, for example, to completely support the widely used Semantic Web Rule Language (SWRL) rules. This paper presents a method for SWRL scalable parallel reasoning using the Spark SQL programming model. Our method supports SWRL rules more completely, and because of the use of Spark SQL, our algorithm is simpler and can rely on Spark SQL's built-in optimizations to provide optimized execution efficiency. We also considered some optimizations to speed up the rule reasoning process.