Rapidly Registering Identity-by-Descent Across Ancestral Recombination Graphs

Conference paper

DOI: 10.1007/978-3-319-16706-0_35

Volume 9029 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Yang S., Carmi S., Pe’er I. (2015) Rapidly Registering Identity-by-Descent Across Ancestral Recombination Graphs. In: Przytycka T. (eds) Research in Computational Molecular Biology. RECOMB 2015. Lecture Notes in Computer Science, vol 9029. Springer, Cham

Abstract

The genomes of remotely related individuals occasionally contain long segments that are Identical By Descent (IBD). Sharing of IBD segments has many applications in population and medical genetics, and it is thus desirable to study their properties in simulations. However, no current method provides a direct, efficient means to extract IBD segments from simulated genealogies. Here, we introduce computationally efficient approaches to extract ground-truth IBD segments from a sequence of genealogies, or equivalently, an ancestral recombination graph. Specifically, we use a two-step scheme, where we first identify putative shared segments by comparing the common ancestors of all pairs of individuals at some distance apart. This reduces the search space considerably, and we then proceed by determining the true IBD status of the candidate segments. Under some assumptions and when allowing a limited resolution of segment lengths, our run-time complexity is reduced from \(O(n^3\log n)\) for the naïve algorithm to \(O(n\log n)\), where \(n\) is the number of individuals in the sample.

Keywords

Identity by Descent Ancestral Recombination Graphs Population Genetics Simulation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceColumbia UniversityNew YorkUSA
  2. 2.Department of Systems BiologyColumbia UniversityNew YorkUSA