Sciweavers

140 search results - page 2 / 28
» Computing the Edit-Distance between Unrooted Ordered Trees
Sort
View
ALGORITHMICA
2008
121views more  ALGORITHMICA 2008»
13 years 5 months ago
Space Efficient Algorithms for Ordered Tree Comparison
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
Lusheng Wang, Kaizhong Zhang
IJCV
2007
115views more  IJCV 2007»
13 years 5 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
DEXAW
2006
IEEE
111views Database» more  DEXAW 2006»
13 years 11 months ago
Finding Syntactic Similarities Between XML Documents
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
Davood Rafiei, Daniel L. Moise, Dabo Sun
ISAAC
2001
Springer
125views Algorithms» more  ISAAC 2001»
13 years 9 months ago
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important tas...
Gerth Stølting Brodal, Rolf Fagerberg, Chri...
ICALP
2004
Springer
13 years 10 months ago
Property Testing of Regular Tree Languages
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
Frédéric Magniez, Michel de Rougemon...