Read Fixed-parameter tractability of the Maximum Agreement Supertree problem text version

Fixed-parameter tractability of the Maximum Agreement Supertree problem

Sylvain Guillemot, Vincent Berry

´ Equipe M´thodes et Algorithmes pour la Bioinformatique e LIRMM - CNRS - Universit´ Montpellier II e Montpellier, France

11th July 2007

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

Setting the scene

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

We consider a collection T = {T1 , ..., Tk } of bijectively leaf-labeled trees with partially overlapping label sets. The union of their label sets is denoted by L.

Example. A collection T with L = {a, b, c, d, e, f }.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Supertree construction

The collection T The tree T

?

a b c f b c d e a d c f

The problem: given T , find a single tree T with labels in L, which complies as much as possible with the input trees. Applications: in phylogenetics [Bininda-Edmonds et al.]: merge several phylogenies obtained by different means into a single one; optimizing queries in databases [Aho et al. 81].

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T

a

b

c

f

b

c

d

e

a

d

c

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T The tree T

a

b

c

f

b

c

d

e

a

d

c

f

a

b

c

e

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example. T is an agreement supertree for T .

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T The tree T

b

c

d

e

a

d

c

f

e

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example. T is an agreement supertree for T .

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T The tree T

a

b

c

f

d

a

d

c

f

a

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example. T is an agreement supertree for T .

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T The tree T

a

b

c

f

b

c

d

e

d

b

e

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example. T is an agreement supertree for T .

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Agreement supertrees

The collection T The tree T

a

b

c

f

b

c

d

e

a

d

c

f

a

b

c

e

f

T agrees with T iff they indicate the same relationships for their common labels. An agreement supertree for T is a tree T with labels in L, which agrees with every Ti . An agreement supertree is total if it contains every label from L. T is compatible if it admits a total agreement supertree. Example. T is an agreement supertree for T .

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

The Maximum Agreement Supertree problem

The collection T The tree T

a

b

c

f

b

c

d

e

a

d

c

f

a

b

c

e

f

A maximum agreement supertree is an agreement supertree with the maximum number of labels. Its size is denoted #SMAST (T ). The Maximum Agreement Supertree problem (Smast, [Berry et al. 04], [Jansson et al. 04]) seeks a maximum agreement supertree for an input collection T . Example: here #SMAST (T ) = 5.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Previous results

Previous results for Smast on binary trees: Smast is NP-hard; Smast is solvable in subquadratic time for two trees [Berry et 2 al. 04], and is solvable in O(n3k ) time for k trees [Jansson et al. 04]; Smast is as hard to approximate as Maximum Clique, and n is approximable within O( log n ) [Jansson et al. 04] using approximation via partitioning; the complementary minimization problem is as hard to approximate as Minimum Set Cover, hence not approximable within (log n) unless P = NP [Berry et al. 04].

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

New results

Our new results are as follows: a bounded-search algorithm with running time O((2k)p × kn2 ), where p is an upper bound on the number of labels missing in a Smast solution; a dynamic-programming algorithm with running time O((8n)k ); an algorithm solving Smast on complete collections of triples in time O(4p n3 ); hardness results for several parameterizations of Smast.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Theorem: Smast can be solved in O((2k)p × kn2 ) time. Observation: the problem can be defined equivalently as: is there an agreement supertree with n - p labels? is there a set L L of size p s.t. T \L is compatible? Proposition: there is an algorithm which takes as input a collection of k trees, in O(kn2 ) time decides if the collection is compatible, or returns a conflict of size 2k in case of incompatibility. yields an algorithm with the claimed running time, using bounded search.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Preliminary definitions: The collection T

p q r a b c f t b c d u e a x d c f s w v

A position in T is a tuple = ([1], ..., [k]), where each [i] is or a node of Ti . The root position is = (r (T1 ), ..., r (Tk )).

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Preliminary definitions: The collection T

p q r a b c f t b c d u e a x d c f s w v

A position in T is a tuple = ([1], ..., [k]), where each [i] is or a node of Ti . The root position is = (r (T1 ), ..., r (Tk )). Example: = (p, s, v ),

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Preliminary definitions: The collection T

p q r a b c f t b c d u e a x d c f s w v

A position in T is a tuple = ([1], ..., [k]), where each [i] is or a node of Ti . The root position is = (r (T1 ), ..., r (Tk )). Example: = (p, s, v ), = (q, s, w ).

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Preliminary definitions: The collection T

p q r a b c f t b c d u e a x d c f s w v

For each i, let Ti be the subtree of Ti rooted at [i] (or the empty tree if [i] = ). We define: T () := {T1 , ..., Tk }.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Preliminary definitions: The collection T

s q r a b c t b c d u e a x d c w

For each i, let Ti be the subtree of Ti rooted at [i] (or the empty tree if [i] = ). We define: T () := {T1 , ..., Tk }. Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We say that is compatible iff the collection T () is compatible. Idea: a recursive algorithm which takes a position , decides if is compatible, or returns a conflict; running it from solves the compatibility problem for T .

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w c t u

