2834 search results - page 39 / 567 » Representing Trees with Constraints |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
TSP
2008
13 years 8 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
WABI
2004
Springer
14 years 2 months ago
2004
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...