Related Experiment Video
Updated: May 29, 2026

Collecting and Processing Drone-based Remotely Sensed Data for Use in Forest Recovery Monitoring
Published on: October 24, 2025
A tree-matching algorithm based on node splitting and merging
1Exxon Production Research Company, P.O.Box 2189, Houston, TX 77025.
Abstract:
An algorithm that computes the best matching of two trees is described. The degree of mismatch, i.e., the distance, is measured in terms of the number of node splitting and merging operations required. The proposed tree distance is a more appropriate measurement of structural defonnation than the tree distance measure in terms of the number of insertions, deletions, and substitutions of tree nodes, as defined in previous studies. An algorithm that uses a divide-and-conquer strategy is presented. The analysis shows that the time complexity is O(NM2) where N and Al are the number of nodes of the two trees, respectively. The algorithm has been implemented on a VAX 11/780.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Evolutionary Relationships through Genome Comparisons
Phylogenetic Trees
Phylogenetic Trees
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in value between...
Applications of Molecular Taxonomy

