Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees

We study parameterized algorithms and approximation algorithms for the maximum agreement forest problem, which, for two given leaf-labeled trees, is to find a maximum forest that is a subgraph of both trees. The problem was motivated by research in phylogenetics. For parameterized algorithms, while...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 562; s. 496 - 512
Hlavní autoři: Chen, Jianer, Fan, Jia-Hao, Sze, Sing-Hoi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 2015
Témata:
Algorithms
Approximation
Approximation algorithm
Fixed-parameter tractability
Forests
Mathematical analysis
Maximum agreement forest
Phylogenetic tree
Trees
Maximum agreement forest
Approximation algorithm
Fixed-parameter tractability
Phylogenetic tree
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study parameterized algorithms and approximation algorithms for the maximum agreement forest problem, which, for two given leaf-labeled trees, is to find a maximum forest that is a subgraph of both trees. The problem was motivated by research in phylogenetics. For parameterized algorithms, while the problem is known to be fixed-parameter tractable for binary trees, it was an open problem whether the problem is still fixed-parameter tractable for general trees. We resolve this open problem by developing an O(3kn)-time parameterized algorithm for general trees. Our techniques on tree structures also lead to a polynomial-time approximation algorithm of ratio 3 for the problem, giving the first constant-ratio approximation algorithm for general trees.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2014.10.031