SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Ronquist Fredrik 1962 ) srt2:(2022)"

Sökning: WFRF:(Ronquist Fredrik 1962 ) > (2022)

  • Resultat 1-4 av 4
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Gobbo, Erik, 1990- (författare)
  • Gall induction in gall wasps (Cynipidae s. lat.) : Insights from comparative genomics
  • 2022
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Cynipidae are a family of wasps (Hymenoptera), whose larval stages develop inside plant galls, that is, abnormal plant structures formed in response to the presence of foreign organisms. Most cynipids are gall inducers and are often capable of notable levels of host manipulation. Others are inquilines, meaning they are dependent on other species for the initiation of the gall. Their larvae then develop inside the gall, often killing the original inducer and modifying the gall in the process. The biochemical mechanism of gall induction is still shrouded in mystery. In this thesis, various approaches are implemented to try to shed some light on the process. In Paper I, we used shotgun sequencing to investigate the bacterial association of larvae of different species inhabiting the bedeguar gall on roses, and showed that neither the inquiline nor the gall inducer inhabiting this gall are associated with symbiotic bacteria that are likely to be involved in gall induction, despite earlier speculations to that effect. In Paper II, I used comparative genomic analysis of a recently evolved gall inducer in the genus Synergus and three related inquilines to identify candidate genes involved in gall initiation.  Specifically, I used a new method relying on genome-wide analyses to control for confounding factors, implemented in the software Bayescode. Then, I used Gene Onthology (GO) analysis to show that the candidate genes are associated with specific functions, such as “egg follicle development” and “neural development”. In paper III, we used genomic and transcriptomic data to infer the phylogeny of the family. The analysis confirmed that the phytophagous Cynipidae fall into two distinct lineages, as suggested by a recent phylogenomic analysis based on ultraconserved elements. We propose that these families be recognized as Cynipidae s. str. (oak gallers and relatives) and Diplolepididae (rose gallers and relatives). Finally, in paper IV, I applied the same methods as in Paper II to genomes of the Cynipidae s. str. to identify candidate genes associated with gall secondary structures. I inferred that these genes are often associated with GO terms relative to egg development and cell movement. In conclusion, the data presented here can provide a useful starting point for future research on cynipids.
  •  
2.
  • Hartop, Emily, 1983-, et al. (författare)
  • Towards Large-Scale Integrative Taxonomy (LIT) : Resolving the Data Conundrum for Dark Taxa
  • 2022
  • Ingår i: Systematic Biology. - : Oxford University Press (OUP). - 1063-5157 .- 1076-836X. ; 71:6, s. 1404-1422
  • Tidskriftsartikel (refereegranskat)abstract
    • New, rapid, accurate, scalable, and cost-effective species discovery and delimitation methods are needed for tackling “dark taxa,” here defined as groups for which <<10%% of all species are described and the estimated diversity exceeds 1,000 species. Species delimitation for these taxa should be based on multiple data sources (“integrative taxonomy”) but collecting multiple types of data risks impeding a discovery process that is already too slow. We here develop large-scale integrative taxonomy (LIT), an explicit method where preliminary species hypotheses are generated based on inexpensive data that can be obtained quickly and cost-effectively. These hypotheses are then evaluated based on a more expensive type of “validation data” that is only obtained for specimens selected based on objective criteria applied to the preliminary species hypotheses. We here use this approach to sort 18,000 scuttle flies (Diptera: Phoridae) into 315 preliminary species hypotheses based on next-generation sequencing barcode (313 bp) clusters (using objective clustering [OC] with a 3%% threshold). These clusters are then evaluated with morphology as the validation data. We develop quantitative indicators for predicting which barcode clusters are likely to be incongruent with morphospecies by randomly selecting 100 clusters for in-depth validation with morphology. A linear model demonstrates that the best predictors for incongruence between barcode clusters and morphology are maximum p-distance within the cluster and a newly proposed index that measures cluster stability across different clustering thresholds. A test of these indicators using the 215 remaining clusters reveals that these predictors correctly identify all clusters that are incongruent with morphology. In our study, all morphospecies are true or disjoint subsets of the initial barcode clusters so that all incongruence can be eliminated by varying clustering thresholds. This leads to a discussion of when a third data source is needed to resolve incongruent grouping statements. The morphological validation step in our study involved 1,039 specimens (5.8%% of the total). The formal LIT protocol we propose would only have required the study of 915 (5.1%%⁠: 2.5 specimens per species), as we show that clusters without signatures of incongruence can be validated by only studying two specimens representing the most divergent haplotypes. To test the generality of our results across different barcode clustering techniques, we establish that the levels of incongruence are similar across OC, Automatic Barcode Gap Discovery (ABGD), Poisson Tree Processes (PTP), and Refined Single Linkage (RESL) (used by Barcode of Life Data System to assign Barcode Index Numbers [BINs]). OC and ABGD achieved a maximum congruence score with the morphology of 89%% while PTP was slightly less effective (84%%⁠). RESL could only be tested for a subset of the specimens because the algorithm is not public. BINs based on 277 of the original 1,714 haplotypes were 86%% congruent with morphology while the values were 89%% for OC, 74%% for PTP, and 72%% for ABGD.
  •  
3.
  • 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. 
  •  
4.
  • Marquina, Daniel, 1989-, et al. (författare)
  • Evaluation of non-destructive DNA extraction protocols for insect metabarcoding : gentler and shorter is better
  • 2022
  • Ingår i: Metabarcoding and Metagenomics. - : Pensoft Publishers. - 2534-9708. ; 6, s. 187-201
  • Tidskriftsartikel (refereegranskat)abstract
    • DNA metabarcoding can accelerate research on insect diversity, as it is cheap and fast compared to manual sorting and identification. Most metabarcoding protocols require homogenisation of the sample, preventing further work on the specimens. Mild digestion of the tissue by incubation in a lysis buffer has been proposed as an alternative, and, although some mild lysis protocols have already been presented, they have so far not been evaluated against each other. Here, we analyse how two mild lysis buffers (one more aggressive, one gentler in terms of tissue degradation), two different incubation times, and two DNA purification methods (a manual precipitation and an automated protocol) affect the accuracy of retrieving the true composition of mock communities using two mitochondrial markers (COI and 16S). We found that protocol-specific variation in concentration and purity of the DNA extracts produced had little effect on the recovery of species. However, the two lysis treatments differed in quantification of species abundances. Digestion in the gentler buffer and for a shorter time yielded better representation of original sample composition. Digestion in a more aggressive buffer or longer incubation time yielded lower alpha diversity values and increased differences between metabarcoding results and the true species-abundance distribution. We conclude that the details of non-destructive protocols can have a significant effect on metabarcoding performance. A short and mild lysis treatment appears the best choice for recovering the true composition of the sample. This not only improves accuracy, but also comes with a faster processing time than the other treatments.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-4 av 4

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy