PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “computational frameworks”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3Linked to original sources

Physiological modeling with virtual cell framework.

This article describes a computational framework for cell biological modeling and simulation that is based on the mapping of experimental biochemical and electrophysiological data onto experimental images. The framework is designed to enable the construction of complex general models that encompass the general class of problems coupling reaction and diffusion.

Animals↗

A knowledge framework for computational molecular-disease relationships in cancer.

Biomedical knowledge is growing at an exponential rate, with new discoveries being published across a range of information sources. A coded, fully-computable, and integrated approach to this information could increase the efficiency of its use, through improved retrieval as well as the eventual ability to apply decision support tools to the knowledge base. Though multiple knowledge bases (KBs) and databases (DBs) concerning gene-disease relationships exist, few present the information in a coded, easily computable form. Focusing on molecular-disease relationships in cancer (gene-disease and protein-disease), we evaluated articles in major biomedical journals, in order to develop both the framework for a knowledge model as well as evaluation criteria. We then used these criteria to evaluate major KBs, DBs, and terminologies. We discovered that although both the high-level as well as the specific molecular-disease relationships present in our test set were mapped in many of the databases, they generally were not applied together in a coded form. We propose a rationale behind a model mediated schema for the integration of these resources.

Artificial Intelligence↗

Integrating structure and experimental data annotations with computational modeling framework for predicting micro-nanoplastics toxicities.

The wide use of plastic materials leads to increased emissions of micro-nanoplastics (MNPs) into the environment, raising significant concerns about their impact on human health. Traditional experimental approaches for assessing MNPs toxicity are costly, time-consuming, and there are no experimental protocols that are universally acceptable. Computational modeling using machine learning (ML) approaches provides an efficient alternative to MNP toxicity assessment. However, most modeling studies of MNPs are limited due to the lack of high-quality data and there are few previous modeling studies considering complex structures of MNPs for model training. To address this challenge, we constructed three MNP datasets with popular toxicity endpoints from various resources and used nanostructure annotation techniques to create virtual MNPs (vMNPs) for all MNP structures. The MNP structures were digitalized from annotated vMNPs, and geometrical descriptors were calculated using the Delaunay Tessellation approach. Moreover, important experimental information, such as concentrations and cell lines, were transformed into extra training variables. Partial least squares regression (PLSR) models were built using both experimental and geometrical descriptors and validated through a leave-one-out cross validation procedure. The resulting models showed reasonable performance in predicting toxicity potentials of MNPs for the three endpoints in the present datasets. Moreover, an additional library of vMNPs with their predicted properties and bioactivities was constructed, directing further research of new MNPs. This study provides three novel ML models for MNPs by integrating geometrical and experimental descriptors, which have the potential to assess new MNPs for their toxicity. The modeling strategy developed in this study can be easily expanded to model other MNP toxicity endpoints and create promising new models for MNP toxicity assessments.

Data annotation↗

Numerical simulation for heat transfer in prostate cancer cryosurgery.

A comprehensive computational framework to simulate heat transfer during the freezing process in prostate cancer cryosurgery is presented. Tissues are treated as nonideal materials wherein phase transition occurs over a temperature range, thermophysical properties are temperature dependent and heating due to blood flow and metabolism are included. Boundary conditions were determined at the surfaces of the commercially available cryoprobes and urethral warmer by experimental study of temperature combined with a mathematical optimization process. For simulations, a suitable computational geometry was designed based on MRI imaging data of a real prostate. An enthalpy formulation-based numerical solution was performed for a prescribed surgical protocol to mimic a clinical freezing process. This computational framework allows for the individual planning of cryosurgical procedures and objective assessment of the effectiveness of prostate cryosurgery.

Body Temperature↗

The modeling of global epidemics: stochastic dynamics and predictability.

The global spread of emergent diseases is inevitably entangled with the structure of the population flows among different geographical regions. The airline transportation network in particular shrinks the geographical space by reducing travel time between the world's most populated areas and defines the main channels along which emergent diseases will spread. In this paper, we investigate the role of the large-scale properties of the airline transportation network in determining the global propagation pattern of emerging diseases. We put forward a stochastic computational framework for the modeling of the global spreading of infectious diseases that takes advantage of the complete International Air Transport Association 2002 database complemented with census population data. The model is analyzed by using for the first time an information theory approach that allows the quantitative characterization of the heterogeneity level and the predictability of the spreading pattern in presence of stochastic fluctuations. In particular we are able to assess the reliability of numerical forecast with respect to the intrinsic stochastic nature of the disease transmission and travel flows. The epidemic pattern predictability is quantitatively determined and traced back to the occurrence of epidemic pathways defining a backbone of dominant connections for the disease spreading. The presented results provide a general computational framework for the analysis of containment policies and risk forecast of global epidemic outbreaks.

