PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Finding Similar or Diverse Solutions in Answer Set Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Path lengths in tree-child time consistent hybridization networks
Information Sciences: an International Journal
Comparison of Tree-Child Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Multi-label classification and extracting predicted class hierarchies
Pattern Recognition
Matching Split Distance for Unrooted Binary Phylogenetic Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
Maintaining a phylogenetic relationship repository requires the development of tools that are useful for mining the data stored in the repository. One way to query a database of phylogenetic information would be to compare phylogenetic trees. Because the only existingtree comparison methods are computationally intensive, this is not a reasonable task. Presented here is the nodal distance algorithm which has significantly less computation time than the most widely used comparison method, the partition metric. When the metric is calculated for trees where one species has been repositioned to a distant part of the tree no further computation is required as is needed for the partition metric. The nodal distance algorithm provides a method for comparing large sets of phylogenetic trees in a reasonable amount of time.