系统发育树的评估与挖掘

Geetika Munjal, M. Hanmandlu, Sangeet Srivastva, D. Gaur
{"title":"系统发育树的评估与挖掘","authors":"Geetika Munjal, M. Hanmandlu, Sangeet Srivastva, D. Gaur","doi":"10.14257/IJDTA.2017.10.1.07","DOIUrl":null,"url":null,"abstract":"Assessing and Mining phylogenetic trees is very useful in storing, querying the phylogenetic databases, and finding an accurate phylogenetic tree for a set of species is very difficult. Assessing a phylogenetic tree also resolves the problem of conflicting phylogenies. This paper discusses the methods for validating and mining phylogenetic trees. We propose a new way to compare two trees by accessing importance of node in tree. This new method is applied on phylogenetic trees and the results compared with symmetric distance, Maximum Agreement Subtree and Bootstrapped tree.","PeriodicalId":13926,"journal":{"name":"International journal of database theory and application","volume":"22 1","pages":"67-78"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Assessing and Mining of Phylogenetic Trees\",\"authors\":\"Geetika Munjal, M. Hanmandlu, Sangeet Srivastva, D. Gaur\",\"doi\":\"10.14257/IJDTA.2017.10.1.07\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Assessing and Mining phylogenetic trees is very useful in storing, querying the phylogenetic databases, and finding an accurate phylogenetic tree for a set of species is very difficult. Assessing a phylogenetic tree also resolves the problem of conflicting phylogenies. This paper discusses the methods for validating and mining phylogenetic trees. We propose a new way to compare two trees by accessing importance of node in tree. This new method is applied on phylogenetic trees and the results compared with symmetric distance, Maximum Agreement Subtree and Bootstrapped tree.\",\"PeriodicalId\":13926,\"journal\":{\"name\":\"International journal of database theory and application\",\"volume\":\"22 1\",\"pages\":\"67-78\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of database theory and application\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14257/IJDTA.2017.10.1.07\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of database theory and application","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14257/IJDTA.2017.10.1.07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

系统发育树的评估和挖掘对于系统发育数据库的存储和查询非常有用,而为一组物种找到准确的系统发育树是非常困难的。评估系统发生树也解决了系统发生冲突的问题。本文讨论了验证和挖掘系统发育树的方法。我们提出了一种通过访问树中节点的重要性来比较两棵树的新方法。将该方法应用于系统发育树,并与对称距离树、最大一致子树和bootstrap树进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Assessing and Mining of Phylogenetic Trees
Assessing and Mining phylogenetic trees is very useful in storing, querying the phylogenetic databases, and finding an accurate phylogenetic tree for a set of species is very difficult. Assessing a phylogenetic tree also resolves the problem of conflicting phylogenies. This paper discusses the methods for validating and mining phylogenetic trees. We propose a new way to compare two trees by accessing importance of node in tree. This new method is applied on phylogenetic trees and the results compared with symmetric distance, Maximum Agreement Subtree and Bootstrapped tree.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Logical Data Integration Model for the Integration of Data Repositories Fuzzy Associative Classification Driven MapReduce Computing Solution for Effective Learning from Uncertain and Dynamic Big Data Decision Tree Algorithms C4.5 and C5.0 in Data Mining: A Review Evaluating Intelligent Search Agents in a Controlled Environment Using Complex Queries: An Empirical Study ScaffdCF: A Prototype Interface for Managing Conflicts in Peer Review Process of Open Collaboration Projects
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1