Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees

J. Klawitter, Felix Klesen, Moritz Niederer, A. Wolff
{"title":"Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees","authors":"J. Klawitter, Felix Klesen, Moritz Niederer, A. Wolff","doi":"10.48550/arXiv.2210.06744","DOIUrl":null,"url":null,"abstract":". We consider the problem of drawing multiple gene trees inside a single species tree in order to visualize multispecies coalescent trees. Specifically, the drawing of the species tree fills a rectangle in which each of its edges is represented by a smaller rectangle, and the gene trees are drawn as rectangular cladograms (that is, orthogonally and down-ward, with one bend per edge) inside the drawing of the species tree. As an alternative, we also consider a style where the widths of the edges of the species tree are proportional to given effective population sizes. In order to obtain readable visualizations, our aim is to minimize the number of crossings between edges of the gene trees in such drawings. We show that planar instances can be recognized in linear time and that the general problem is NP-hard. Therefore, we introduce two heuristics and give an integer linear programming (ILP) formulation that provides us with exact solutions in exponential time. We use the ILP to measure the quality of the heuristics on real-world instances. The heuristics yield surprisingly good solutions, and the ILP runs surprisingly fast.","PeriodicalId":266155,"journal":{"name":"Conference on Current Trends in Theory and Practice of Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Current Trends in Theory and Practice of Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2210.06744","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

. We consider the problem of drawing multiple gene trees inside a single species tree in order to visualize multispecies coalescent trees. Specifically, the drawing of the species tree fills a rectangle in which each of its edges is represented by a smaller rectangle, and the gene trees are drawn as rectangular cladograms (that is, orthogonally and down-ward, with one bend per edge) inside the drawing of the species tree. As an alternative, we also consider a style where the widths of the edges of the species tree are proportional to given effective population sizes. In order to obtain readable visualizations, our aim is to minimize the number of crossings between edges of the gene trees in such drawings. We show that planar instances can be recognized in linear time and that the general problem is NP-hard. Therefore, we introduce two heuristics and give an integer linear programming (ILP) formulation that provides us with exact solutions in exponential time. We use the ILP to measure the quality of the heuristics on real-world instances. The heuristics yield surprisingly good solutions, and the ILP runs surprisingly fast.
可视化多物种聚结树:在物种树内绘制基因树
. 为了可视化多物种聚结树,我们考虑了在单个物种树中绘制多个基因树的问题。具体来说,物种树的绘图填充了一个矩形,其中每个边都由一个较小的矩形表示,基因树在物种树的绘图中被绘制为矩形的梯形图(即,垂直向下,每个边有一个弯曲)。作为一种选择,我们还考虑了一种样式,其中物种树的边缘宽度与给定的有效种群大小成正比。为了获得可读的可视化,我们的目标是尽量减少基因树边缘之间的交叉次数。我们证明了平面实例可以在线性时间内被识别,并且一般问题是np困难的。因此,我们引入了两种启发式方法,并给出了一个整数线性规划(ILP)公式,该公式为我们提供了指数时间内的精确解。我们使用ILP来衡量真实世界实例上启发式的质量。启发式算法产生了令人惊讶的好解决方案,ILP的运行速度也令人惊讶地快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信