The rapid increase of genome data brought by gene sequencing technologies poses a massive challenge to data processing. To solve the problems caused by enormous data and complex computing requirements, researchers have proposed many methods and tools which can be divided into three types: big data storage, efficient algorithm design and parallel computing. The purpose of this review is to investigate popular parallel programming technologies for genome sequence processing. Three common parallel computing models are introduced according to their hardware architectures, and each of which is classified into two or three types and is further analyzed with their features. Then, the parallel computing for genome sequence processing is discussed with four common applications: genome sequence alignment, single nucleotide polymorphism calling, genome sequence preprocessing, and pattern detection and searching. For each kind of application, its background is firstly introduced, and then a list of tools or algorithms are summarized in the aspects of principle, hardware platform and computing efficiency. The programming model of each hardware and application provides a reference for researchers to choose high-performance computing tools. Finally, we discuss the limitations and future trends of parallel computing technologies.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1093/bib/bbab070 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Reactions of Hydrogen-Passivated Silicon Vacancies in -Quartz with Electron Holes and Hydrogen.
Nanomaterials (Basel)
January 2025
Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT, UK.
We used density functional theory with a hybrid functional to investigate the structure and properties of [4H] (hydrogarnet) defects in -quartz as well as the reactions of these defects with electron holes and extra hydrogen atoms and ions. The results demonstrate the depassivation mechanisms of hydrogen-passivated silicon vacancies in -quartz, providing a detailed understanding of their stability, electronic properties, and behaviour in different charge states. While fully hydrogen passivated silicon vacancies are electrically inert, the partial removal of hydrogen atoms activates these defects as hole traps, altering the defect states and influencing the electronic properties of the material.
View Article and Find Full Text PDFAdvanced Monte Carlo for Acquisition Sampling in Bayesian Optimization.
Entropy (Basel)
January 2025
Instituto Universitario de Investigacion en Ingenieria de Aragon (I3A), Universidad de Zaragoza, 50018 Zaragoza, Spain.
Optimizing complex systems usually involves costly and time-consuming experiments, where selecting the experiments to perform is fundamental. Bayesian optimization (BO) has proved to be a suitable optimization method in these situations thanks to its sample efficiency and principled way of learning from previous data, but it typically requires that experiments are sequentially performed. Fully distributed BO addresses the need for efficient parallel and asynchronous active search, especially where traditional centralized BO faces limitations concerning privacy in federated learning and resource utilization in high-performance computing settings.
View Article and Find Full Text PDFEffects of mosquito-proofing storm drains on adult and larvae mosquito abundance: Protocol of the IDAlErt storm drAin randomiSed controlled trial (IDEAS).
MethodsX
June 2025
Heidelberg Institute of Global Health (HIGH), Heidelberg University Hospital, Heidelberg University, Heidelberg, Germany.
and mosquitoes, known for spreading arboviruses like dengue and West Nile, thrive in cities, posing health risks to urban populations. Climate change can create suitable climatic conditions for these vectors to spread further in Europe. Cities contain numerous landscape and infrastructure elements, such as storm drains, that allow stagnant water build-up facilitating mosquito breeding.
View Article and Find Full Text PDFFPGA acceleration of tensor network computing for quantum spin models.
Rev Sci Instrum
January 2025
Key Laboratory of Polar Materials and Devices (MOE), School of Physics and Electronic Science, East China Normal University, Shanghai 200241, China.
Increasing the degree of freedom for quantum entanglement within tensor networks can enhance the depiction of the essence in many-body systems. However, this enhancement comes with a significant increase in computational complexity and critical slowing down, which drastically increases time consumption. This work converts a quantum tensor network algorithm into a classical circuit on the Field Programmable Gate Arrays (FPGAs) and arranges the computing unit with a dense parallel design, efficiently optimizing the time consumption.
View Article and Find Full Text PDFVariational Quantum Algorithm for Non-Markovian Quantum Dynamics Using an Ensemble of Ehrenfest Trajectories.
J Phys Chem Lett
January 2025
Department of Chemistry and Biochemistry, George Mason University, Fairfax, Virginia 22030, United States.
The simulation of non-Markovian quantum dynamics plays an important role in the understanding of charge and exciton dynamics in the condensed phase environment, yet such a simulation remains computationally expensive on classical computers. In this work, we develop a variational quantum algorithm that is capable of simulating non-Markovian quantum dynamics on quantum computers. The algorithm captures the non-Markovian effect by employing the Ehrenfest trajectories and Monte Carlo sampling of their thermal distribution.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!