Dan Gusfield UC Davis

2. Optimal Phylogenetic Networks with Constrained and Unconstrained Recombination(The root-unknown case) Dan Gusfield UC Davis

3. Reconstructing the Evolution of Binary Bio-Sequences • Perfect Phylogeny (tree) model • Phylogenetic Networks (DAG) with recombination • Phylogenetic Networks with disjoint cycles: Galled-Trees • Phylogenetic Networks with unconstrained cycles: Blobbed-Trees • Combinatorial Structure and Efficient Algorithms

4. Geneological or Phylogenetic Networks • The major biological motivation comes from genetics and attempts to reconstruct the history of recombination in populations. • Also relates to phylogenetic-based haplotyping. • The algorithmic and mathematical results also have phylogenetic applications, for example in lateral gene transfer.

5. The Perfect Phylogeny Model for binary sequences sites 12345 Ancestral sequence 00000 1 4 Site mutations on edges 3 00010 The tree derives the set M: 10100 10000 01011 01010 00010 2 10100 5 10000 01010 01011 Extant sequences at the leaves

6. When can a set of sequences be derived on a perfect phylogenywith the all-0 root? Classic NASC: Arrange the sequences in a matrix. Then (with no duplicate columns), the sequences can be generated on a unique perfect phylogeny if and only if no two columns (sites) contain all four pairs: 0,0 and 0,1 and 1,0 and 1,1 This is the 4-Gamete Test

7. A richer model 10100 10000 01011 01010 00010 10101 added 12345 00000 1 4 3 00010 2 10100 5 pair 4, 5 fails the three gamete-test. The sites 4, 5 ``conflict”. 10000 01010 01011 Real sequence histories often involve recombination.

8. Sequence Recombination 01011 10100 S P 5 Single crossover recombination 10101 A recombination of P and S at recombination point 5. The first 4 sites come from P (Prefix) and the sites from 5 onward come from S (Suffix).

9. Network with Recombination 10100 10000 01011 01010 00010 10101 new 12345 00000 1 4 3 00010 2 10100 5 P 10000 01010 The previous tree with one recombination event now derives all the sequences. 01011 5 S 10101

10. Multiple Crossover Recombination 4-crossovers 2-crossovers = ``gene conversion”

11. Elements of a Phylogenetic Network (single crossover recombination) • Directed acyclic graph. • Integers from 1 to m written on the edges. Each integer written only once. These represent mutations. • A choice of ancestral sequence at the root. • Every non-root node is labeled by a sequence obtained from its parent(s) and any edge label on the edge into it. • A node with two edges into it is a ``recombination node”, with a recombination point r. One parent is P and one is S. • The network derives the sequences that label the leaves.

12. A Phylogenetic Network 00000 4 00010 a:00010 3 1 10010 00100 5 00101 2 01100 S b:10010 P S 4 01101 c:00100 p g:00101 3 d:10100 f:01101 e:01100

13. Which Phylogenetic Networks are meaningful? Given M we want a phylogenetic network that derives M, but which one? A: A perfect phylogeny (tree) if possible. As little deviation from a tree, if a tree is not possible. Use as little recombination or gene-conversion as possible.

14. Minimizing recombinations • Any set M of sequences can be generated by a phylogenetic network with enough recombinations, and one mutation per site. This is not interesting or useful. • However, the number of (observable) recombinations is small in realistic sets of sequences. ``Observable” depends on n and m relative to the number of recombinations. • Two algorithmic problems: given a set of sequences M, find a phylogenetic network generating M, minimizing the number of recombinations (Hein’s problem). Find a network generating M that has some biologically-motivated structural properties.

15. Minimization is NP-hard The problem of finding a phylogenetic network that creates a given set of sequences M, and minimizes the number of recombinations, is NP-hard. (Wang et al 2000) They explored the problem of finding a phylogenetic network where the recombination cycles are required to be node disjoint, if possible. They gave a sufficient but not a necessary condition to recognize cases when this is possible. O(nm + n^4) time.

16. Recombination Cycles • In a Phylogenetic Network, with a recombination node x, if we trace two paths backwards from x, then the paths will eventually meet. • The cycle specified by those two paths is called a ``recombination cycle”.

17. Galled-Trees A recombination cycle in a phylogenetic network is called a “gall” if it shares no node with any other recombination cycle. A phylogenetic network is called a “galled-tree” if every recombination cycle is a gall.

18. A galled-tree generating the sequences generated by the prior network. 4 3 1 s p a: 00010 3 c: 00100 b: 10010 d: 10100 2 5 s p 4 g: 00101 e: 01100 f: 01101

20. Sales pitch for Galled-Trees Galled-trees represent a small deviation from true trees. There are sufficient applications where it is plausible that a galled tree exists that generates the sequences. Observable recombinations tend to be recent; block structure of human DNA; recombination is sparse, so the true history of observable recombinations may be a galled-tree. The number of recombinations is never more than m/2. Moreover, when M can be derived on a galled-tree, the number of recombinations used is the minimum possible over any phylogenetic network, even if multiple cross-overs at a recombination event are counted as a single recombination. A galled-tree for M is ``almost unique” - implications for reconstructing the correct history.

