On the Editing Distance Between Trees and Related Problems - Softcover

Unknown

 
9781332522569: On the Editing Distance Between Trees and Related Problems

Synopsis

This book focuses on string and tree editing, a concept with a wide range of applications in computer science. The author observes the relationship between the editing distance of two trees and other similar problems, then proposes a postorder dynamic programming algorithm that solves this problem in time complexity O( |Ti| X |Tj| X depth(Ti) X depth(Tj)). The book also extends this algorithm to solve the following problems: - Finding the minimum distance between two trees with a subtree removed from one of them - Discovering the minimum distance between two trees with pruning at a node of one of them - Solving the approximate tree matching problem, which seeks the occurrence in one tree that most closely matches another tree The author's depth of exploration in the realm of tree editing and related problems illuminates how these concepts can be applied across disciplines.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title