Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Genetics--Computer programs"”.

  1. Computational Methods for Population Genetic Inference Using Identity by Descent and Local Ancestry

    Identity by descent (IBD) and local ancestry are essential for population genetic inference, such as understanding genealogical relationships and demographic history through genomic data. With the availability of large and high-resolution datasets, new opportunities and computational challenges are …

    ucf Repository record for Computational Methods for Population Genetic Inference Using Identity by Descent and Local Ancestry (opens in a new tab)

  2. PBWT-based Methods for Biobank-Scale Haplotype Data Analysis

    Haplotype matching is the task of finding identical matching segments given a group of aligned genetic sequences. Haplotype matches play an important role as they represent biological phenomena. Long haplotype matching segments could indicate identity-by-descent segments showing some degree of …

    ucf Repository record for PBWT-based Methods for Biobank-Scale Haplotype Data Analysis (opens in a new tab)

  3. Algorithms And Benchmarking For Parallel Identity-By-Descent Segment Detection

    As genomic biobank initiatives continue to grow, the availability of large-scale genotype datasets, encompassing hundreds of thousands to millions of individuals, has transformed genetic research and biomedical discovery. However, the sheer volume of this data presents major computational barriers. …

    ucf Repository record for Algorithms And Benchmarking For Parallel Identity-By-Descent Segment Detection (opens in a new tab)

  4. Algorithms and Variations on the Positional Burrows-Wheeler Transform and Their Applications

    In this dissertation, we develop algorithms and variations on the Positional Burrows-Wheeler Transform (PBWT). The PBWT is a data structure that stores M binary strings of length N while allowing efficient search. We develop the dynamic-PBWT (d-PBWT). The d-PBWT is a variation of the PBWT that …

    ucf Repository record for Algorithms and Variations on the Positional Burrows-Wheeler Transform and Their Applications (opens in a new tab)