Search arXivSearch

arXiv · 1705.03460

A Probabilistic Framework for Quantifying Biological Complexity

Abstract

One thing that discriminates living things from inanimate matter is their ability to generate similarly complex or non-random architectures in a large abundance. From DNA sequences to folded protein structures, living cells, microbial communities and multicellular structures, the material configurations in biology can easily be distinguished from non-living material assemblies. This is also true of the products of complex organisms that can themselves construct complex tools, machines, and artefacts. Whilst these objects are not living, they cannot randomly form, as they are the product of a biological organism and hence are either technological or cultural biosignatures. The problem is that it is not obvious how it might be possible to generalise an approach that aims to evaluate complex objects as possible biosignatures. However, if it was possible such a self-contained approach could be useful to explore the cosmos for new life forms. This would require us to prove rigorously that a given artefact is too complex to have formed by chance. In this paper, we present a new type of complexity measure, Pathway Complexity, that allows us to not only threshold the abiotic-biotic divide, but to demonstrate a probabilistic approach based upon object abundance and complexity which can be used to unambiguously assign complex objects as biosignatures. We hope that this approach not only opens up the search for biosignatures beyond earth, but allow us to explore earth for new types of biology, as well as observing when a complex chemical system discovered in the laboratory could be considered alive.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stuart M. Marshall, Alastair R. G. Murray, Leroy Cronin. 2017-05-09. A Probabilistic Framework for Quantifying Biological Complexity. https://doi.org/10.1098/rsta.2016.0342

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Flash-Radiomics: A Scalable Hybrid CPU-CUDA Engine for Standardized Scalar Radiomics and Accelerated Spatial Mapping

Background and Objectives: Spatial mapping retains the spatial distribution of radiomic features, but computational cost and fragmented software limit its use. We developed Flash-Radiomics with scalar extraction and spatial mapping, a central processing unit (CPU) backend, a hybrid Compute Unified Device Architecture (CUDA) backend, consistent feature names, and Hierarchical Data Format version 5 (HDF5) storage. Methods: We evaluated Image Biomarker Standardisation Initiative (IBSI) compliance, CPU-CUDA concordance, and end-to-end processing time. Compliance testing included 825 chapter 1 (IBSI-1) tests covering 165 high-consensus features and 323 chapter 2 (IBSI-2) tests with numerical references. Concordance testing included 1,148 scalar pairs and 93 spatial-map pairs. End-to-end processing time was measured five times per input volume of interest (VOI) size. Comparisons included the Medical Image Radiomics Processor (MIRP) and PyRadiomics for 102 shared scalar features and PyRadiomics for 93 shared spatial maps. Results: Both backends passed all 1,148 IBSI tests, and all paired results were concordant. At the largest scalar input, CPU required 76.343 s and hybrid CUDA 81.915 s; CPU was 4.7 times faster than MIRP and 190.7 times faster than PyRadiomics. At the largest spatial input completed by both backends, hybrid CUDA reduced processing time by 68.6% relative to CPU (79.280 versus 252.791 s). At PyRadiomics' largest completed spatial input, hybrid CUDA was 84.9 times faster. Conclusions: Flash-Radiomics unified standardized scalar extraction, spatial mapping, concordant CPU-CUDA results, and HDF5 storage. CPU processing time was similar or shorter for scalar extraction, whereas hybrid CUDA was faster for spatial mapping under the tested conditions.

q-bio.OT

EPI-KAN: A Method For Estimating and Forecasting Time-Dependent COVID-19 Parameters

We introduce EPI-KAN, a novel method for estimating COVID-19 time-varying parameters. EPI-KAN uses historical epidemiological data, Physics-Informed Neural Network (PINN), and the novel Kolmogorov-Arnold Network (KAN). The method harnesses the novel Kolmogorov-Arnold Network (KAN), which is a type of artificial neural network. For the KAN in this paper, we learn activation functions that are represented using Fourier series, hence we abbreviate as KAN-F. In this study, we estimate parameters in the context of an SIRD compartmental differential equations. The time-dependent parameters are the transmission rate $β(t)$, recovery rate $γ(t)$, and mortality rate $μ(t)$. We define three KAN-F functions $\widehatβ$, $\widehatγ$, $\widehatμ$ that model the true parameters $β(t)$, $γ(t)$, $μ(t)$, respectively. We test two model architectures for the KAN-F: the first has 8 input variables consisting of $S$, $I$, $R$, $D$, and their numerical gradients at any time $t$, while the second has 4 input variables excluding the numerical gradients. The objective loss function that has to be minimized is subject to Physics-Informed Neural Network (PINN). Using historical data of COVID-19 from three South-East Asian countries: Indonesia, Singapore, and Malaysia, we are able to estimate $β(t)$, $γ(t)$, and $μ(t)$ on each country with decent accuracy and efficiency. The time period of choice coincides with the period where SARS-CoV-2 Delta variant (B.1.617.2) was dominant. In addition to estimating the rates during the training period, we also predict transmission rates over 30 days during forecast period. We found that the output of KAN-F over the forecast period can give good predictions if we scale the output by a factor of 17\% for Indonesia and 30\% for Singapore and Malaysia.

q-bio.OT

Making Models That Matter: How to Build Trustworthy and Useful Systems Biology Models

Computational models supporting mechanistic understanding of (complex) biological systems, systems behaviour prediction, and experimental design are becoming more and more embedded in research on complex biological systems. Reuse and refinement of models, rather than continuous reinvention, is becoming increasingly important as models' demands on computational infrastructure increase. However published models - despite the variety of efforts taken so far - are frequently difficult to reproduce or reuse, substantially limiting their scientific value. Here we address the requirements for model reusability in the light of the field-specific CURE framework (Credible, Understandable, Reproducible, Extensible) and the more general FAIR principles (Findable, Accessible, Interoperable, Reusable). Considering published guidance we identify broad agreement on requirements for findability, accessibility, and interoperability, but continued lack of clarity and consensus around reusability. Focusing on the scientific quality and usability of computational models we discuss six key practices underpinning model sharing and re-use. Mapping the FAIR and CURE principles onto the model lifecycle we propose ten recommendations for building and sharing systems biology models that are both FAIR- and CURE-compliant.

q-bio.OT