Fault-tolerant pedigree reconstruction from pairwise kinship relations
Huang, E. C.; Li, K. A.; Narasimhan, V. M.
Show abstract
Pedigrees reconstructed from biologically related ancient genomes have revealed many insights into (pre)history. To our knowledge, all reported ancient pedigrees have been manually reconstructed, as existing pedigree reconstruction methods are ill-suited for the quality and nature of ancient DNA data. Here, we introduce repare, an open-source software method to automatically reconstruct pedigrees from inferred pairwise kinship relations, which are readily obtainable from ancient genomes. This method reconstructs pedigrees by iteratively incorporating pairwise kinship relations into a set of candidate pedigrees, with pruning and sampling to reduce its search space. It optionally considers supporting information such as haplogroups and skeletal age-at-death estimates. We evaluate this method on a variety of simulated pedigrees with varying error rates and missingness. We also use this method to reconstruct several published pedigrees that were originally manually reconstructed; for one, we present a potential alternative topology. repare optionally incorporates user-inferred pedigree constraints, enabling "human-in-the-loop" reconstruction workflows. Especially when used with these user-inferred constraints, we find that repare represents a powerful and flexible tool for ancient pedigree reconstruction.
Matching journals
The top 6 journals account for 50% of the predicted probability mass.
Similar papers in this journal
Similar papers in this journal
- Fast and accurate estimation of selection coefficients and allele histories from ancient and modern DNA 94%
- soibean: High-resolution Taxonomic Identification of Ancient Environmental DNA Using Mitochondrial Pangenome Graphs 93%
- Read Length Dominates Phylogenetic Placement Accuracy of Ancient DNA Reads 92%
Similar papers in this journal
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.