A bijection between directed column-convex polyominoes and ordered trees of height at most three.
Emeric DeutschHelmut ProdingerPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- ordered trees
- horizontal and vertical projections
- convex sets
- unordered trees
- semi structured data
- binary matrix
- tree structures
- mining frequent
- tree automata
- convex optimization
- convex hull
- structured data
- labeled trees
- discrete sets
- equivalence class
- web mining
- semistructured data
- xml data
- data representation
- mining algorithm
- metadata
- nearest neighbor