Preface |
|
ix | |
|
|
1 | (84) |
|
|
3 | (10) |
|
|
3 | (1) |
|
1.2 Undirected and directed graphs |
|
|
3 | (4) |
|
|
7 | (1) |
|
|
8 | (1) |
|
1.5 Traversals of trees and DAGs |
|
|
9 | (2) |
|
1.6 Taxa, clusters, clades and splits |
|
|
11 | (2) |
|
|
13 | (10) |
|
|
13 | (1) |
|
2.2 Pairwise sequence alignment |
|
|
13 | (7) |
|
2.3 Multiple sequence alignment |
|
|
20 | (3) |
|
|
23 | (45) |
|
|
23 | (1) |
|
|
24 | (3) |
|
3.3 The number of phylogenetic trees |
|
|
27 | (2) |
|
3.4 Models of DNA evolution |
|
|
29 | (3) |
|
3.5 The phylogenetic tree reconstruction problem |
|
|
32 | (1) |
|
3.6 Sequence-based methods |
|
|
33 | (1) |
|
|
33 | (4) |
|
3.8 Branch-swapping methods |
|
|
37 | (3) |
|
3.9 Maximum likelihood estimation |
|
|
40 | (3) |
|
|
43 | (2) |
|
|
45 | (5) |
|
3.12 Distance-based methods |
|
|
50 | (2) |
|
|
52 | (2) |
|
|
54 | (2) |
|
3.15 Balanced minimum evolution |
|
|
56 | (4) |
|
|
60 | (3) |
|
|
63 | (3) |
|
|
66 | (2) |
|
4 Introduction to phylogenetic networks |
|
|
68 | (17) |
|
|
69 | (1) |
|
4.2 What is a phylogenetic network? |
|
|
69 | (2) |
|
4.3 Unrooted phylogenetic networks |
|
|
71 | (5) |
|
4.4 Rooted phylogenetic networks |
|
|
76 | (5) |
|
4.5 The extended Newick format |
|
|
81 | (2) |
|
4.6 Which types of networks are currently used in practice? |
|
|
83 | (2) |
|
|
85 | (100) |
|
5 Splits and unrooted phylogenetic networks |
|
|
87 | (40) |
|
|
87 | (1) |
|
|
88 | (2) |
|
5.3 Compatibility and incompatibility |
|
|
90 | (1) |
|
|
91 | (2) |
|
|
93 | (4) |
|
5.6 The canonical split network |
|
|
97 | (5) |
|
5.7 Circular splits and planar split networks |
|
|
102 | (3) |
|
|
105 | (2) |
|
5.9 The split decomposition |
|
|
107 | (14) |
|
5.10 Representing trees in a split network |
|
|
121 | (1) |
|
5.11 Comparing split networks |
|
|
122 | (1) |
|
|
122 | (5) |
|
6 Clusters and rooted phylogenetic networks |
|
|
127 | (58) |
|
|
127 | (1) |
|
6.2 Clusters, compatibility and incompatibility |
|
|
128 | (4) |
|
|
132 | (1) |
|
|
133 | (5) |
|
6.5 Rooted phylogenetic networks |
|
|
138 | (2) |
|
6.6 The lowest stable ancestor |
|
|
140 | (4) |
|
6.7 Representing trees in rooted networks |
|
|
144 | (2) |
|
6.8 Hardwired and softwired clusters |
|
|
146 | (3) |
|
6.9 Minimum rooted phylogenetic networks |
|
|
149 | (1) |
|
|
150 | (6) |
|
6.11 Topological constraints on rooted networks |
|
|
156 | (12) |
|
6.12 Cluster containment in rooted networks |
|
|
168 | (3) |
|
|
171 | (1) |
|
6.14 Comparing rooted networks |
|
|
171 | (14) |
|
Part III Algorithms and applications |
|
|
185 | (153) |
|
7 Phylogenetic networks from splits |
|
|
187 | (6) |
|
7.1 The convex hull algorithm |
|
|
187 | (3) |
|
7.2 The circular network algorithm |
|
|
190 | (3) |
|
8 Phylogenetic networks from clusters |
|
|
193 | (23) |
|
|
193 | (1) |
|
8.2 Divide-and-conquer using decomposition |
|
|
194 | (4) |
|
|
198 | (3) |
|
|
201 | (9) |
|
|
210 | (6) |
|
9 Phylogenetic networks from sequences |
|
|
216 | (34) |
|
|
216 | (1) |
|
9.2 Binary sequences and splits |
|
|
216 | (2) |
|
|
218 | (1) |
|
|
219 | (4) |
|
9.5 Quasi-median networks |
|
|
223 | (4) |
|
|
227 | (5) |
|
9.7 Pruned quasi-median networks |
|
|
232 | (1) |
|
9.8 Recombination networks |
|
|
233 | (7) |
|
|
240 | (10) |
|
10 Phylogenetic networks from distances |
|
|
250 | (15) |
|
10.1 Distances and splits |
|
|
250 | (1) |
|
10.2 Minimum spanning networks |
|
|
251 | (1) |
|
|
251 | (3) |
|
|
254 | (7) |
|
|
261 | (4) |
|
11 Phylogenetic networks from trees |
|
|
265 | (35) |
|
11.1 Consensus split networks |
|
|
265 | (3) |
|
11.2 Consensus super split networks for unrooted trees |
|
|
268 | (5) |
|
11.3 Distortion-filtered super split networks for unrooted trees |
|
|
273 | (1) |
|
11.4 Consensus cluster networks for rooted trees |
|
|
274 | (1) |
|
11.5 Minimum hybridization networks |
|
|
275 | (10) |
|
11.6 Minimum hybridization networks and galled trees |
|
|
285 | (2) |
|
11.7 Networks from multi-labeled trees |
|
|
287 | (2) |
|
11.8 DLT reconciliation of gene and species trees |
|
|
289 | (11) |
|
12 Phylogenetic networks from triples or quartets |
|
|
300 | (12) |
|
12.1 Trees from rooted triples |
|
|
300 | (2) |
|
12.2 Level-k networks from rooted triples |
|
|
302 | (6) |
|
12.3 The quartet-net method |
|
|
308 | (4) |
|
13 Drawing phylogenetic networks |
|
|
312 | (20) |
|
|
312 | (1) |
|
13.2 Cladograms for rooted phylogenetic trees |
|
|
312 | (4) |
|
13.3 Cladograms for rooted phylogenetic networks |
|
|
316 | (7) |
|
13.4 Phylograms for rooted phylogenetic trees |
|
|
323 | (1) |
|
13.5 Phylograms for rooted phylogenetic networks |
|
|
324 | (3) |
|
13.6 Drawing rooted phylogenetic networks with transfer edges |
|
|
327 | (1) |
|
13.7 Radial diagrams for unrooted trees |
|
|
328 | (1) |
|
13.8 Radial diagrams for split networks |
|
|
329 | (3) |
|
|
332 | (6) |
|
|
332 | (1) |
|
|
333 | (1) |
|
|
334 | (1) |
|
|
334 | (1) |
|
|
335 | (3) |
Glossary |
|
338 | (5) |
References |
|
343 | (15) |
Index |
|
358 | |