Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Detecting similar Java classes using tree algorithms
Proceedings of the 2006 international workshop on Mining software repositories
Dynamic knowledge validation and verification for CBR teledermatology system
Artificial Intelligence in Medicine
Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Multi-granularity Parallel Computing in a Genome-Scale Molecular Evolution Application
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Interactive knowledge validation and query refinement in CBR
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Mining tree-structured data on multicore systems
Proceedings of the VLDB Endowment
Validation of computational prediction of horizontal gene transfer events--XenoCluster
The Journal of Supercomputing
On the application of evolutionary algorithms to the consensus tree problem
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Hierarchical clustering, languages and cancer
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
XenoCluster: a grid computing approach to finding ancient evolutionary genetic anomalies
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
A fast algorithmic technique for comparing large phylogenetic trees
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
Phylogenetic trees are unordered labeled trees in which each leaf node has a label and the order among siblings is unimportant. In this paper we propose a new similarity measure, called TreeRank, for phylogenetic trees and present an algorithm for computing TreeRank scores. Given a query or pattern tree P and a data tree D, the TreeRank score from P to D is a measure of the topological relationships in P that are found to be the same or similar in D. The proposed algorithm calculates the TreeRank score in O(M2 + N) time where M is the number of nodes appearing in both P and D, and N is the number of nodes in D. We then develop a search engine that, given a query or pattern tree P and a database of trees D, finds and ranks the nearest neighbors of P in D where the "nearness" is measured by the proposed similarity function. This structure-based search engine is fully operational and is available on the World Wide Web.