Sciweavers

179 search results - page 3 / 36
» An Optimal Decomposition Algorithm for Tree Edit Distance
Sort
View
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
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
ECML
2006
Springer
13 years 9 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
ACL
2010
13 years 3 months ago
Edit Tree Distance Alignments for Semantic Role Labelling
Tree SRL system is a Semantic Role Labelling supervised system based on a tree-distance algorithm and a simple k-NN implementation. The novelty of the system lies in comparing the...
Hector-Hugo Franco-Penya
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 5 months ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot