-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmain_non_exec_getsubtree.py
More file actions
132 lines (94 loc) · 5.31 KB
/
Copy pathmain_non_exec_getsubtree.py
File metadata and controls
132 lines (94 loc) · 5.31 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
# BSD 3-Clause License
# Copyright (c) 2025, Jonathan David Duke
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# 1. Redistributions of source code must retain the above copyright notice, this
# list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
# 3. Neither the name of the copyright holder nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
import sys
import numpy as np
from dated_complete_tree import tree_loading
from dated_complete_tree import tree_labelling
from dated_complete_tree import tree_fixing
from dated_complete_tree import tree_dating
from dated_complete_tree import tree_metrics
import logging
logger = logging.getLogger(__name__)
logging.basicConfig(filename="main.log", filemode="w", force=True, level=logging.DEBUG)
sys.setrecursionlimit(10000)
#####################################################################################################################
# Load and prune tree
# Load metadata for tree from Open Tree and Chronosynth
dates, phylogeny_nodes, taxa = tree_loading.load_metadata()
# Create ete4 tree structure for entire Open Tree of Life, with my annotations
whole_tre_unmodified = tree_loading.build_and_annotate_tree(phylogeny_nodes, taxa)
tree_fixing.strip_birds(whole_tre_unmodified)
tree_fixing.strip_turtles(whole_tre_unmodified)
rng = np.random.default_rng(seed=1)
tree_fixing.remove_subspecies(whole_tre_unmodified, rng)
tree_fixing.impute_species_into_empty_taxa(whole_tre_unmodified)
tree_fixing.fix_taxonomy_ordering(whole_tre_unmodified)
tree_labelling.add_anc_ranks(whole_tre_unmodified)
tree_labelling.add_desc_ranks(whole_tre_unmodified)
tree_fixing.forced_taxa_moves(whole_tre_unmodified)
# Copy tree - we will change the copy, and keep the original unchanged so we can restore it next iteration without
# reloading everything
whole_tre = whole_tre_unmodified.copy()
#####################################################################################################################
# Fix topology
# First, do labelling for steps 1-3:
# - 1-2 are independent of each other; step 3 collects up nodes not labelled in 1-2.
# - tree is only labelled at this stage; modifications are made in tree_fixing functions.
genus_dict = {} # step 1, nodes below genus nodes
nmp_genus_dict = {} # step 2, non-monophyletic genera
tree_labelling.populate_genus_dict(whole_tre, genus_dict, nmp_genus_dict, None)
tofix_dict = {} # step 3, all other nodes from taxonomy (not phylogenies) to
# be moved to a suitable place in the tree, such that we
# generated a plausible hypothetical tree
tree_labelling.populate_tofix_dict(whole_tre, tofix_dict, nmp_genus_dict)
# Second, fix the topology based on the labels.
# Fix steps 1 and 2.
tree_fixing.fix_polyphyly(genus_dict, rng)
tree_fixing.fix_polyphyly(nmp_genus_dict, rng)
tree_fixing.remove_nonspecies_leaves(whole_tre)
# Find and label backbone for step 3, after steps 1 an 2 already fixed.
tree_labelling.populate_tofix_bkb(whole_tre, tofix_dict, [])
fix_dict = tree_labelling.process_tofix_bkb(tofix_dict)
# Finally, fix step 3.
tree_fixing.fix_polyphyly(fix_dict, rng, expand_parent_backbones=True)
tree_fixing.remove_nonspecies_leaves(whole_tre)
# Last of all, polytomy resolution.
tree_fixing.fix_all_polytomies(whole_tre, rng)
# Remove one-child nodes. Gives a fully bifurcating tree.
whole_tre = tree_fixing.delete_one_child_nodes(whole_tre)
#####################################################################################################################
# Assign and interpolate dates
# Assign dates
tree_dating.assign_dates(whole_tre, dates)
# Date cleaning to ensure time consistency down the tree
tree_dating.dq_date_removal(whole_tre)
# Date imputation
tree_dating.date_labelling(whole_tre)
dating_rng = np.random.default_rng(seed=100)
tree_dating.impute_missing_dates(whole_tre, l=0.25, rng=dating_rng)
tree_dating.compute_branch_lengths(whole_tre)
tree_metrics.compute_pd(whole_tre)
whole_tre.prune(['Gorilla_gorilla_ott417965',
'Phyllachora_piptocarphae_ott3705888',
'Acer_elegantulum_ott1059370',
'Candidatus_Carsonella_ruddii_ott4790644'], preserve_branch_length=True)