کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1710086 1012875 2009 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Optimizing phylogenetic diversity across two trees
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
Optimizing phylogenetic diversity across two trees
چکیده انگلیسی

We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted sum of the phylogenetic diversity across two phylogenetic trees. This resolves one of the challenges proposed as part of the Phylogenetics Programme held at the Isaac Newton Institute for Mathematical Sciences (Cambridge, 2007). It also completely closes the gap between optimizing phylogenetic diversity on one tree, which is known to be in P, and optimizing phylogenetic diversity across three or more trees, which is known to be NP-hard.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics Letters - Volume 22, Issue 5, May 2009, Pages 638–641
نویسندگان
, , ,