| 1. |
- Lundén, Daniel, 1993-, et al.
(författare)
-
Compiling Universal Probabilistic Programming Languages with Efficient Parallel Sequential Monte Carlo Inference
- 2022
-
Ingår i: Programming Languages and Systems. - Cham : Springer. - 9783030993351 - 9783030993368 ; 13240, s. 29-56
-
Konferensbidrag (refereegranskat)abstract
- Probabilistic programming languages (PPLs) allow users to encode arbitrary inference problems, and PPL implementations provide general-purpose automatic inference for these problems. However, constructing inference implementations that are efficient enough is challenging for many real-world problems. Often, this is due to PPLs not fully exploiting available parallelization and optimization opportunities. For example, handling probabilistic checkpoints in PPLs through continuation-passing style transformations or non-preemptive multitasking—as is done in many popular PPLs—often disallows compilation to low-level languages required for high-performance platforms such as GPUs. To solve the checkpoint problem, we introduce the concept of PPL control-flow graphs (PCFGs)—a simple and efficient approach to checkpoints in low-level languages. We use this approach to implement RootPPL: a low-level PPL built on CUDA and C++ with OpenMP, providing highly efficient and massively parallel SMC inference. We also introduce a general method of compiling universal high-level PPLs to PCFGs and illustrate its application when compiling Miking CorePPL—a high-level universal PPL—to RootPPL. The approach is the first to compile a universal PPL to GPUs with SMC inference. We evaluate RootPPL and the CorePPL compiler through a set of real-world experiments in the domains of phylogenetics and epidemiology, demonstrating up to 6 × speedups over state-of-the-art PPLs implementing SMC inference.
|
|
| 2. |
- Schoch, Conrad L., et al.
(författare)
-
Finding needles in haystacks: linking scientific names, reference specimens and molecular data for Fungi
- 2014
-
Ingår i: Database: The Journal of Biological Databases and Curation. - : Oxford University Press (OUP). - 1758-0463. ; 2014:bau061, s. 1-21
-
Tidskriftsartikel (refereegranskat)abstract
- DNA phylogenetic comparisons have shown that morphology-based species recognition often underestimates fungal diversity. Therefore, the need for accurate DNA sequence data, tied to both correct taxonomic names and clearly annotated specimen data, has never been greater. Furthermore, the growing number of molecular ecology and microbiome projects using high-throughput sequencing require fast and effective methods for en masse species assignments. In this article, we focus on selecting and re-annotating a set of marker reference sequences that represent each currently accepted order of Fungi. The particular focus is on sequences from the internal transcribed spacer region in the nuclear ribosomal cistron, derived from type specimens and/or ex-type cultures. Re-annotated and verified sequences were deposited in a curated public database at the National Center for Biotechnology Information (NCBI), namely the RefSeq Targeted Loci (RTL) database, and will be visible during routine sequence similarity searches with NR_prefixed accession numbers. A set of standards and protocols is proposed to improve the data quality of new sequences, and we suggest how type and other reference sequences can be used to improve identification of Fungi.
|
|
| 3. |
|
|
| 4. |
- Hsiang, Allison
(författare)
-
AutoMorph: Accelerating morphometrics with automated 2D and 3D image processing and shape extraction
- 2017
-
Ingår i: Methods in Ecology and Evolution. - 2041-210X.
-
Tidskriftsartikel (refereegranskat)abstract
- Large-scale, comparative studies of morphological variation are rare due to the time-intensive nature of shape quantification. This data gap is important to address, as intraspecific and interspecific morphological variation underpins and reflects ecological and evolutionary processes.Here, we detail a novel software package, AutoMorph, for high-throughput object and shape extraction. AutoMorph can batch image many types of organisms (e.g. foraminifera, molluscs and fish teeth), allowing for rapid generation of assemblage- scale morphological data.We used AutoMorph to image and generate 2D and 3D morphological data for >100,000 marine microfossils in about a year. Our collaborators have used AutoMorph to process >12,000 patellogastropod shells and >50,000 fish teeth.AutoMorph allows users to rapidly produce large amounts of morphological data, facilitating community-scale evolutionary and ecological studies. To hasten the adoption of automated approaches, we have made AutoMorph freely available and open source. AutoMorph runs on all UNIX-like systems; future versions will run across all platforms.
|
|
| 5. |
|
|
| 6. |
- Iwaszkiewicz-Eggebrecht, Elzbieta, et al.
(författare)
-
FAVIS : Fast and versatile protocol for nondestructive metabarcoding of bulk insect samples
- 2023
-
Ingår i: PLOS ONE. - : Public Library of Science (PLoS). - 1932-6203. ; 18:7, s. e0286272-
-
Tidskriftsartikel (refereegranskat)abstract
- Insects are diverse and sustain essential ecosystem functions, yet remain understudied. Recent reports about declines in insect abundance and diversity have highlighted a pressing need for comprehensive large-scale monitoring. Metabarcoding (high-throughput bulk sequencing of marker gene amplicons) offers a cost-effective and relatively fast method for characterizing insect community samples. However, the methodology applied varies greatly among studies, thus complicating the design of large-scale and repeatable monitoring schemes. Here we describe a non-destructive metabarcoding protocol that is optimized for high-throughput processing of Malaise trap samples and other bulk insect samples. The protocol details the process from obtaining bulk samples up to submitting libraries for sequencing. It is divided into four sections: 1) Laboratory workspace preparation; 2) Sample processing-decanting ethanol, measuring the wet-weight biomass and the concentration of the preservative ethanol, performing non-destructive lysis and preserving the insect material for future work; 3) DNA extraction and purification; and 4) Library preparation and sequencing. The protocol relies on readily available reagents and materials. For steps that require expensive infrastructure, such as the DNA purification robots, we suggest alternative low-cost solutions. The use of this protocol yields a comprehensive assessment of the number of species present in a given sample, their relative read abundances and the overall insect biomass. To date, we have successfully applied the protocol to more than 7000 Malaise trap samples obtained from Sweden and Madagascar. We demonstrate the data yield from the protocol using a small subset of these samples.
|
|
| 7. |
- Lundén, Daniel, 1993-, et al.
(författare)
-
Automatic Alignment in Higher-Order Probabilistic Programming Languages
- 2023
-
Ingår i: Programming Languages and Systems. ; , s. 535-563
-
Konferensbidrag (refereegranskat)abstract
- Probabilistic Programming Languages (PPLs) allow users to encode statistical inference problems and automatically apply an inference algorithm to solve them. Popular inference algorithms for PPLs, such as sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC), are built around checkpoints—relevant events for the inference algorithm during the execution of a probabilistic program. Deciding the location of checkpoints is, in current PPLs, not done optimally. To solve this problem, we present a static analysis technique that automatically determines checkpoints in programs, relieving PPL users of this task. The analysis identifies a set of checkpoints that execute in the same order in every program run—they are aligned. We formalize alignment, prove the correctness of the analysis, and implement the analysis as part of the higher-order functional PPL Miking CorePPL. By utilizing the alignment analysis, we design two novel inference algorithm variants: aligned SMC and aligned lightweight MCMC. We show, through real-world experiments, that they significantly improve inference execution time and accuracy compared to standard PPL versions of SMC and MCMC.
|
|
| 8. |
- Pochon, Zoé, et al.
(författare)
-
aMeta : an accurate and memory-efficient ancient metagenomic profiling workflow
- 2023
-
Ingår i: Genome Biology. - : BioMed Central (BMC). - 1465-6906 .- 1474-760X. ; 24
-
Tidskriftsartikel (refereegranskat)abstract
- Analysis of microbial data from archaeological samples is a growing field with great potential for understanding ancient environments, lifestyles, and diseases. However, high error rates have been a challenge in ancient metagenomics, and the availability of computational frameworks that meet the demands of the field is limited. Here, we propose aMeta, an accurate metagenomic profiling workflow for ancient DNA designed to minimize the amount of false discoveries and computer memory requirements. Using simulated data, we benchmark aMeta against a current state-of-the-art workflow and demonstrate its superiority in microbial detection and authentication, as well as substantially lower usage of computer memory.
|
|
| 9. |
- Ronquist, Fredrik, 1962-, et al.
(författare)
-
Universal probabilistic programming offers a powerful approach to statistical phylogenetics
- 2021
-
Ingår i: Communications Biology. - : Springer Science and Business Media LLC. - 2399-3642. ; 4:1
-
Tidskriftsartikel (refereegranskat)abstract
- Statistical phylogenetic analysis currently relies on complex, dedicated software packages, making it difficult for evolutionary biologists to explore new models and inference strategies. Recent years have seen more generic solutions based on probabilistic graphical models, but this formalism can only partly express phylogenetic problems. Here, we show that universal probabilistic programming languages (PPLs) solve the expressivity problem, while still supporting automated generation of efficient inference algorithms. To prove the latter point, we develop automated generation of sequential Monte Carlo (SMC) algorithms for PPL descriptions of arbitrary biological diversification (birth-death) models. SMC is a new inference strategy for these problems, supporting both parameter inference and efficient estimation of Bayes factors that are used in model testing. We take advantage of this in automatically generating SMC algorithms for several recent diversification models that have been difficult or impossible to tackle previously. Finally, applying these algorithms to 40 bird phylogenies, we show that models with slowing diversification, constant turnover and many small shifts generally explain the data best. Our work opens up several related problem domains to PPL approaches, and shows that few hurdles remain before these techniques can be effectively applied to the full range of phylogenetic models.
|
|
| 10. |
- Sousa, Filipe de, 1982, et al.
(författare)
-
Phylogenetic properties of 50 nuclear loci in Medicago (Leguminosae) generated using multiplexed sequence capture and next-generation sequencing
- 2014
-
Ingår i: PLoS ONE. - : Public Library of Science (PLoS). - 1932-6203. ; 9:10
-
Tidskriftsartikel (refereegranskat)abstract
- Next-generation sequencing technology has increased the capacity to generate molecular data for plant biological research, including phylogenetics, and can potentially contribute to resolving complex phylogenetic problems. The evolutionary history of Medicago L. (Leguminosae: Trifoliae) remains unresolved due to incongruence between published phylogenies. Identification of the processes causing this genealogical incongruence is essential for the inference of a correct species phylogeny of the genus and requires that more molecular data, preferably from low-copy nuclear genes, are obtained across different species. Here we report the development of 50 novel LCN markers in Medicago and assess the phylogenetic properties of each marker. We used the genomic resources available for Medicago truncatula Gaertn., hybridisation-based gene enrichment (sequence capture) techniques and Next-Generation Sequencing to generate sequences. This alternative proves to be a cost-effective approach to amplicon sequencing in phylogenetic studies at the genus or tribe level and allows for an increase in number and size of targeted loci. Substitution rate estimates for each of the 50 loci are provided, and an overview of the variation in substitution rates among a large number of low-copy nuclear genes in plants is presented for the first time. Aligned sequences of major species lineages of Medicago and its sister genus are made available and can be used in further probe development for sequence-capture of the same markers.
|
|
