中文
相关论文

相关论文: Who Should Have a Place on the Ark? Parameterized …

200 篇论文

Phylogenetic Diversity (PD) is a measure of the overall biodiversity of a set of present-day species (taxa) within a phylogenetic tree. In Maximize Phylogenetic Diversity (MPD) one is asked to find a set of taxa (of bounded size/cost) for…

计算复杂性 · 计算机科学 2024-03-22 Mark Jones , Jannik Schestag

In the Maximize Phylogenetic Diversity problem, we are given a phylogenetic tree that represents the genetic proximity of species, and we are asked to select a subset of species of maximum phylogenetic diversity to be preserved through…

计算复杂性 · 计算机科学 2026-02-16 Niels Holtgrefe , Jannik Schestag , Norbert Zeh

The Noah's Ark Problem (NAP) is an NP-Hard optimization problem with relevance to ecological conservation management. It asks to maximize the phylogenetic diversity (PD) of a set of taxa given a fixed budget, where each taxon is associated…

数据结构与算法 · 计算机科学 2008-10-27 G. Hickey , P. Carmi , A. Maheshwari , N. Zeh

For a phylogenetic tree, the phylogenetic diversity of a set A of taxa is the total weight of edges on paths to A. Finding small sets of maximal diversity is crucial for conservation planning, as it indicates where limited resources can be…

数据结构与算法 · 计算机科学 2025-10-29 Mark Jones , Jannik Schestag

In the NP-hard Optimizing PD with Dependencies (PDD) problem, the input consists of a phylogenetic tree $T$ over a set of taxa $X$, a food-web that describes the prey-predator relationships in $X$, and integers $k$ and $D$. The task is to…

计算复杂性 · 计算机科学 2024-05-28 Christian Komusiewicz , Jannik Schestag

In conservation biology, phylogenetic diversity (PD) provides a way to quantify the impact of the current rapid extinction of species on the evolutionary `Tree of Life'. This approach recognises that extinction not only removes species but…

种群与进化 · 定量生物学 2022-04-13 Kerry Manson , Charles Semple , Mike Steel

Network Phylogenetic Diversity (Network-PD) is a measure for the diversity of a set of species based on a rooted phylogenetic network (with branch lengths and inheritance probabilities on the reticulation edges) describing the evolution of…

计算复杂性 · 计算机科学 2025-11-20 Leo van Iersel , Mark Jones , Jannik Schestag , Celine Scornavacca , Mathias Weller

Identifying a subset of taxa that maximizes Phylogenetic Diversity (PD) is a cornerstone of quantitative conservation planning. Traditionally, PD is defined over a phylogenetic tree in which leaves resemble present-day taxa and the branch…

数据结构与算法 · 计算机科学 2026-05-25 Niels Holtgrefe , Jannik Schestag

Phylogenetic Diversity (PD) is a prominent quantitative measure of the biodiversity of a collection of present-day species (taxa). This measure is based on the evolutionary distance among the species in the collection. Loosely speaking, if…

种群与进化 · 定量生物学 2021-07-20 Magnus Bordewich , Charles Semple , Kristina Wicke

In the Generalized Noah's Ark Problem, one is given a phylogenetic tree on a set of species X and a set of conservation projects for each species. Each project comes with a cost and raises the survival probability of the corresponding…

数据结构与算法 · 计算机科学 2025-11-18 Christian Komusiewicz , Jannik Schestag

Phylogenetic trees represent certain species and their likely ancestors. In such a tree, present-day species are leaves and an edge from u to v indicates that u is an ancestor of v. Weights on these edges indicate the phylogenetic distance.…

种群与进化 · 定量生物学 2025-10-08 Jannik Schestag

We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural parameters that capture the deviation of a network from a…

数据结构与算法 · 计算机科学 2026-05-01 Leo van Iersel , Mark Jones , Jannik Schestag , Celine Scornavacca , Mathias Weller

For many taxa, the current high rates of extinction are likely to result in a significant loss of biodiversity. The evolutionary heritage of biodiversity is frequently quantified by a measure called phylogenetic diversity (PD). We predict…

种群与进化 · 定量生物学 2013-06-13 Amaury Lambert , Mike Steel

The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…

计算复杂性 · 计算机科学 2013-07-25 Christian Knauer , Stefan König , Daniel Werner

We consider the well-studied problem of finding a spanning tree with minimum average distance between vertex pairs (called a MAD tree). This is a classic network design problem which is known to be NP-hard. While approximation algorithms…

数据结构与算法 · 计算机科学 2026-04-01 Tom-Lukas Breitkopf , Vincent Froese , Anton Herrmann , André Nichterlein , Camille Richer

This paper explores the enhancement of solution diversity in evolutionary algorithms (EAs) for the maximum matching problem, concentrating on complete bipartite graphs and paths. We adopt binary string encoding for matchings and use Hamming…

神经与进化计算 · 计算机科学 2024-04-19 Jonathan Gadea Harder , Aneta Neumann , Frank Neumann

Phylogenies are commonly used to represent the evolutionary relationships between species, and often these phylogenies are equipped with edge lengths that indicate degrees of evolutionary difference. Given such a phylogeny, a popular…

种群与进化 · 定量生物学 2025-02-12 Martin Frohn , Kerry Manson

The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this paper, we study a generalized version of the problem: the Maximum Agreement Forest problem…

数据结构与算法 · 计算机科学 2016-09-06 Feng Shi , Jianer Chen , Qilong Feng , Jianxin Wang

The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees with identical leaf label-set. However, the previous work…

数据结构与算法 · 计算机科学 2014-11-04 Feng Shi , Jianer Chen , Qilong Feng , Xiaojun Ding , Jianxin Wang

We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic tree over a set of species and a directed graph, the…

数据结构与算法 · 计算机科学 2016-11-18 Wolfgang Dvořák , Monika Henzinger , David P. Williamson
‹ 上一页 1 2 3 10 下一页 ›