Hampa: Solver-Aided Recency-Aware Replication
Ontology highlight
ABSTRACT:
SUBMITTER: Lahiri S
PROVIDER: S-EPMC7363281 | biostudies-literature | 2020 Jun
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:HIV incidence is a primary metric for epidemic surveillance and prevention efficacy assessment. HIV incidence assay performance is evaluated via false recency rate (FRR) and mean duration of recent infection (MDRI). We conducted a meta-analysis of 438 incident and 305 chronic specimens' HIV envelope genes from a diverse global cohort. The genome similarity index (GSI) accurately characterized infection stage across diverse host and viral factors. All except one chronic specimen had GSIs below 0.67, yielding a FRR of 0.33 [0-0.98] %. We modeled the incidence assay biomarker dynamics with a logistic link function assuming individual variabilities in a Beta distribution. The GSI probability density function peaked close to 1 in early infection and 0 around two years post infection, yielding MDRI of 420 [361, 467] days. We tested the assay by newly sequencing 744 envelope genes from 59 specimens of 21 subjects who followed from HIV negative status. Both standardized residuals and Anderson-Darling tests showed that the test dataset was statistically consistent with the model biomarker dynamics. This is the first reported incidence assay meeting the optimal FRR and MDRI performance standards. Signatures of HIV gene diversification can allow precise cross-sectional surveillance with a desirable temporal range of incidence detection.
| S-EPMC5547093 | biostudies-literature
Project description:Tailored physical systems were recently exploited to rapidly solve hard computational challenges, such as spin simulators, combinatorial optimization, and focusing through scattering media. Here, we address the phase retrieval problem where an object is reconstructed from its scattered intensity distribution. This is a key problem in many applications, ranging from x-ray imaging to astrophysics, and currently, it lacks efficient direct reconstruction methods: The widely used indirect iterative algorithms are inherently slow. We present an optical approach based on a digital degenerate cavity laser, whose most probable lasing mode rapidly and efficiently reconstructs the object. Our experimental results suggest that the gain competition between the many lasing modes acts as a highly parallel computer that could rapidly solve the phase retrieval problem. Our approach applies to most two-dimensional objects with known compact support, including complex-valued objects, and can be generalized to imaging through scattering media and other hard computational tasks.
| S-EPMC6777974 | biostudies-literature
Project description:One of the greatest challenges of developmental psychology is figuring out what children are thinking. This is particularly difficult in early childhood, for children who are prelinguistic or are just beginning to speak their first words. In this stage, children's responses are commonly measured by presenting young children with a limited choice between one of a small number of options (e.g., "Do you want X or Y?"). A tendency to choose one response in these tasks may be taken as an indication of a child's preference or understanding. Adults' responses are known to exhibit order biases when they are asked questions. The current set of experiments looks into the following question: do children demonstrate response biases? Together, we show that 1) toddlers demonstrate a robust verbal recency bias when asked "or" questions in a lab-based task and a naturalistic corpus of caretaker-child speech interactions, 2) the recency bias weakens with age, and 3) the recency bias strengthens as the syllable-length of the choices gets longer. Taken together, these results indicate that children show a different type of response bias than adults, recency instead of primacy. Further, the results may suggest that this bias stems from increased constraints on children's working memory.
| S-EPMC6561545 | biostudies-literature
Project description:MOTIVATION:Optimizing seed selection is an important problem in read mapping. The number of non-overlapping seeds a mapper selects determines the sensitivity of the mapper while the total frequency of all selected seeds determines the speed of the mapper. Modern seed-and-extend mappers usually select seeds with either an equal and fixed-length scheme or with an inflexible placement scheme, both of which limit the ability of the mapper in selecting less frequent seeds to speed up the mapping process. Therefore, it is crucial to develop a new algorithm that can adjust both the individual seed length and the seed placement, as well as derive less frequent seeds. RESULTS:We present the Optimal Seed Solver (OSS), a dynamic programming algorithm that discovers the least frequently-occurring set of x seeds in an L-base-pair read in [Formula: see text] operations on average and in [Formula: see text] operations in the worst case, while generating a maximum of [Formula: see text] seed frequency database lookups. We compare OSS against four state-of-the-art seed selection schemes and observe that OSS provides a 3-fold reduction in average seed frequency over the best previous seed selection optimizations. AVAILABILITY AND IMPLEMENTATION:We provide an implementation of the Optimal Seed Solver in C++ at: https://github.com/CMU-SAFARI/Optimal-Seed-Solver CONTACT:hxin@cmu.edu, calkan@cs.bilkent.edu.tr or onur@cmu.edu SUPPLEMENTARY INFORMATION:Supplementary data are available at Bioinformatics online.
| S-EPMC6363230 | biostudies-literature
Project description:To probe how non-human primates (NHPs) decode temporal dynamic stimuli, we used a two-alternative forced choice task (2AFC), where the cue was dynamic: a movie snippet drawn from an animation that transforms one image into another. When the cue was drawn from either the beginning or end of the animation, thus heavily weighted towards one (the target) of both images (the choice pair), then primates performed at high levels of accuracy. For a subset of trials, however, the cue was ambiguous, drawn from the middle of the animation, containing information that could be associated to either image. Those trials, rewarded randomly and independent of choice, offered an opportunity to study the strategy the animals used trying to decode the cue. Despite being ambiguous, the primates exhibited a clear strategy, suggesting they were not aware that reward was given non-differentially. More specifically, they relied more on information provided at the end than at the beginning of those cues, consistent with the recency effect reported by numerous serial position studies. Interestingly and counterintuitively, this effect became stronger for sessions where the primates were already familiar with the stimuli. In other words, despite having rehearsed with the same stimuli in a previous session, the animals relied even more on a decision strategy that did not yield any benefits during a previous session. In the discussion section we speculate on what might cause this behavioral shift towards stronger bias, as well as why this behavior shows similarities with a repetition bias in humans known as the illusory truth effect.
| S-EPMC6882415 | biostudies-literature
Project description:The multistate Bennett acceptance ratio method (MBAR) and unbinned weighted histogram analysis method (UWHAM) are widely employed approaches to calculate relative free energies of multiple thermodynamic states that gain statistical precision by employing free energy contributions from configurations sampled at each of the simulated ? states. With the increasing availability of high throughput computing resources, a large number of configurations can be sampled from hundreds or even thousands of states. Combining sampled configurations from all states to calculate relative free energies requires the iterative solution of large scale MBAR/UWHAM equations. In the current work, we describe the development of a fast solver to iteratively solve these large scale MBAR/UWHAM equations utilizing our previous findings that the MBAR/UWHAM equations can be derived as a Rao-Blackwell estimator. The solver is implemented and distributed as a Python module called FastMBAR. Our benchmark results show that FastMBAR is more than 2 times faster than the widely used solver pymbar, when it runs on a central processing unit (CPU) and more than 100 times faster than pymbar when it runs on a graphical processing unit (GPU). The significant speedup achieved by FastMBAR running on a GPU is useful not only for solving large scale MBAR/UWHAM equations but also for estimating uncertainty of calculated free energies using bootstrapping where the MBAR/UWHAM equations need to be solved multiple times.
| S-EPMC6372332 | biostudies-literature
Project description:PBEQ-Solver provides a web-based graphical user interface to read biomolecular structures, solve the Poisson-Boltzmann (PB) equations and interactively visualize the electrostatic potential. PBEQ-Solver calculates (i) electrostatic potential and solvation free energy, (ii) protein-protein (DNA or RNA) electrostatic interaction energy and (iii) pKa of a selected titratable residue. All the calculations can be performed in both aqueous solvent and membrane environments (with a cylindrical pore in the case of membrane). PBEQ-Solver uses the PBEQ module in the biomolecular simulation program CHARMM to solve the finite-difference PB equation of molecules specified by users. Users can interactively inspect the calculated electrostatic potential on the solvent-accessible surface as well as iso-electrostatic potential contours using a novel online visualization tool based on MarvinSpace molecular visualization software, a Java applet integrated within CHARMM-GUI (http://www.charmm-gui.org). To reduce the computational time on the server, and to increase the efficiency in visualization, all the PB calculations are performed with coarse grid spacing (1.5 A before and 1 A after focusing). PBEQ-Solver suggests various physical parameters for PB calculations and users can modify them if necessary. PBEQ-Solver is available at http://www.charmm-gui.org/input/pbeqsolver.
| S-EPMC2447802 | biostudies-literature
Project description:The Poisson Nernst-Planck (PNP) theory is a simplified continuum model for a wide variety of chemical, physical and biological applications. Its ability of providing quantitative explanation and increasingly qualitative predictions of experimental measurements has earned itself much recognition in the research community. Numerous computational algorithms have been constructed for the solution of the PNP equations. However, in the realistic ion-channel context, no second order convergent PNP algorithm has ever been reported in the literature, due to many numerical obstacles, including discontinuous coefficients, singular charges, geometric singularities, and nonlinear couplings. The present work introduces a number of numerical algorithms to overcome the abovementioned numerical challenges and constructs the first second-order convergent PNP solver in the ion-channel context. First, a Dirichlet to Neumann mapping (DNM) algorithm is designed to alleviate the charge singularity due to the protein structure. Additionally, the matched interface and boundary (MIB) method is reformulated for solving the PNP equations. The MIB method systematically enforces the interface jump conditions and achieves the second order accuracy in the presence of complex geometry and geometric singularities of molecular surfaces. Moreover, two iterative schemes are utilized to deal with the coupled nonlinear equations. Furthermore, extensive and rigorous numerical validations are carried out over a number of geometries, including a sphere, two proteins and an ion channel, to examine the numerical accuracy and convergence order of the present numerical algorithms. Finally, application is considered to a real transmembrane protein, the Gramicidin A channel protein. The performance of the proposed numerical techniques is tested against a number of factors, including mesh sizes, diffusion coefficient profiles, iterative schemes, ion concentrations, and applied voltages. Numerical predictions are compared with experimental measurements.
| S-EPMC3087981 | biostudies-literature
Project description:As computational models inspired by the biological neural system, spiking neural networks (SNN) continue to demonstrate great potential in the landscape of artificial intelligence, particularly in tasks such as recognition, inference, and learning. While SNN focuses on achieving high-level intelligence of individual creatures, Swarm Intelligence (SI) is another type of bio-inspired models that mimic the collective intelligence of biological swarms, i.e., bird flocks, fish school and ant colonies. SI algorithms provide efficient and practical solutions to many difficult optimization problems through multi-agent metaheuristic search. Bridging these two distinct subfields of artificial intelligence has the potential to harness collective behavior and learning ability of biological systems. In this work, we explore the feasibility of connecting these two models by implementing a generalized SI model on SNN. In the proposed computing paradigm, we use SNNs to represent agents in the swarm and encode problem solutions with the spike firing rate and with spike timing. The coupled neurons communicate and modulate each other's action potentials through event-driven spikes and synchronize their dynamics around the states of optimal solutions. We demonstrate that such an SI-SNN model is capable of efficiently solving optimization problems, such as parameter optimization of continuous functions and a ubiquitous combinatorial optimization problem, namely, the traveling salesman problem with near-optimal solutions. Furthermore, we demonstrate an efficient implementation of such neural dynamics on an emerging hardware platform, namely ferroelectric field-effect transistor (FeFET) based spiking neurons. Such an emerging in-silico neuron is composed of a compact 1T-1FeFET structure with both excitatory and inhibitory inputs. We show that the designed neuromorphic system can serve as an optimization solver with high-performance and high energy-efficiency.
| S-EPMC6700359 | biostudies-literature
Project description:MotivationThe variation graph toolkit (VG) represents genetic variation as a graph. Although each path in the graph is a potential haplotype, most paths are non-biological, unlikely recombinations of true haplotypes.ResultsWe augment the VG model with haplotype information to identify which paths are more likely to exist in nature. For this purpose, we develop a scalable implementation of the graph extension of the positional Burrows-Wheeler transform. We demonstrate the scalability of the new implementation by building a whole-genome index of the 5008 haplotypes of the 1000 Genomes Project, and an index of all 108 070 Trans-Omics for Precision Medicine Freeze 5 chromosome 17 haplotypes. We also develop an algorithm for simplifying variation graphs for k-mer indexing without losing any k-mers in the haplotypes.Availability and implementationOur software is available at https://github.com/vgteam/vg, https://github.com/jltsiren/gbwt and https://github.com/jltsiren/gcsa2.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC7223266 | biostudies-literature