Recombination Histories - PowerPoint PPT Presentation

1 / 15
About This Presentation
Title:

Recombination Histories

Description:

Recombination Histories – PowerPoint PPT presentation

Number of Views:20
Avg rating:3.0/5.0
Slides: 16
Provided by: stati3
Category:

less

Transcript and Presenter's Notes

Title: Recombination Histories


1
Recombination Histories Global Pedigrees
Acknowledgements Yun Song - Rune
Lyngsø - Mike Steel
2
Basic Evolutionary Events
3
Local Inference of Recombinations
4
Hudson Kaplans RM
0 0 0 0 0 1 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 0 0
0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 1 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 1 0 0 1 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 1 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0
1 1 1 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1
1 1 0 1
If you equate RM with expected number of
recombinations, this could be used as an
estimator. Unfortunately, RM is a gross
underestimate of the real number of
recombinations.
5
Minimal Number of Recombinations
The Kreitman data (1983) 11 sequences, 3200bp,
43(28) recoded, 9 different
Bi-partitions
How many neighbors?
6
Metrics on Trees based on subtree transfers.
7
Tree Combinatorics and Neighborhoods
Observe that the size of the unit-neighbourhood
of a tree does not grow nearly as fast as the
number of trees
8
1
4
2
3
5
6
7
9
The Minimal Recombination History for the
Kreitman Data
Methods of rec events obtained
Hudson Kaplan (1985) 5
Myers Griffiths (2003) 6
Song Hein (2004). Set theory based approach. 7
Song Hein (2003). Tree scanning using DP Lyngsø, Song Hein (2006). Massive Acceleration using Branch and Bound Algorithm. Lyngsø, Song Hein (2006). Minimal number of Gene Conversions (in prep.) 7 7 5-2/6-1
10
- recombination 27 ACs
recombination 3108 ACs
11
Ancestral configurations to 2 sequences with 2
segregating sites
12
Counting Branch and Bound Algorithm
13
minARGs Recombination Events Local Trees
14
Reconstructing global pedigrees
Superpedigrees Steel and Hein, 2005
The gender-labeled pedigrees for all pairs,
defines global pedigree
Gender-unlabeled pedigrees doesnt!!
15
Benevolent Mutation and Recombination Process
  • All embedded phylogenies are observable
  • Do they determine the pedigree?

Counter example
Write a Comment
User Comments (0)
About PowerShow.com