✦ LIBER ✦

Algorithms for parameterized maximum agreement forest problem on multiple trees

✍ Scribed by Shi, Feng; Wang, Jianxin; Chen, Jianer; Feng, Qilong; Guo, Jiong

Book ID: 122253730
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 592 KB
Volume: 554
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.12.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An O ( n log n ) Algorithm for the Maxim

An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

✍ Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thor 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 238 KB

An Algorithm for the Maximum Likelihood

An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees

✍ Carlos A. S. Oliveira 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 967 KB

A Survey on Algorithms for the Maximum I

A Survey on Algorithms for the Maximum Internal Spanning Tree and Related Problems

✍ Gábor Salamon 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 224 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 5917 || An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

✍ Chen, Jianer; Fomin, Fedor V. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 220 KB