On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks

DOI10.1016/j.tcs.2022.03.012OpenAlexW3185282397MaRDI QIDQ2143143

Kristina Wicke, Magnus Bordewich, Charles Semple

Publication date: 31 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.07834

zbMATH Keywords

phylogenetic treephylogenetic networkphylogenetic diversity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• NetDiversity
• PhyloNetwork

Cites Work

• Unnamed Item
• Phylogenetic networks with every embedded phylogenetic tree a base tree
• Do branch lengths help to locate a tree in a phylogenetic network?
• Budgeted nature reserve selection with diversity feature loss and arbitrary split systems
• Optimizing phylogenetic diversity across two trees
• Phylogenetic diversity and biodiversity indices on phylogenetic networks
• Optimizing phylogenetic diversity under constraints
• Counting phylogenetic networks
• Properties of normal phylogenetic networks
• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• The Noah's Ark Problem
• Reducibility among Combinatorial Problems

This page was built for publication: On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks