J. Jansson and A. Lingas. A fast algorithm for optimal alignment between similar ordered trees. Fundamenta Informaticae, 56(1,2):105 -- 120, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees - Touzet (2005) (Correct)
No context found.
J. Jansson and A. Lingas. A fast algorithm for optimal alignment between similar ordered trees. Fundamenta Informaticae, 56(1,2):105 -- 120, 2003.
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
No context found.
Jesper Jansson amd Andrzej Lingas. A fast algorithm for optimal alignment between similar ordered trees. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM), in Lecture notes of Computer Science (LNCS), volume 2089. Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC