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.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. No Jacket. Print on Demand. Explore how to measure and compute edits between tree structures with precision. This book presents a formal framework for editing trees, introducing a distance function that weighs insertions, deletions, and changes, and treats these operations as a metric. It also shows how mappings describe how a sequence of edits transforms one tree into another.This work blends theory with practical algorithms. It starts from basic ideas about postorder numbering and forests, then builds new methods that work in parallel and adapt to related problems. The discussion covers both exact and approximate approaches, along with extensions to other tree-based tasks. Foundations of tree edit distance, including a distance metric and operation costs Mappings that describe transformations between trees, independent of operation order Sequential and parallel algorithms, with time complexity insights Extensions to k-distance problems and to approximate tree matchingIdeal for researchers and students of algorithms, data structures, and computational biology, who want a rigorous treatment of tree comparison techniques and their practical implications. It's a resource for those exploring how to quantify changes in hierarchical data without losing the core structure of the trees. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332522569_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332522569
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332522569
Quantity: 15 available