Flexible Tree Matching

In some domains, the most appropriate matchings may not strictly preserve ancestry. For instance, while reparenting Tree-matching problems arise in many computational even a single node in a phylogenetic tree of bacteria would domains. The literature provides several destroy its validity, the ancestry relationships in the Document methods for creating correspondences between labeled Object Model tree of a Web page are much less prescriptive: trees; however, by definition, tree-matching moving a search bar from header to footer results in a algorithms rigidly preserve ancestry. That is, once different--but largely equivalent--page. This pattern follows two nodes have been placed in correspondence, for many other tree structures encountered in design and data their descendants must be matched as well. We introduce management, in which hierarchy plays an important--but not flexible tree matching, which relaxes this definitive--role [Chawathe and Garcia-Molina, 1997].