### Abstract

In this paper, we consider the problem of computing a maximum compatible tree for k rooted trees when the maximum degree of all trees is bounded. We show that the problem can be solved in O(2^{2kd}n^{k}) time, where n is the number of taxa in each tree, and every node in every tree has at most d children. Hence, a maximum compatible tree for k unrooted trees can be found in in O(2^{2kd}n^{k+1}) time.

Original language | English (US) |
---|---|

Title of host publication | Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings |

Editors | Bernard M. E. Moret, Olivier Gascuel |

Publisher | Springer-Verlag |

Pages | 156-163 |

Number of pages | 8 |

ISBN (Print) | 3540425160 |

DOIs | |

State | Published - Jan 1 2001 |

Externally published | Yes |

Event | 1st International Workshop on Algorithms in Bioinformatics, WABI 2001 - Arhus, Denmark Duration: Aug 28 2001 → Aug 31 2001 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2149 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 1st International Workshop on Algorithms in Bioinformatics, WABI 2001 |
---|---|

Country | Denmark |

City | Arhus |

Period | 8/28/01 → 8/31/01 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings*(pp. 156-163). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2149). Springer-Verlag. https://doi.org/10.1007/3-540-44696-6_12

**Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time.** / Ganapathysaravanabavan, Ganeshkumar; Warnow, Tandy.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2149, Springer-Verlag, pp. 156-163, 1st International Workshop on Algorithms in Bioinformatics, WABI 2001, Arhus, Denmark, 8/28/01. https://doi.org/10.1007/3-540-44696-6_12

}

TY - GEN

T1 - Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time

AU - Ganapathysaravanabavan, Ganeshkumar

AU - Warnow, Tandy

PY - 2001/1/1

Y1 - 2001/1/1

N2 - In this paper, we consider the problem of computing a maximum compatible tree for k rooted trees when the maximum degree of all trees is bounded. We show that the problem can be solved in O(22kdnk) time, where n is the number of taxa in each tree, and every node in every tree has at most d children. Hence, a maximum compatible tree for k unrooted trees can be found in in O(22kdnk+1) time.

AB - In this paper, we consider the problem of computing a maximum compatible tree for k rooted trees when the maximum degree of all trees is bounded. We show that the problem can be solved in O(22kdnk) time, where n is the number of taxa in each tree, and every node in every tree has at most d children. Hence, a maximum compatible tree for k unrooted trees can be found in in O(22kdnk+1) time.

UR - http://www.scopus.com/inward/record.url?scp=84959037630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84959037630&partnerID=8YFLogxK

U2 - 10.1007/3-540-44696-6_12

DO - 10.1007/3-540-44696-6_12

M3 - Conference contribution

AN - SCOPUS:84959037630

SN - 3540425160

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 156

EP - 163

BT - Algorithms in Bioinformatics - First International Workshop, WABI 2001 Århus Denmark, August 28-31, 2001 Proceedings

A2 - Moret, Bernard M. E.

A2 - Gascuel, Olivier

PB - Springer-Verlag

ER -