Communicable Diseases↗

A framework for computational and experimental methods: identifying dimerization residues in CCR chemokine receptors.

Solving relevant biological problems requires answering complex questions. Addressing such questions traditionally implied the design of time-consuming experimental procedures which most of the time are not accessible to average-sized laboratories. The current trend is to move towards a multidisciplinary approach integrating both theoretical knowledge and experimental work. This combination creates a powerful tool for shedding light on biological problems. To illustrate this concept, we present here a descriptive example of where computational methods were shown to be a key aspect in detecting crucial players in an important biological problem: the dimerization of chemokine receptors. Using evolutionary based sequence analysis in combination with structural predictions two CCR5 residues were selected as important for dimerization and further validated experimentally. The experimental validation of computational procedures demonstrated here provides a wealth of valuable information not obtainable by any of the individual approaches alone.

Amino Acid Sequence↗

A novel connectionist framework for computation of an approximate convex-hull of a set of planar points, circles and ellipses.

We propose a two layer neural network for computation of an approximate convex-hull of a set of points or a set of circles/ellipses of different sizes. The algorithm is based on a very elegant concept - shrinking of a rubber band surrounding the set of planar objects. Logically, a set of neurons is placed on a circle (rubber band) surrounding the objects. Each neuron has a parameter vector associated with it. This may be viewed as the current position of the neuron. The given set of points/objects exerts a force of attraction on every neuron, which determines how its current position will be updated (as if, the force determines the direction of movement of the neuron lying on the rubber band). As the network evolves, the neurons (parameter vectors) approximate the convex-hull more and more accurately. The scheme can be applied to find the convex-hull of a planar set of circles or ellipses or a mixture of the two. Some properties related to the evolution of the algorithm are also presented.

Algorithms↗

Real-time computing without stable states: a new framework for neural computation based on perturbations.

A key challenge for neural modeling is to explain how a continuous stream of multimodal input from a rapidly changing environment can be processed by stereotypical recurrent circuits of integrate-and-fire neurons in real time. We propose a new computational model for real-time computing on time-varying input that provides an alternative to paradigms based on Turing machines or attractor neural networks. It does not require a task-dependent construction of neural circuits. Instead, it is based on principles of high-dimensional dynamical systems in combination with statistical learning theory and can be implemented on generic evolved or found recurrent circuitry. It is shown that the inherent transient dynamics of the high-dimensional dynamical system formed by a sufficiently large and heterogeneous neural circuit may serve as universal analog fading memory. Readout neurons can learn to extract in real time from the current state of such recurrent neural circuit information about current and past inputs that may be needed for diverse tasks. Stable internal states are not required for giving a stable output, since transient internal states can be transformed by readout neurons into stable target outputs due to the high dimensionality of the dynamical system. Our approach is based on a rigorous computational model, the liquid state machine, that, unlike Turing machines, does not require sequential transitions between well-defined discrete internal states. It is supported, as the Turing machine is, by rigorous mathematical results that predict universal computational power under idealized conditions, but for the biologically more realistic scenario of real-time processing of time-varying inputs. Our approach provides new perspectives for the interpretation of neural coding, the design of experiments and data analysis in neurophysiology, and the solution of problems in robotics and neurotechnology.

Action Potentials↗

Stochastic kinetics of viral capsid assembly based on detailed protein structures.

We present a generic computational framework for the simulation of viral capsid assembly which is quantitative and specific. Starting from PDB files containing atomic coordinates, the algorithm builds a coarse-grained description of protein oligomers based on graph rigidity. These reduced protein descriptions are used in an extended Gillespie algorithm to investigate the stochastic kinetics of the assembly process. The association rates are obtained from a diffusive Smoluchowski equation for rapid coagulation, modified to account for water shielding and protein structure. The dissociation rates are derived by interpreting the splitting of oligomers as a process of graph partitioning akin to the escape from a multidimensional well. This modular framework is quantitative yet computationally tractable, with a small number of physically motivated parameters. The methodology is illustrated using two different viruses which are shown to follow quantitatively different assembly pathways. We also show how in this model the quasi-stationary kinetics of assembly can be described as a Markovian cascading process, in which only a few intermediates and a small proportion of pathways are present. The observed pathways and intermediates can be related a posteriori to structural and energetic properties of the capsid oligomers.

Algorithms↗

A qualitative model for computer-assisted instruction in cardiology.

