๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A modified tree-to-tree correction problem

โœ Scribed by Reinhard Wilhelm

Book ID
113162375
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
720 KB
Volume
12
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 tree-to-tree editing problem
The tree-to-tree editing problem
โœ Stanley M. Selkow ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 337 KB
A problem of tree graph
A problem of tree graph
โœ Hao Li; Qun Liu ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Springer ๐ŸŒ English โš– 301 KB
A constrained Steiner tree problem
A constrained Steiner tree problem
โœ Moshe B. Rosenwein; Richard T. Wong ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 645 KB
A sequential stochastic tree problem
A sequential stochastic tree problem
โœ Robert A. Miller; Karl Voltaire ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB