Related Experiment Video
Updated: Jun 8, 2026

Following the Dynamics of Structural Variants in Experimentally Evolved Populations
Published on: February 3, 2023
A near-linear time algorithm for haplotype determination on general pedigrees
Duong D Doan1, Patricia A Evans, Joseph D Horton
1Faculty of Computer Science, University of New Brunswick, Fredericton, Canada. b89ct@unb.ca
Abstract:
Abstract An O(nmα(m)) time algorithm is given for inferring haplotypes from genotypes of non-recombinant pedigree data, where n is the number of members, m is the number of sites, and α(m) is the inverse of the Ackermann function. The algorithm works on both tree and general pedigree structures with cycles. Constraints between pairs of heterozygous sites are used to resolve unresolved sites for the pedigree, enabling the algorithm to avoid problems previously experienced for non-tree pedigrees.
Related Concept Videos
Pedigree Analysis
Pedigree Analysis
Evolutionary Relationships through Genome Comparisons
Genome-wide Association Studies-GWAS
GWAS does not require the identification of the target gene involved in...
Hardy-Weinberg Principle
Gene Evolution - Fast or Slow?
In contrast, regions which code...
