ESA   1998 European Symposium on Algorithms
Wall of Fame | Most Viewed ESA-1998 Paper
175views Algorithms» more  ESA 1998»
12 years 5 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source175
2Download preprint from source169
3Download preprint from source162
4Download preprint from source159
5Download preprint from source154
6Download preprint from source145
7Download preprint from source108
8Download preprint from source105
9Download preprint from source95