A Collinearity-Incorporating Homology Inference Strategy for Connecting Emerging Assemblies in the Triticeae Tribe as a Pilot Practice in the Plant Pangenomic Era

2020 ◽  
Vol 13 (12) ◽  
pp. 1694-1708 ◽  
Author(s):  
Yongming Chen ◽  
Wanjun Song ◽  
Xiaoming Xie ◽  
Zihao Wang ◽  
Panfeng Guan ◽  
...  
Author(s):  
Benjamin E. Hilbig ◽  
Rüdiger F. Pohl

The recognition heuristic is hypothesized to be a frugal inference strategy assuming that inferences are based on the recognition cue alone. This assumption, however, has been questioned by existing research. At the same time most studies rely on the proportion of choices consistent with the heuristic as a measure of its use which may not be fully appropriate. In this study, we propose an index to identify true users of the heuristic contrasting them to decision makers who incorporate further knowledge beyond recognition. The properties and the applicability of the proposed index are investigated in the reanalyses of four published experiments and corroborated by a new study drawn up to rectify the shortcomings of the reanalyzed experiments. Applying the proposed index to explore the influence of knowledge we found that participants who were more knowledgeable made use of the information available to them and achieved the highest proportion of correct inferences.


2021 ◽  
Vol 22 (1) ◽  
Author(s):  
The Tien Mai ◽  
Paul Turner ◽  
Jukka Corander

Abstract Background Heritability is a central measure in genetics quantifying how much of the variability observed in a trait is attributable to genetic differences. Existing methods for estimating heritability are most often based on random-effect models, typically for computational reasons. The alternative of using a fixed-effect model has received much more limited attention in the literature. Results In this paper, we propose a generic strategy for heritability inference, termed as “boosting heritability”, by combining the advantageous features of different recent methods to produce an estimate of the heritability with a high-dimensional linear model. Boosting heritability uses in particular a multiple sample splitting strategy which leads in general to a stable and accurate estimate. We use both simulated data and real antibiotic resistance data from a major human pathogen, Sptreptococcus pneumoniae, to demonstrate the attractive features of our inference strategy. Conclusions Boosting is shown to offer a reliable and practically useful tool for inference about heritability.


2021 ◽  
Author(s):  
The Tien Mai ◽  
Paul Turner ◽  
Jukka Corander

Abstract Background: Heritability is a central measure in genetics quantifying how much of the variability observed in a trait is attributable to genetic differences. Existing methods for estimating heritability are most often based on random-effect models, typically for computational reasons. The alternative of using a fixed-effect model has received much more limited attention in the literature. Results: In this paper, we propose a generic strategy for heritability inference, termed as boosting heritability, by combining several advantageous features of different recent methods to produce an estimate of the heritability with a high-dimensional linear model. Boosting heritability uses in particular a multiple sample splitting strategy which leads to a more reliable estimate. We use both simulated data and real antibiotic resistance data from a major human pathogen, Sptreptococcus pneumoniae, to demonstrate the attractive features of our inference strategy. Conclusions: Compared with other methods, boosting heritability yields a more reliable estimate and allows one to make inference about heritability.


2015 ◽  
Vol 16 (1) ◽  
Author(s):  
Theodore R. Gibbons ◽  
Stephen M. Mount ◽  
Endymion D. Cooper ◽  
Charles F. Delwiche

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
Daniel Hornburg ◽  
Tobias Kruse ◽  
Florian Anderl ◽  
Christina Daschkin ◽  
Raphaela P. Semper ◽  
...  

AbstractVaccination is the most effective method to prevent infectious diseases. However, approaches to identify novel vaccine candidates are commonly laborious and protracted. While surface proteins are suitable vaccine candidates and can elicit antibacterial antibody responses, systematic approaches to define surfomes from gram-negatives have rarely been successful. Here we developed a combined discovery-driven mass spectrometry and computational strategy to identify bacterial vaccine candidates and validate their immunogenicity using a highly prevalent gram-negative pathogen, Helicobacter pylori, as a model organism. We efficiently isolated surface antigens by enzymatic cleavage, with a design of experiment based strategy to experimentally dissect cell surface-exposed from cytosolic proteins. From a total of 1,153 quantified bacterial proteins, we thereby identified 72 surface exposed antigens and further prioritized candidates by computational homology inference within and across species. We next tested candidate-specific immune responses. All candidates were recognized in sera from infected patients, and readily induced antibody responses after vaccination of mice. The candidate jhp_0775 induced specific B and T cell responses and significantly reduced colonization levels in mouse therapeutic vaccination studies. In infected humans, we further show that jhp_0775 is immunogenic and activates IFNγ secretion from peripheral CD4+ and CD8+ T cells. Our strategy provides a generic preclinical screening, selection and validation process for novel vaccine candidates against gram-negative bacteria, which could be employed to other gram-negative pathogens.


2016 ◽  
Vol 8 (1) ◽  
pp. 41-62
Author(s):  
Imre Kilián

Abstract The backward-chaining inference strategy of Prolog is inefficient for a number of problems. The article proposes Contralog: a Prolog-conform, forward-chaining language and an inference engine that is implemented as a preprocessor-compiler to Prolog. The target model is Prolog, which ensures mutual switching from Contralog to Prolog and back. The Contralog compiler is implemented using Prolog's de facto standardized macro expansion capability. The article goes into details regarding the target model. We introduce first a simple application example for Contralog. Then the next section shows how a recursive definition of some problems is executed by their Contralog definition automatically in a dynamic programming way. Two examples, the well-known matrix chain multiplication problem and the Warshall algorithm are shown here. After this, the inferential target model of Prolog/Contralog programs is introduced, and the possibility for implementing the ReALIS natural language parsing technology is described relying heavily on Contralog's forward chaining inference engine. Finally the article also discusses some practical questions of Contralog program development.


Sign in / Sign up

Export Citation Format

Share Document