On the editing distance between unordered labeled trees
β Scribed by Kaizhong Zhang; Rick Statman; Dennis Shasha
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 538 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present some new results on a well-known distance measure between evolutionary trees. The trees we consider are free 3-trees having n leaves labeled 0, . . . , n -1 (representing species), and n -2 internal nodes of degree 3. The distance between two trees is the minimum number of nearest neighbo
## Abstract An edgeβoperation on a graph __G__ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from __G__ to $\cal G$ is the smallest number of edgeβoperations needed to modify __G__ into a graph
**Ten-year-old Mafalda hides the fact that she is going blind from her family and friends in this lyrical, bittersweet debut novel from Italian author Paola Peretti that shows you how to overcome the darknesseven when you cant see the light at the end of the tunnel.** There are a lot of things
**Ten-year-old Mafalda hides the fact that she is going blind from her family and friends in this lyrical, bittersweet debut novel from Italian author Paola Peretti that shows you how to overcome the darkness --even when you can't see the light at the end of the tunnel.** There are a lot of things