CARDIOLAB is an interactive computational framework dedicated to teaching and computer-aided diagnosis in cardiology. The framework embodies models that simulate the heart's electrical activity. They constitute the core of a Computer-Assisted Instruction (CAI) program intended to teach, in a multimedia environment, the concepts underlying rhythmic disorders and cardiac diseases. The framework includes a qualitative model (QM) which is described in this paper. During simulation using QM, dynamic sequences representing impulse formation and conduction processes are produced along with the corresponding qualitative descriptions. The corresponding electrocardiogram (ECG) and ladder diagram are also produced, and thus, both qualitative notions and quantitative facts can be taught via the model. We discuss how qualitative models in particular, and computational models in general can enhance the teaching capability of CAI programs.

Cardiology↗

Neural-network models of learning and memory: leading questions and an emerging framework.

Real-time neural-network models provide a conceptual framework for formulating questions about the nature of cognition, an architectural framework for mapping cognitive functions to brain regions, a semantic framework for defining terms, and a computational framework for testing hypotheses. This article considers key questions about how a physical system might simultaneously support one-trial learning and lifetime memories, in the context of neural models that test possible solutions to the problems posed. Model properties point to partial answers, and model limitations lead to new questions. Placing individual system components in the context of a unified real-time network allows analysis to move from the level of neural processes, including learning laws and rules of synaptic transmission, to cognitive processes, including attention and consciousness.

Journal Article↗

Interpreter of maladies: redescription mining applied to biomedical data analysis.

Comprehensive, systematic and integrated data-centric statistical approaches to disease modeling can provide powerful frameworks for understanding disease etiology. Here, one such computational framework based on redescription mining in both its incarnations, static and dynamic, is discussed. The static framework provides bioinformatic tools applicable to multifaceted datasets, containing genetic, transcriptomic, proteomic, and clinical data for diseased patients and normal subjects. The dynamic redescription framework provides systems biology tools to model complex sets of regulatory, metabolic and signaling pathways in the initiation and progression of a disease. As an example, the case of chronic fatigue syndrome (CFS) is considered, which has so far remained intractable and unpredictable in its etiology and nosology. The redescription mining approaches can be applied to the Centers for Disease Control and Prevention's Wichita (KS, USA) dataset, integrating transcriptomic, epidemiological and clinical data, and can also be used to study how pathways in the hypothalamic-pituitary-adrenal axis affect CFS patients.

Algorithms↗

Probabilistic graphical models for computational biomedicine.

BACKGROUND: As genomics becomes increasingly relevant to medicine, medical informatics and bioinformatics are gradually converging into a larger field that we call computational biomedicine. OBJECTIVES: Developing a computational framework that is common to the different disciplines that compose computational biomedicine will be a major enabler of the further development and integration of this research domain. METHODS: Probabilistic graphical models such as Hidden Markov Models, belief networks, and missing-data models together with computational methods such as dynamic programming, Expectation-Maximization, data-augmentation Gibbs sampling, and the Metropolis-Hastings algorithm provide the tools for an integrated probabilistic approach to computational biomedicine. RESULTS AND CONCLUSIONS: We show how graphical models have already found a broad application in different fields composing computational biomedicine. We also indicate several challenges that lie at the interface between medical informatics, statistical genomics, and bioinformatics. We also argue that graphical models offer a unified framework making it possible to integrate in a statistically meaningful way multiple models ranging from the molecular level to cellular and to clinical levels. Because of their versatility and firm statistical underpinning, we assert that probabilistic graphical models can serve as the lingua franca for many computationally intensive approaches to biology and medicine. As such, graphical models should be a foundation of the curriculum of students in these fields. From such a foundation, students could then build towards specific computational methods in medical informatics, medical image analysis, statistical genetics, or bioinformatics while keeping the communication open between these areas.

Computational Biology↗

An optimization framework for identifying reaction activation/inhibition or elimination candidates for overproduction in microbial systems.

We introduce a computational framework termed OptReg that determines the optimal reaction activations/inhibitions and eliminations for targeted biochemical production. A reaction is deemed up- or downregulated if it is constrained to assume flux values significantly above or below its steady-state before the genetic manipulations. The developed framework is demonstrated by studying the overproduction of ethanol in Escherichia coli. Computational results reveal the existence of synergism between reaction deletions and modulations implying that the simultaneous application of both types of genetic manipulations yields the most promising results. For example, the downregulation of phosphoglucomutase in conjunction with the deletion of oxygen uptake and pyruvate formate lyase yields 99.8% of the maximum theoretical ethanol yield. Conceptually, the proposed strategies redirect both the carbon flux as well as the cofactors to enhance ethanol production in the network. The OptReg framework is a versatile tool for strain design which allows for a broad array of genetic manipulations.

Acetyltransferases↗