Geetika Munjal, M. Hanmandlu, Sangeet Srivastva, D. Gaur
{"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}
引用次数: 2
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.