Congenital myopathies are a heterogeneous group of diseases affecting the skeletal muscles and characterized by high clinical, genetic, and histological variability. Magnetic Resonance (MR) is a ...valuable tool for the assessment of involved muscles (i.e., fatty replacement and oedema) and disease progression. Machine Learning is becoming increasingly applied for diagnostic purposes, but to our knowledge, Self-Organizing Maps (SOMs) have never been used for the identification of the patterns in these diseases. The aim of this study is to evaluate if SOMs may discriminate between muscles with fatty replacement (S), oedema (E) or neither (N).
MR studies of a family affected by tubular aggregates myopathy (TAM) with the histologically proven autosomal dominant mutation of the STIM1 gene, were examined: for each patient, in two MR assessments (i.e., t0 and t1, the latter after 5 years), fifty-three muscles were evaluated for muscular fatty replacement on the T1w images, and for oedema on the STIR images, for reference. Sixty radiomic features were collected from each muscle at t0 and t1 MR assessment using 3DSlicer software, in order to obtain data from images. A SOM was created to analyze all datasets using three clusters (i.e., 0, 1 and 2) and results were compared with radiological evaluation.
Six patients with TAM STIM1-mutation were included. At t0 MR assessments, all patients showed widespread fatty replacement that intensifies at t1, while oedema mainly affected the muscles of the legs and appears stable at follow-up. All muscles with oedema showed fatty replacement, too. At t0 SOM grid clustering shows almost all N muscles in Cluster 0 and most of the E muscles in Cluster 1; at t1 almost all E muscles appear in Cluster 1.
Our unsupervised learning model appears to be able to recognize muscles altered by the presence of edema and fatty replacement.
Celotno besedilo
Dostopno za:
DOBA, IZUM, KILJ, NUK, PILJ, PNG, SAZU, SIK, UILJ, UKNU, UL, UM, UPUK
In order to fully characterize the genome of an individual, the reconstruction of the two distinct copies of each chromosome, called haplotypes, is essential. The computational problem of inferring ...the full haplotype of a cell starting from read sequencing data is known as haplotype assembly, and consists in assigning all heterozygous Single Nucleotide Polymorphisms (SNPs) to exactly one of the two chromosomes. Indeed, the knowledge of complete haplotypes is generally more informative than analyzing single SNPs and plays a fundamental role in many medical applications.
To reconstruct the two haplotypes, we addressed the weighted Minimum Error Correction (wMEC) problem, which is a successful approach for haplotype assembly. This NP-hard problem consists in computing the two haplotypes that partition the sequencing reads into two disjoint sub-sets, with the least number of corrections to the SNP values. To this aim, we propose here GenHap, a novel computational method for haplotype assembly based on Genetic Algorithms, yielding optimal solutions by means of a global search process. In order to evaluate the effectiveness of our approach, we run GenHap on two synthetic (yet realistic) datasets, based on the Roche/454 and PacBio RS II sequencing technologies. We compared the performance of GenHap against HapCol, an efficient state-of-the-art algorithm for haplotype phasing. Our results show that GenHap always obtains high accuracy solutions (in terms of haplotype error rate), and is up to 4× faster than HapCol in the case of Roche/454 instances and up to 20× faster when compared on the PacBio RS II dataset. Finally, we assessed the performance of GenHap on two different real datasets.
Future-generation sequencing technologies, producing longer reads with higher coverage, can highly benefit from GenHap, thanks to its capability of efficiently solving large instances of the haplotype assembly problem. Moreover, the optimization approach proposed in GenHap can be extended to the study of allele-specific genomic features, such as expression, methylation and chromatin conformation, by exploiting multi-objective optimization techniques. The source code and the full documentation are available at the following GitHub repository: https://github.com/andrea-tango/GenHap .
Celotno besedilo
Dostopno za:
DOBA, IZUM, KILJ, NUK, PILJ, PNG, SAZU, SIK, UILJ, UKNU, UL, UM, UPUK
Many researchers have used fuzzy set theory and fuzzy logic in a variety of applications related to computer science and engineering, given the capability of fuzzy inference systems to deal with ...uncertainty, represent vague concepts, and connect human language to numerical data. In this work we propose Simpful, a general-purpose and user-friendly Python library designed to facilitate the definition, analysis, and interpretation of fuzzy inference systems. Simpful provides a lightweight Application Programming Interface that allows to intuitively define fuzzy sets and fuzzy rules, and to perform fuzzy inference. Worthy of note, in Simpful the fuzzy rules are specified by means of strings of text written in natural language. We provide here some practical examples to show that Simpful represents a valuable addition to the open-source software that supports fuzzy reasoning.
Mathematical models of biochemical networks can largely facilitate the comprehension of the mechanisms at the basis of cellular processes, as well as the formulation of hypotheses that can be tested ...by means of targeted laboratory experiments. However, two issues might hamper the achievement of fruitful outcomes. On the one hand, detailed mechanistic models can involve hundreds or thousands of molecular species and their intermediate complexes, as well as hundreds or thousands of chemical reactions, a situation generally occurring in rule-based modeling. On the other hand, the computational analysis of a model typically requires the execution of a large number of simulations for its calibration, or to test the effect of perturbations. As a consequence, the computational capabilities of modern Central Processing Units can be easily overtaken, possibly making the modeling of biochemical networks a worthless or ineffective effort. To the aim of overcoming the limitations of the current state-of-the-art simulation approaches, we present in this paper FiCoS, a novel "black-box" deterministic simulator that effectively realizes both a fine-grained and a coarse-grained parallelization on Graphics Processing Units. In particular, FiCoS exploits two different integration methods, namely, the Dormand-Prince and the Radau IIA, to efficiently solve both non-stiff and stiff systems of coupled Ordinary Differential Equations. We tested the performance of FiCoS against different deterministic simulators, by considering models of increasing size and by running analyses with increasing computational demands. FiCoS was able to dramatically speedup the computations up to 855×, showing to be a promising solution for the simulation and analysis of large-scale models of complex biological processes.
Celotno besedilo
Dostopno za:
DOBA, IZUM, KILJ, NUK, PILJ, PNG, SAZU, SIK, UILJ, UKNU, UL, UM, UPUK
Accurate glucose prediction is vital for diabetes management. Artificial intelligence and artificial neural networks (ANNs) are showing promising results for reliable glucose predictions, offering ...timely warnings for glucose fluctuations. The translation of these software‐based ANNs into dedicated computing hardware opens a route toward automated insulin delivery systems ultimately enhancing the quality of life for diabetic patients. ANNs are transforming this field, potentially leading to implantable smart prediction devices and ultimately to a fully artificial pancreas. However, this transition presents several challenges, including the need for specialized, compact, lightweight, and low‐power hardware. Organic polymer‐based electronics are a promising solution as they have the ability to implement the behavior of neural networks, operate at low voltage, and possess key attributes like flexibility, stretchability, and biocompatibility. Here, the study focuses on implementing software‐based neural networks for glucose prediction into hardware systems. How to minimize network requirements, downscale the architecture, and integrate the neural network with electrochemical neuromorphic organic devices, meeting the strict demands of smart implants for in‐body computation of glucose prediction is investigated.
Accurate glucose prediction is crucial for diabetic patients. Many state‐of‐the‐art prediction methods rely on artificial neural networks to offer reliable predictions, implemented as software running on conventional computing architecture. However, such software networks can be downscaled to meet the requirements of flexible, biocompatible, and low‐power neuromorphic hardware based on organic electronics. The simulated organic neuromorphic micro‐networks match state‐of‐the‐art software performance.
Surfing in rough waters is not always as fun as wave riding the “big one”. Similarly, in optimization problems, fitness landscapes with a huge number of local optima make the search for the global ...optimum a hard and generally annoying game. Computational Intelligence optimization metaheuristics use a set of individuals that “surf” across the fitness landscape, sharing and exploiting pieces of information about local fitness values in a joint effort to find out the global optimum. In this context, we designed surF, a novel surrogate modeling technique that leverages the discrete Fourier transform to generate a smoother, and possibly easier to explore, fitness landscape. The rationale behind this idea is that filtering out the high frequencies of the fitness function and keeping only its partial information (i.e., the low frequencies) can actually be beneficial in the optimization process. We prove our theory by combining surF with a settings free variant of Particle Swarm Optimization (PSO) based on Fuzzy Logic, called Fuzzy Self-Tuning PSO. Specifically, we introduce a new algorithm, named F3ST-PSO, which performs a preliminary exploration on the surrogate model followed by a second optimization using the actual fitness function. We show that F3ST-PSO can lead to improved performances, notably using the same budget of fitness evaluations.
Several software tools for the simulation and analysis of biochemical reaction networks have been developed in the last decades; however, assessing and comparing their computational performance in ...executing the typical tasks of computational systems biology can be limited by the lack of a standardized benchmarking approach. To overcome these limitations, we propose here a novel tool, named SMGen, designed to automatically generate synthetic models of reaction networks that, by construction, are characterized by relevant features (e.g., system connectivity and reaction discreteness) and non-trivial emergent dynamics of real biochemical networks. The generation of synthetic models in SMGen is based on the definition of an undirected graph consisting of a single connected component that, generally, results in a computationally demanding task; to speed up the overall process, SMGen exploits a main–worker paradigm. SMGen is also provided with a user-friendly graphical user interface, which allows the user to easily set up all the parameters required to generate a set of synthetic models with any number of reactions and species. We analysed the computational performance of SMGen by generating batches of symmetric and asymmetric reaction-based models (RBMs) of increasing size, showing how a different number of reactions and/or species affects the generation time. Our results show that when the number of reactions is higher than the number of species, SMGen has to identify and correct a large number of errors during the creation process of the RBMs, a circumstance that increases the running time. Still, SMGen can generate synthetic models with hundreds of species and reactions in less than 7 s.
Combination therapies proved to be a valuable strategy in the fight against cancer, thanks to their increased efficacy in inducing tumor cell death and in reducing tumor growth, metastatic potential, ...and the risk of developing drug resistance. The identification of effective combinations of drug targets generally relies on costly and time consuming processes based on
experiments. Here, we present a novel computational approach that, by integrating dynamic fuzzy modeling with multi-objective optimization, allows to efficiently identify novel combination cancer therapies, with a relevant saving in working time and costs. We tested this approach on a model of oncogenic K-ras cancer cells characterized by a marked Warburg effect. The computational approach was validated by its capability in finding out therapies already known in the literature for this type of cancer cell. More importantly, our results show that this method can suggest potential therapies consisting in a small number of molecular targets. In the model of oncogenic K-ras cancer cells, for instance, we identified combination of up to three targets, which affect different cellular pathways that are crucial for cancer proliferation and survival.
The parameter estimation (PE) of biochemical reactions is one of the most challenging tasks in systems biology given the pivotal role of these kinetic constants in driving the behavior of biochemical ...systems. PE is a non-convex, multi-modal, and non-separable optimization problem with an unknown fitness landscape; moreover, the quantities of the biochemical species appearing in the system can be low, making biological noise a non-negligible phenomenon and mandating the use of stochastic simulation. Finally, the values of the kinetic parameters typically follow a log-uniform distribution; thus, the optimal solutions are situated in the lowest orders of magnitude of the search space. In this work, we further elaborate on a novel approach to address the PE problem based on a combination of adaptive swarm intelligence and dilation functions (DFs). DFs require prior knowledge of the characteristics of the fitness landscape; therefore, we leverage an alternative solution to evolve optimal DFs. On top of this approach, we introduce surrogate Fourier modeling to simplify the PE, by producing a smoother version of the fitness landscape that excludes the high frequency components of the fitness function. Our results show that the PE exploiting evolved DFs has a performance comparable with that of the PE run with a custom DF. Moreover, surrogate Fourier modeling allows for improving the convergence speed. Finally, we discuss some open problems related to the scalability of our methodology.
Oxford Nanopore Technologies (ONT) is a third generation sequencing approach that allows the analysis of individual, full-length nucleic acids. ONT records the alterations of an ionic current flowing ...across a nano-scaled pore while a DNA or RNA strand is threading through the pore. Basecalling methods are then leveraged to translate the recorded signal back to the nucleic acid sequence. However, basecall generally introduces errors that hinder the process of barcode demultiplexing, a pivotal task in single-cell RNA sequencing that allows for separating the sequenced transcripts on the basis of their cell of origin.
To solve this issue, we present a novel framework, called UNPLEX, designed to tackle the barcode demultiplexing problem by operating directly on the recorded signals. UNPLEX combines two unsupervised machine learning methods: autoencoders and self-organizing maps (SOM). The autoencoders extract compact, latent representations of the recorded signals that are then clustered by the SOM.
Our results, obtained on two datasets composed of
generated ONT-like signals, show that UNPLEX represents a promising starting point for the development of effective tools to cluster the signals corresponding to the same cell.
PDF
