140 search results - page 3 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
ECML
2007
Springer
14 years 2 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
CIVR
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. Video databases require that clips are represented in a compact and discriminative way, in order to perform efficient matching and retrieval of documents of interest. We ...
ACL
2012
11 years 11 months ago
2012
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
WABI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
DASFAA
2009
IEEE
14 years 3 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...