| Trees | Indices | Help |
|
|---|
|
|
Representation of trees as balanced sequences.
This representation is used by Lozano and Valiente, 2004 (On the Maximum Common Embedded Subtree Problem for Ordered Trees).
We currently only support conversion of unlabeled trees to balanced sequences, though Lozano and Valiente do mention how their algorithms could be extended to labeled trees.
Author: Mark Granroth-Wilding <mark.granroth-wilding@ed.ac.uk>
|
|||
|
BalancedSequence Elements should be just 0s and 1s. |
|||
| EmptySequenceError | |||
| UnbalancedSequenceError | |||
|
|||
__package__ = Nonehash(x) |
|||
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Mon Nov 26 16:04:56 2012 | http://epydoc.sourceforge.net |