✦ LIBER ✦

The tree-to-tree editing problem

✍ Scribed by Stanley M. Selkow

Book ID: 113161931
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 337 KB
Volume: 6
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(77)90064-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

TREE: An interactive system for editing

TREE: An interactive system for editing tree structures

✍ J.W. Lewis 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 283 KB

A modified tree-to-tree correction probl

A modified tree-to-tree correction problem

✍ Reinhard Wilhelm 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 720 KB

New Algorithm for Ordered Tree-to-Tree C

New Algorithm for Ordered Tree-to-Tree Correction Problem

✍ Weimin Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB

number of leaves of S and D D denotes the depth of S. The previous best S Ž< < < < Ä 4 Ä 4 . Ž algorithms for this problem run in O S T min L L , D D min L L , D D time K.

The Steiner tree problem

✍ Dirk van Oudheusden 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 87 KB

The Push Tree problem

✍ Frédéric Havet; Marc Wennink 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

Alignment of trees — an alternative to t

Alignment of trees — an alternative to tree edit

✍ Tao Jiang; Lusheng Wang; Kaizhong Zhang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 699 KB