57 search results - page 2 / 12 » Faster algorithms for guided tree edit distance |
ALGORITHMICA
2008
13 years 5 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
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...
ICALP
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
STRINGOLOGY
2004
13 years 7 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
ACL
2009
13 years 3 months ago
2009
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...