✦ LIBER ✦

An improved algorithm for the maximum agreement subtree problem

✍ Scribed by Chuan-Min Lee; Ling-Ju Hung; Maw-Shang Chang; Chia-Ben Shen; Chuan-Yi Tang

Book ID: 108153405
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 107 KB
Volume: 94
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.02.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved bound on the maximum agreeme

An improved bound on the maximum agreement subtree problem

✍ Mike Steel; László A. Székely 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 299 KB

We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.

Polynomial-Time Algorithms for the Order

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

✍ Anders Dessmark; Jesper Jansson; Andrzej Lingas; Eva-Marta Lundell 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 230 KB

Improved Algorithms for Maximum Agreemen

Improved Algorithms for Maximum Agreement and

✍ Viet Tung Hoang; Wing-Kin Sung 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 657 KB

An improved algorithm for finding a leng

An improved algorithm for finding a length-constrained maximum-density subtree in a tree

✍ Hsin-Hao Su; Chin Lung Lu; Chuan Yi Tang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A Faster FPT Algorithm for the Maximum A

A Faster FPT Algorithm for the Maximum Agreement Forest Problem

✍ Michael Hallett; Catherine McCartin 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 246 KB

Improved algorithms for the maximum-sums

Improved algorithms for the maximum-sums problems

✍ Chih-Huai Cheng; Kuan-Yu Chen; Wen-Chin Tien; Kun-Mao Chao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 213 KB