Designing an A* algorithm for calculating edit distance between rooted-unordered trees.

Abstract excerpt

Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natural comparison metric is the "Tree Edit Distance," the number of simple edit (insert/delete) operations needed to transform one tree into the other. Rooted-ordered trees, where the order between the siblings is significant, can be compared...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Autoimmune Diseases
• Share to Computational Biology