21. Old (Aug. 2003) Results • O(nm + n^3)-time algorithm to determine whether or not M can be derived on a galled-tree with all-0 ancestral sequence. • Proof that the galled-tree produced by the algorithm is a “nearly-unique” solution. • Proof that the galled-tree (if one exists) produced by the algorithm minimizes the number of recombinations used, over all phylogenetic-networks with all-0 ancestral sequence.

22. The initial version is in the Proceedings of the 2003 IEEE CSB conference. The expanded journal version with proof of optimality is in “Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination” by Gusfield, Eddhu and Langley. J. Bioinformatics and Computational Biology, Vol. 2 No. 1 (2004) p. 173-213

23. New work We derive the galled-tree results in a more general setting that addresses unconstrained recombination cycles and multiple crossover recombination. This also solves the problem of finding the ``most tree-like” network when a perfect phylogeny is not possible. In this algorithm, no ancestral sequence is known in advance.

24. Blobbed-trees: generalizing galled-trees • In a phylogenetic network a maximal set of intersecting cycles is called a blob. • Contracting each blob results in a directed, rooted tree, otherwise one of the “blobs” was not maximal. • So every phylogenetic network can be viewed as a directed tree of blobs - a blobbed-tree. The blobs are the non-tree-like parts of the network.

25. Every network is a tree of blobs. How do the tree parts and the blobs relate? How can we exploit this relationship? Ugly tangled network inside the blob.

26. The start of technical stuff

27. Site Conflicts A pair of sites (columns) of M that fail the 4-gametes test are said to conflict. And each site in the pair is said to be conflicted. A site that is not in such a pair is unconflicted.

28. 1 2 3 4 5 Conflict Graph a b c d e f g 0 0 0 1 0 1 0 0 1 0 0 0 1 0 0 1 0 1 0 0 0 1 1 0 0 0 1 1 0 1 0 0 1 0 1 4 M 1 3 2 5 Two nodes are connected iff the pair of sites conflict, i.e, fail the 4-gamete test. THE MAIN TOOL: We represent the pairwise conflicts in a conflict graph.

29. Simple Fact If sites two sites i and j conflict, then the sites must be together on some recombination cycle whose recombination point is between the two sites i and j. (This is a general fact for all phylogenetic networks.) Ex: In the prior example, site 1 conflicts with 3 and 4; and site 2 conflicts with 5.

30. A Phylogenetic Network 00000 4 00010 a:00010 3 1 10010 00100 5 00101 2 01100 S b:10010 P S 4 01101 c:00100 p g:00101 3 d:10100 f:01101 e:01100

31. Simple Consequence of the simple fact All sites on the same (non-trivial) connected component of the conflict graph must be on the same blob in any blobbed-tree. Follows by transitivity. So we can’t subdivide a blob into a tree-like structure if it only contains sites from a single connected component of the conflict graph.

32. Key Result about Galls: For galls, the converse of the simple consequence is also true. Two sites that are in different (non-trivial) connected components cannot be placed on the same gall in any phylogenetic network for M. Hence, in a galled-tree T for M each gall contains all and only the sites of one (non-trivial) connected component of the conflict graph. All unconflicted sites can be put on edges outside of the galls. This was the key to the galled-tree solution.

33. Conflict Graph A galled-tree generating the sequences generated by the prior network. 4 4 3 1 3 2 5 1 s p a: 00010 2 c: 00100 b: 10010 d: 10100 2 5 s p 4 g: 00101 e: 01100 f: 01101

34. Reduced Galled-Trees • A galled-tree is called reducedif every gall only contains conflicted sites. • Theorem: If M can be derived on a galled-tree, it can be derived on a reduced galled-tree. • The number of recombination nodes in a reduced galled-tree equals the number of connected components of the conflict graph, which is the minimum number of recombinations possible in any galled-tree.

35. A reduced galled-tree for M (if one exists) minimizes the number of recombinations used over any phylogenetic network for M. The initial proof is based on a lower bound method. • Another proof (together with Dean Hickerson): The minimum number of recombinations needed in any phylogenetic network for M is at least the number of non-trivial connected components of the conflict graph for M.

36. The main new fact For any set of sequences M, there is a blobbed-tree T(M) that derives M, where each blob contains all and only the sites in one non-trivial connected component of the conflict graph. The unconflicted sites can always be put on edges outside of any blob. Moreover, the tree part of T(M) is unique. This is bit weaker than the result for galled-trees: it replaces “must” with “can”.

37. My proof is direct and self-contained, but the result may also be derivable from well-established results about splits, for example, from facts known about Bunemann graphs. Thanks to Mike Steel for pointing this out to me.

