arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.11385math.OCq-bio.PE
收藏

最小化长度的LED树

Length-minimizing LED Trees

Mariana Sarkociová Remešíková, Peter Sarkoci, Mária Trnovská

AI总结:

本文提出LED树作为物种演化表示,研究给定叶子与层次结构下长度最小化问题,证明唯一性并探索几何性质,应用于历史语言学。

摘要:

本文引入了一种特定类型的欧几里得树,称为LED(等深叶子)树。LED树可用于计算系统发育学,因为它们是特征空间中一组物种时间演化的自然代表。本文关注于给定叶子(物种)集合和给定同构类型(祖先的层次结构)下作为长度最小化者的LED树。底层最小化问题可视为经典欧几里得斯坦纳树问题的一个变体。尽管其目标函数是凸的,但由于可行集非凸,该问题相当非平凡。本文的主要贡献是为此问题提供了一个唯一性结果。此外,我们探索了可行集的一些几何和拓扑性质,并证明了长度最小化者的若干几何特征,这些特征与斯坦纳树的性质类似。最后,我们展示了在历史语言学中的一个简单应用示例。

英文摘要:

In this paper, we introduce a specific type of Euclidean tree called LED (Leaves of Equal Depth) tree. LED trees can be used in computational phylogeny, since they are a natural representative of the time evolution of a set of species in a feature space. This work is focused on LED trees that are length minimizers for a given set of leaves (species) and a given isomorphism type (the hierarchical structure of ancestors). The underlying minimization problem can be seen as a variant of the classical Euclidean Steiner tree problem. Even though it has a convex objective function, it is rather non-trivial, since it has a non-convex feasible set. The main contribution of this paper is that we provide a uniqueness result for this problem. Moreover, we explore some geometrical and topological properties of the feasible set and we prove several geometrical characteristics of the length minimizers that are analogical to the properties of Steiner trees. At the end, we show a simple example of an application in historical linguistics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