### Abstract

Ordered labeled trees are trees in which the left-to-right order among siblings is significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching is also considered. Specifically, algorithms are designed to answer the following kinds of questions: (1) What is the distance between two trees? (2) What is the minimum distance between T_{1} and T_{2} when zero or more subtrees can be removed from T_{2}? (3) Let the pruning of a tree at node n mean removing all the descendants of node n. The analogous question for prunings as for subtrees is answered. A dynamic programming algorithm is presented to solve the three questions.

Original language | English (US) |
---|---|

Pages (from-to) | 1245-1262 |

Number of pages | 18 |

Journal | SIAM Journal on Computing |

Volume | 18 |

Issue number | 6 |

State | Published - Dec 1989 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Theoretical Computer Science

### Cite this

*SIAM Journal on Computing*,

*18*(6), 1245-1262.

**Simple fast algorithms for the editing distance between trees and related problems.** / Zhang, Kaizhong; Shasha, Dennis.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 18, no. 6, pp. 1245-1262.

}

TY - JOUR

T1 - Simple fast algorithms for the editing distance between trees and related problems

AU - Zhang, Kaizhong

AU - Shasha, Dennis

PY - 1989/12

Y1 - 1989/12

N2 - Ordered labeled trees are trees in which the left-to-right order among siblings is significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching is also considered. Specifically, algorithms are designed to answer the following kinds of questions: (1) What is the distance between two trees? (2) What is the minimum distance between T1 and T2 when zero or more subtrees can be removed from T2? (3) Let the pruning of a tree at node n mean removing all the descendants of node n. The analogous question for prunings as for subtrees is answered. A dynamic programming algorithm is presented to solve the three questions.

AB - Ordered labeled trees are trees in which the left-to-right order among siblings is significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching is also considered. Specifically, algorithms are designed to answer the following kinds of questions: (1) What is the distance between two trees? (2) What is the minimum distance between T1 and T2 when zero or more subtrees can be removed from T2? (3) Let the pruning of a tree at node n mean removing all the descendants of node n. The analogous question for prunings as for subtrees is answered. A dynamic programming algorithm is presented to solve the three questions.

UR - http://www.scopus.com/inward/record.url?scp=0024889169&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024889169&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0024889169

VL - 18

SP - 1245

EP - 1262

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 6

ER -