The graph G (T , )

r c x

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: The collection T

s q r a b c t b c d u e a x d c w c t u

The graph G (T , )

r c x

We define the graph G (T , ). Consider the indices i [k] s.t. [i] has two children vi , vi . the graph has vertex set {vi , vi : i}; it contains an edge {x, y } whenever L(x) L(y ) = . Example.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

Principle of the algorithm: There are two cases, depending on the connectnedness of G = G (T , ). First case: G is not connected. Consider a partition of its vertex set in two disconnected sets V! , V2 . Then from V1 , V2 we can define two successor positions 1 , 2 s.t. is compatible 1 , 2 are compatible. Second case: G is connected. Let T be a spanning tree of G . For each edge {u, v } choose a label in L(u) L(v ). The resulting set is a conflict of size 2k.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A bounded-search algorithm for Smast

The algorithm:

Procedure IsCompatible() let be obtained from by replacing each leaf component by ; if = (, ..., ) then return true; else perform a connectivity test on G := G (T , ) (*); if G is not connected then we obtain a partition of V in disconnected sets V1 , V2 ; let 1 , 2 be the successor positions of induced by V1 , V2 ; call IsCompatible(1 ), IsCompatible(2 ); else we obtain a spanning tree T = (V , F ) of G ; for each e = {u, v } F , choose le L(u) L(v ); return false, together with the conflict {le : e F };

Step (*) can be done in O(kn) time by working on the intersection model of G . Starting from , the total running time is therefore O(kn2 ).

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

A dynamic programming algorithm for Smast

Thm: Smast can be solved in O((8n)k ) time and O((2n)k ) space. Idea: we define a value #SMAST () for each position in T , s.t. the values #SMAST () satisfy recurrence relations allowing their computation by dynamic programming; #SMAST (T ) is obtained as #SMAST ( ). Complexity: space: there are O((2n)k ) positions, hence the result; time: there are O((2n)k ) positions, and each position in processed in O(4k ) time, hence the time complexity is O((8n)k ).

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A dynamic programming algorithm for Smast

Base case: for each i [k], [i] is either or a leaf of Ti . The collection T

p q r a b c f t b c d u e a x d c f s w v

Let L() be the set of labels associated to the [i] = . A label l L() is maximally present iff for each i [k], if l appears in Ti then [i] = l. Example: L() = {a, b}. a is maximally present, but b is not.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A dynamic programming algorithm for Smast

Base case: for each i [k], [i] is either or a leaf of Ti . Then #SMAST () is the number of maximally present elements of L(). This computation is performed in O(k) time.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A dynamic programming algorithm for Smast

General case: there exists i [k] s.t. [i] is an internal node of Ti . The collection T

p q r a b c f t b c d u e a x d c f s w v

Let , be positions in T . is a successor of iff i [k] s.t. (i) [i] is a child of [i] in Ti ; (ii) [j] = [j] for each j = i. Example: = (p, s, v ) = (p, s, w ) is a successor of .

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

A dynamic programming algorithm for Smast

General case: there exists i [k] s.t. [i] is an internal node of Ti . The collection T

p q r a b c f t b c d u e a x d c f s w v

Let , , be positions in T . ( , ) is a decomposition of iff (a) , are distinct from , and (b) i [k] (i) if [i] = , then { [i], [i]} = {}; (ii) if [i] is a leaf l, then { [i], [i]} = {, l}; (iii) if [i] is an internal node u with two children v , v , then { [i], [i]} is {v , v } or {, u}. Example: = (p, s, v ) = (p, t, f ), = (, u, w ) is a decomposition of .

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

A dynamic programming algorithm for Smast

General case: there exists i [k] s.t. [i] is an internal node of Ti . Then #SMAST () is computed as follows: #SMAST () = max( max{#SMAST ( ) : successor of } max{#SMAST ( ) + #SMAST ( ) : ( , ) decomposition of }) Observations: the values #SMAST ( ) involved in the computation satisfy <T ; there are O(k) successors andO(4k ) decompositions, hence #SMAST () is computed in O(4k ) time.

Sylvain Guillemot, Vincent Berry Fixed-parameter tractability of Smast

Concluding remarks

Experiments? Approximation ratio of the minimization problem? as a function of n: lower bound = (log n), upper bound = n; as a function of k: lower bound = (log k), upper bound = 2k.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

End of the talk

Thank you.

Sylvain Guillemot, Vincent Berry

Fixed-parameter tractability of Smast

Information

Fixed-parameter tractability of the Maximum Agreement Supertree problem

62 pages

Report File (DMCA)

Our content is added by our users. We aim to remove reported files within 1 working day. Please use this link to notify us:

Report this file as copyright or inappropriate

1175590


You might also be interested in

BETA
Fixed-parameter tractability of the Maximum Agreement Supertree problem