Thesis (Ph. D.)--University of Adelaide, Dept. of Paediatrics, 1989. / Includes bibliographical references (leaves 98-136).

Diss. (sammanfattning) Umeå : Umeå universitet, 2005. / Härtill 6 uppsatser.

Thesis (Ed.D.)--Duquesne University, 2009. / Title from document title page. Abstract included in electronic submission form. Includes bibliographical references (p. 164-175) and index.

No description available.

As a large number of single nucleotide polymorphisms (SNPs) and microsatellite markers are available, high resolution mapping employing multiple markers or multiple allele markers is an important step to identify quantitative trait locus (QTL) of complex human disease. For many complex diseases, quantitative phenotype values contain more information than dichotomous traits do. Much research has been done on conducting high resolution mapping using information of linkage and linkage disequilibrium. The most commonly employed approaches for mapping QTL are pedigree-based linkage analysis and population-based association analysis. As one of the methods dealing with multiple alleles markers, mixed models are developed to work out family-based association study with the information of transmitted allele and nontransmitted allele from one parent to offspring. For multiple markers, variance component models are proposed to perform association study and linkage analysis simultaneously. Linkage analysis provides suggestive linkage based on a broad chromosome region and is robust to population admixtures. One the other hand, allelic association due to linkage disequilibrium (LD) usually operates over very short genetic distance, but is affected by population stratification. Combining both approaches plays a synergistic role in overcoming their limitations and in increasing the efficiency and effectiveness of gene mapping.

Historians and social scientists are very interested in longitudinal data created from historical sources as the longitudinal data creates opportunities for studying people’s lives over time. However, its generation is a challenging problem since historical sources do not have personal identifiers. At the University of Guelph, the People-in-Motion group have currently constructed a record linkage system to link the 1871 Canadian census to the 1881 Canadian census. In this thesis, we discuss one aspect of linking historical census data, the problem of disambiguating multiple links that are created at the linkage step. We show that the disambiguating techniques explored in this thesis improve upon the linkage rate of the People-in-Motion’s system, while maintaining a false positive rate no greater than 5%.

Dans ce travail, nous considérons le problème suivant : étant donné un graphe orienté D, contient-il une subdivision d’un digraphe fixé F ? Nous pensons qu’il existe une dichotomie entre les instances polynomiales et NP-complètes. Nous donnons plusieurs exemples pour les deux cas. En particulier, sauf pour cinq instances, nous sommes capable de classer tous les digraphes d’ordre 4. Alors que toutes les preuves NP-complétude sont faites par réduction de une version du problème 2-linkage en digraphes, nous utilisons différents outils algorithmiques pour prouver la solvabilité en temps polynomial de certains cas, certains d’entre eux impliquant des algorithmes relativement complexes. Les techniques varient des simples algorithmes de force brute, aux algorithmes basés sur des calculs maximale de flot, et aux décompositions en anses des digraphes fortement connexes, entre autres. Pour terminer, nous traitons le cas particulier où F étant une union disjointe de cycles dirigés. En particulier, nous montrons que les cycles dirigés de longueur au moins 3 possède la Propriété d’Erdos-Pósa : pour tout n, il existe un entier tn tel que pour tout digraphe D, soit D a n cycles dirigés disjoints de longueur au moins 3, soit il y a un ensemble T d’au plus tn sommets qui intersecte tous les cycles dirigés de longueur au moins 3. De ce résultat, nous déduisons que si F est l’union disjointe de cycles dirigés de longueur au plus 3, alors on peut décider en temps polynomial si un digraphe contient une subdivision de F. / In this work, we consider the following problem: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? We believe that there is a dichotomy between NP-complete and polynomial-time solvable instances of this problem. We present many examples of both cases. In particular, except for five instances, we are able to classify all the digraphs F of order 4.While all NP-hardness proofs are made by reduction from some version of the 2-linkage problem in digraphs, we use different algorithmic tools for proving polynomial-time solvability of certain instances, some of them involving relatively complicated algorithms. The techniques vary from easy brute force algorithms, algorithms based on maximum-flow calculations, handle decompositions of strongly connected digraphs, among others. Finally, we treat the very special case of F being the disjoint union of directed cycles. In particular, we show that the directed cycles of length at least 3 have the Erdos-Pósa Property: for every n, there exists an integer tn such that for every digraph D, either D contains n disjoint directed cycles of length at least 3, or there is a set T of tn vertices that meets every directed cycle of length at least 3. From this result, we deduce that if F is the disjoint union of directed cycles of length at most 3, then one can decide in polynomial time if a digraph contains a subdivision of F.

The inheritance and linkage of chlorina (ch2), virescens (vi4), and a plantain leaf character (PI2PI3) in sugarbeets were studied. Chlorina acted as a simple recessive which confirmed work reported previously. Chlorinas from two sources were found to be identical. Virescens and plantain leaf were found to be different from those reported in the literature. Virescens acted as a simple recessive. Male sterility in the virescent material was of the a1 mendelian type. Plantain leaf exhibited intermediate inheritance and was found to be controlled by the action of two dominant complementary factors. Linkage tests showed vi4 and ch2 to be independent of each other, the a1 gene for male sterility, and genes in the Y-R-B group. One of the plantain leaf loci, PI2, showed independence of the R gene.

Thesis (Ph. D.)--University of Chicago, Department of Statistics, 2001. / Includes bibliographical references. Also available on the Internet.

Thesis (Ph. D.)--University of Chicago, Dept. of Statistics, June 1999. / Includes bibliographical references. Also available on the Internet.