一种最小化系统发生树交叉的方法

M. Ali, Kutub Thakur, John V. Monaco, Meikang Qiu
{"title":"一种最小化系统发生树交叉的方法","authors":"M. Ali, Kutub Thakur, John V. Monaco, Meikang Qiu","doi":"10.1109/CSCloud.2015.47","DOIUrl":null,"url":null,"abstract":"Visualization of phylogenetic trees became popular and has been widely used in biology, taxonomy, cloud computing, and bioinformatics. Different phylogenetic trees can be built based on different measures and methods. As a result, the problem became obvious when deciding which tree is better and most visually appealing. This often involves comparing two phylogenetic trees to each other. The main goal of this paper is to display a pair of alternative phylogenetic trees together while minimizing the number of crossings among the branches of both trees. This paper summarizes different tools and techniques used in visualizing phylogenetic trees in different studies and describes their limitations. After surveying different studies involved in crossings minimization, a naive algorithm to minimize the number of crossings is proposed.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Approach to Minimize Crossings in Phylogenetic Trees\",\"authors\":\"M. Ali, Kutub Thakur, John V. Monaco, Meikang Qiu\",\"doi\":\"10.1109/CSCloud.2015.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Visualization of phylogenetic trees became popular and has been widely used in biology, taxonomy, cloud computing, and bioinformatics. Different phylogenetic trees can be built based on different measures and methods. As a result, the problem became obvious when deciding which tree is better and most visually appealing. This often involves comparing two phylogenetic trees to each other. The main goal of this paper is to display a pair of alternative phylogenetic trees together while minimizing the number of crossings among the branches of both trees. This paper summarizes different tools and techniques used in visualizing phylogenetic trees in different studies and describes their limitations. After surveying different studies involved in crossings minimization, a naive algorithm to minimize the number of crossings is proposed.\",\"PeriodicalId\":278090,\"journal\":{\"name\":\"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCloud.2015.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCloud.2015.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

系统发育树可视化技术在生物学、分类学、云计算、生物信息学等领域得到了广泛的应用。不同的系统发育树可以基于不同的测量和方法来构建。因此,在决定哪棵树更好、最具视觉吸引力时,问题就变得很明显了。这通常涉及到将两个系统发育树相互比较。本文的主要目标是同时显示一对可选择的系统发生树,同时最小化两个树的分支之间的交叉数量。本文总结了不同研究中用于系统发育树可视化的不同工具和技术,并描述了它们的局限性。在考察了交叉口最小化相关研究的基础上,提出了一种朴素的交叉口最小化算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Approach to Minimize Crossings in Phylogenetic Trees
Visualization of phylogenetic trees became popular and has been widely used in biology, taxonomy, cloud computing, and bioinformatics. Different phylogenetic trees can be built based on different measures and methods. As a result, the problem became obvious when deciding which tree is better and most visually appealing. This often involves comparing two phylogenetic trees to each other. The main goal of this paper is to display a pair of alternative phylogenetic trees together while minimizing the number of crossings among the branches of both trees. This paper summarizes different tools and techniques used in visualizing phylogenetic trees in different studies and describes their limitations. After surveying different studies involved in crossings minimization, a naive algorithm to minimize the number of crossings is proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信