Drawing Tree-Based Phylogenetic Networks with Minimum Number of - PowerPoint PPT Presentation

1 Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings Jonathan Klawitter · Peter Stumpf GD 2020

2 - 1 Phylogenetic networks T 1 2 3 4 5

2 - 2 Phylogenetic networks T N 1 2 3 4 5 1 2 3 4 5

2 - 3 Phylogenetic networks T N N 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5

2 - 4 Phylogenetic networks T N T ′ N 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5

3 - 1 Kumar et al. “The evolutionary history of bears is characterized by gene flow across species”

3 - 2 Kumar et al. “The evolutionary history of bears is Richards et al. “Phylogenomic Analysis Demonstrates a characterized by gene flow across species” Pattern of Rare and Ancient Horizontal Gene Transfer between Plants and Fungi”

3 - 3 Kumar et al. “The evolutionary history of bears is Richards et al. “Phylogenomic Analysis Demonstrates a characterized by gene flow across species” Pattern of Rare and Ancient Horizontal Gene Transfer between Plants and Fungi” Vaughan et al. “Inferring Ancestral Recombination Graphs from Bacterial Genomic Data”

4 - 1 Drawing styles

4 - 2 Drawing styles

4 - 3 Drawing styles

4 - 4 Drawing styles

4 - 5 Drawing styles

4 - 6 Drawing styles snake style

4 - 7 Drawing styles snake style

4 - 8 Drawing styles snake style ear style

4 - 9 Drawing styles snake style ear style horizontal style

4 - 10 Drawing styles snake style ear style horizontal style

4 - 11 Drawing styles snake style ear style horizontal style

5 - 1 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal ear-style drawing of N can be computed in O ( nk ) time.

5 - 2 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal ear-style drawing of N can be computed in O ( nk ) time.

5 - 3 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal ear-style drawing of N can be computed in O ( nk ) time.

5 - 4 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal ear-style drawing of N can be computed in O ( nk ) time.

5 - 5 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal ear-style drawing of N can be computed in O ( nk ) time.

5 - 6 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal ear-style drawing of N can be computed in O ( nk ) time.

6 - 1 Ear-style algorithm

6 - 2 Ear-style algorithm 0 0 0 0 0 0 0 0

6 - 3 Ear-style algorithm 0 0 0 0 0 0 0 0

6 - 4 Ear-style algorithm 0 0 0 0 0 0 0 0

6 - 5 Ear-style algorithm 0 0 0 0 0 0 0 1

6 - 6 Ear-style algorithm 2 0 0 2 0 0 0 1

6 - 7 Ear-style algorithm 2 3 0 0 2 0 1 1

6 - 8 Ear-style algorithm 2 3 0 0 2 0 1 1

6 - 9 Ear-style algorithm 3 3 0 1 2 1

6 - 10 Ear-style algorithm 3 3 0 1 2 1

6 - 11 Ear-style algorithm 3 3 1 0 2 1

6 - 12 Ear-style algorithm 3 3 2 1

6 - 13 Ear-style algorithm 3 3 2 1

6 - 14 Ear-style algorithm 3 4

6 - 15 Ear-style algorithm 3 4

6 - 16 Ear-style algorithm 4 3

6 - 17 Ear-style algorithm

7 - 1 The Crossing Minimisation problem for horizontal-style drawings of tree-based networks is NP-complete.

7 - 2 The Crossing Minimisation problem for horizontal-style drawings of tree-based networks is NP-complete. G MaxCut

8 - 1 Horizontal style NP-reduction G u e g w v f

8 - 2 Horizontal style NP-reduction v e u e e ′ N e G u e g w v f

8 - 3 Horizontal style NP-reduction w g v e u g u e e ′ g ′ N e N g G u e g w v f

8 - 4 Horizontal style NP-reduction w g w f v f v e u g u e e ′ g ′ f ′ N e N g N f G u e g w v f

8 - 5 Horizontal style NP-reduction w g w f v f v e u g u e e ′ g ′ f ′ N e N g N f G u e g w v f

8 - 6 Horizontal style NP-reduction w g w f v f v e u g u g u e u e e ′ g ′ f ′ N e N g N f G u e g w v f

8 - 7 Horizontal style NP-reduction u ⋆ w g w f v f v e u g u g u e u e e ′ g ′ f ′ N e N g N f G u e g w v f

8 - 8 Horizontal style NP-reduction u ⋆ w g w f v f v e u g u g u e u e e ′ g ′ f ′ N e N g N f G u e g w v f

8 - 9 Horizontal style NP-reduction u ⋆ w g w f v f v e u g u g u e u e e ′ g ′ f ′ N e N g N f G u e g w v f

8 - 10 Horizontal style NP-reduction G u e g w v f

8 - 11 Horizontal style NP-reduction G u e g w v f

8 - 12 Horizontal style NP-reduction G u e g w v f

8 - 13 Horizontal style NP-reduction G u e g w v f

8 - 14 Horizontal style NP-reduction G u e g w v f

8 - 15 Horizontal style NP-reduction G u e g w v f

9 - 1 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal snake-style drawing of N can be computed in O ( 2 k nk ) time.

9 - 2 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal snake-style drawing of N can be computed in O ( 2 k nk ) time.

9 - 3 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal snake-style drawing of N can be computed in O ( 2 k nk ) time.

10 Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal ear-style drawing of N can be computed in O ( nk ) time. The Crossing Minimisation problem for horizontal-style drawings of tree-based networks is NP-complete. Let N be a tree-based network on n leaves and k reticulation edges . A crossing-minimal snake-style drawing of N can be computed in O ( 2 k nk ) time.