在低树宽网络中嵌入系统发育树

IF 0.7 4区数学

Discrete Mathematics and Theoretical Computer Science Pub Date : 2023-10-02 DOI:10.46298/dmtcs.10116

Leo van Iersel, Mark Jones, Mathias Weller

{"title":"在低树宽网络中嵌入系统发育树","authors":"Leo van Iersel, Mark Jones, Mathias Weller","doi":"10.46298/dmtcs.10116","DOIUrl":null,"url":null,"abstract":"Given a rooted, binary phylogenetic network and a rooted, binary phylogenetic tree, can the tree be embedded into the network? This problem, called \\textsc{Tree Containment}, arises when validating networks constructed by phylogenetic inference methods.We present the first algorithm for (rooted) \\textsc{Tree Containment} using the treewidth $t$ of the input network $N$ as parameter, showing that the problem can be solved in $2^{O(t^2)}\\cdot|N|$ time and space.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Embedding phylogenetic trees in networks of low treewidth\",\"authors\":\"Leo van Iersel, Mark Jones, Mathias Weller\",\"doi\":\"10.46298/dmtcs.10116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a rooted, binary phylogenetic network and a rooted, binary phylogenetic tree, can the tree be embedded into the network? This problem, called \\\\textsc{Tree Containment}, arises when validating networks constructed by phylogenetic inference methods.We present the first algorithm for (rooted) \\\\textsc{Tree Containment} using the treewidth $t$ of the input network $N$ as parameter, showing that the problem can be solved in $2^{O(t^2)}\\\\cdot|N|$ time and space.\",\"PeriodicalId\":55175,\"journal\":{\"name\":\"Discrete Mathematics and Theoretical Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/dmtcs.10116\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/dmtcs.10116","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

给定一个有根的二叉系统发育网络和一个有根的二叉系统发育树，这个树能嵌入到网络中吗?当验证由系统发育推断方法构建的网络时，会出现这个问题，称为\textsc{树遏制}。我们使用输入网络$N$的\textsc{树}宽$t$作为参数，提出了(根)树包容的第一个算法，表明该问题可以在$2^{O(t^2)}\cdot|N|$时间和空间上解决。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Embedding phylogenetic trees in networks of low treewidth

Given a rooted, binary phylogenetic network and a rooted, binary phylogenetic tree, can the tree be embedded into the network? This problem, called \textsc{Tree Containment}, arises when validating networks constructed by phylogenetic inference methods.We present the first algorithm for (rooted) \textsc{Tree Containment} using the treewidth $t$ of the input network $N$ as parameter, showing that the problem can be solved in $2^{O(t^2)}\cdot|N|$ time and space.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics and Theoretical Computer Science 数学-计算机：软件工程

自引率

14.30%

发文量

期刊介绍： DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network. Sections of DMTCS Analysis of Algorithms Automata, Logic and Semantics Combinatorics Discrete Algorithms Distributed Computing and Networking Graph Theory.