38. What does T(M) look like? How do we construct it? How do we exploit it? Let T’(M) be the tree where each blob in T(M) has been contracted to a single node. Finding T’(M) is easy from M. Then we expand each node in T’(M) to get T(M).

39. How to find T’(M) For a connected component C in the conflict graph, let M[C] be M restricted to the sites in C. Consider each distinct sequence S in M[C] as defining a binary character (split) partitioning those rows of M[C] that contain S, and those that do not. Let M’ be the binary matrix obtained from these characters, over all connected components in the conflict graph.

40. Fact: M’ satisfies the 4-gamete test and so has a unique undirected perfect phylogeny, which is T’(M). Then we need to expand each node in T’(M) that corresponds to a blob for connected component C to some network B so that the external nodes in B have the labels in M[C], when restricted to C.

41. T(M) v sites on B from C Leaf set Tv B’ w Key point: For any leaf in Tv, and only at those leaves, the states of the sites in C are the same as at v. B: blob C: component of the conflict graph whose sites are on B

42. Example: 4 3 134 010 v 1 s p a: 00010 3 c: 00100 b: 10010 d: 10100 2 5 s p 4 g: 00101 e: 01100 f: 01101

43. More Formally: Let M[C] be the matrix M restricted to the sites in C. Let S[C] be a sequence S restricted to the sites in C. Key point: Each distinct (non-zero) sequence in M[C] must be the sequence S[C] for some sequence S labeling a branching node v on B. So, although we don’t know much about the interior of B, or the arrangement of the exterior nodes (braching off of B), we know precisely their number and the sequences (restricted to sites of C) that label the exterior nodes on B. And we know that the states of the non-C sites are identical at each node in B.

44. 1 2 3 4 5 a b c d e f g 0 0 0 1 0 1 0 0 1 0 0 0 1 0 0 1 0 1 0 0 0 1 1 0 0 0 1 1 0 1 0 0 1 0 1 4 C M 1 3 000 4 B 3 001 1 3 4 a 0 0 1 b 1 0 1 c 0 1 0 d 1 1 0 e 0 1 0 f 0 1 0 g 01 0 010 1 s 101 p a Matrix M[C] is Matrix M restricted to the columns in C. 2 110 b c, e, f, g d

45. Punch Line • Each distinct non-zero sequence S[C] in M[C] corresponds to an edge e branching off of B, and exactly defines the set of sequences in M (and hence leaves in T(M)) that must be below e in T(M). • If S[C] is the all-zero sequence, then the leaf labeled S must connect to B through the coalesenct node of B. These two facts allow the construction of the tree part of T(M) in O(nm) time, starting from M. It also defines the complete label of each exterior node.

46. 1 2 3 4 5 a b c d e f g 0 0 0 1 0 1 0 0 1 0 0 0 1 0 0 1 0 1 0 0 0 1 1 0 0 0 1 1 0 1 0 0 1 0 1 4 C2 C1 M 1 3 2 5 B1 B2 1 3 4 2 5 a b c d e f g 0 0 0 0 0 0 0 0 1 0 1 1 0 1 a 0 0 1 b 1 0 1 c 0 1 0 d 1 1 0 e 0 1 0 f 0 1 0 g 01 0 So the paths to every leaf pass through the blob B1, but only the paths to e, f, g pass through gall B2. The path from B1 to B2 exits B1 at the node whose C1-restricted label is 010. M[C1] M[C2]

47. 1 2 3 4 5 a b c d e f g 0 0 0 1 0 1 0 0 1 0 0 0 1 0 0 1 0 1 0 0 0 1 1 0 0 0 1 1 0 1 0 0 1 0 1 4 C2 C1 M 1 3 2 5 1 2 3 4 5 6 7 8 1 3 4 2 5 a b c d e f g 1 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 5 5 5 5 6 7 8 a b c d e f g 0 0 0 0 0 0 0 0 1 0 1 1 0 1 1 2 3 4 3 3 3 a 0 0 1 b 1 0 1 c 0 1 0 d 1 1 0 e 0 1 0 f 0 1 0 g 01 0 M’ M[C1] M[C2]

48. Algorithmically • Finding the tree part of the blobbed-tree is easy. • Determining the sequences labeling the exterior nodes on any blob is easy. • Determining a “good” structure inside a blob B is the problem of generating the sequences of the exterior nodes of B. • It is easy to test whether the exterior sequences on B can be generated with only a single (possibly multiple-crossover) recombination. The original galled-tree problem is now just the problem of testing whether one single-crossover recombination is sufficient for each blob.

49. The main open question • Is there always a blobbed-tree where each blob has all and only the sites of a single connected component of the conflict graph, which minimizes the number of recombinations over all possible phylogenetic networks for M? • Proof attempt by splitting blob B into B’ and B”. The catch is the possibility of a recombination node in B that is needed in both B’ and B”.

50. If Yes, Then any method that computes a lower bound on the number of needed recombinations should be applied separately on sequences defined by the sites on each connected component, and the results added together. This may be true even if the desired result is not. It is worth trying to prove this.