The calculation of probabilities on pedigrees of arbitrary complexity is discussed for a basic model of transmission and penetrance (encompassing Mendelian inheritance, and certain environmental influences). The structure of pedigrees, and the types of loops occurring, is discussed. Some results in graph theory are obtained and, using these, a recurrence relation derived for certain probabilities. The recursive procedure enables the successive peeling off of certain members of the pedigree, and the condensation of the information on those individuals into a function on a subset of those remaining. The underlying theory is set out, and examples given of the utilization of the resulting algorithm.
Background on genetic algorithms, LISP, and genetic programming hierarchical problem-solving introduction to automatically-defined functions - the two-boxes problem problems tha...
ABSTRACT Genome‐wide association studies, which typically report regression coefficients summarizing the associations of many genetic variants with various traits, are potential...
Summary In the analysis of data it is often assumed that observations y 1, y 2, …, yn are independently normally distributed with constant variance and with expectations specifi...
Horizontal pleiotropy occurs when the variant has an effect on disease outside of its effect on the exposure in Mendelian randomization (MR). Violation of the ‘no horizontal ple...
It is argued that underlying the Church–Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every f...
Social media, news, blog, policy document mentions