中文
相关论文

相关论文: Reconstructing Trees from Subtree Weights

200 篇论文

In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to…

度量几何 · 数学 2007-05-23 A. G. Aksoy , B. Maurizi

Since they became observable, neuron morphologies have been informally compared with biological trees but they are studied by distinct communities, neuroscientists, and ecologists. The apparent structural similarity suggests there may be…

The reliability of a phylogenetic inference method from genomic sequence data is ensured by its statistical consistency. Bayesian inference methods produce a sample of phylogenetic trees from the posterior distribution given sequence data.…

度量几何 · 数学 2016-06-10 Alex Gavryushkin , Alexei J. Drummond

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

组合数学 · 数学 2012-05-03 B. S. Kochkarev

The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $T$ on $n$ vertices with edge weights are square matrix of…

组合数学 · 数学 2017-10-30 Fouzul Atik , M. Rajesh Kannan , R. B. Bapat

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

组合数学 · 数学 2017-02-28 Reinhard Diestel

We consider the numerical taxonomy problem of fitting a positive distance function ${D:{S\choose 2}\rightarrow \mathbb R_{>0}}$ by a tree metric. We want a tree $T$ with positive edge weights and including $S$ among the vertices so that…

数据结构与算法 · 计算机科学 2022-03-14 Vincent Cohen-Addad , Debarati Das , Evangelos Kipouridis , Nikos Parotsidis , Mikkel Thorup

It is known that any two trees on the same $n$ leaves can be displayed by a network with $n-2$ reticulations, and there are two trees that cannot be displayed by a network with fewer reticulations. But how many reticulations are needed to…

组合数学 · 数学 2026-03-11 Mathias Weller , Norbert Zeh

Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…

组合数学 · 数学 2021-11-02 Ruriko Yoshida , Shelby Cox

We address phylogenetic reconstruction when the data is generated from a mixture distribution. Such topics have gained considerable attention in the biological community with the clear evidence of heterogeneity of mutation rates. In our…

种群与进化 · 定量生物学 2007-05-23 Daniel Stefankovic , Eric Vigoda

We present a version of the matrix-tree theorem, which relates the determinant of a matrix to sums of weights of arborescences of its directed graph representation. Our treatment allows for non-zero column sums in the parent matrix by…

组合数学 · 数学 2026-03-12 Sayani Ghosh , Bradley S. Meyer

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

组合数学 · 数学 2026-05-20 Richard Mycroft , Tássio Naia

For a model of molecular evolution to be useful for phylogenetic inference, the topology of evolutionary trees must be identifiable. That is, from a joint distribution the model predicts, it must be possible to recover the tree parameter.…

种群与进化 · 定量生物学 2011-11-09 Elizabeth S. Allman , John A. Rhodes

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

离散数学 · 计算机科学 2016-02-02 Fabrizio Luccio

How a single fertilized cell gives rise to a complex array of specialized cell types in development is a central question in biology. The cells grow, divide, and acquire differentiated characteristics through poorly understood molecular…

机器学习 · 计算机科学 2025-03-26 Da Kuang , Guanwen Qiu , Junhyong Kim

In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…

组合数学 · 数学 2014-04-15 Jean-Christophe Aval , Adrien Boussicault , Philippe Nadeau

Phylogenetic trees are leaf-labelled trees, where the leaves correspond to extant species (taxa), and the internal vertices represent ancestral species. The evolutionary history of a set of species can be explained by more than one…

数据结构与算法 · 计算机科学 2016-09-07 Asish Mukhopadhyay , Puspal Bhabak

A phylogenetic network is a graph-theoretical tool that is used by biologists to represent the evolutionary history of a collection of species. One potential way of constructing such networks is via a distance-based approach, where one is…

组合数学 · 数学 2020-06-15 Leo van Iersel , Vincent Moulton , Yukihiro Murakami

We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such networks. The algorithm…

离散数学 · 计算机科学 2019-07-22 Leo van Iersel , Remie Janssen , Mark Jones , Yukihiro Murakami , Norbert Zeh

We compute the Lipschitz-free spaces of subsets of the real line and characterize subsets of metric trees by the fact that their Lipschitz-free space is isometric to a subspace of $L_1$.

泛函分析 · 数学 2009-04-22 Alexandre Godard