A linear-time algorithm for comparing similar ordered trees H´el`ene Touzet LIFL – University of Lille 1 – France Comparison with k errors - H tree - Document - PDFSEARCH.IO

First Page	Meta Content
	A linear-time algorithm for comparing similar ordered trees H´el`ene Touzet LIFL – University of Lille 1 – France Comparison with k errors Add to Reading List Document Date: 2005-07-08 16:24:06 Open Document File Size: 123,17 KB Share Result on Facebook Facility University of Lille / / IndustryTerm linear-time algorithm / / Organization University of Lille / / Technology linear-time algorithm / / SocialTag Tree Spanning tree NP-complete problems Levenshtein distance Graph theory Theoretical computer science Mathematics

A linear-time algorithm for comparing similar ordered trees H´el`ene Touzet LIFL – University of Lille 1 – France Comparison with k errorsAdd to Reading List