Trees  Indices  Help 



Largest Common Embeddable Subtree.
Implementation of the algorithm from On the Maximum Common Embedded Subtree Problem for Ordered Trees by Loxano and Valiente. This is for unlabeled, ordered trees.
Author: Mark GranrothWilding <mark.granrothwilding@ed.ac.uk>







__package__ =


Computes the size of the largest common embedded subtree for two unlabeled trees. It is quicker to compute the size than to compute the common tree itself, so this function doesn't actually compute what the tree is. 
Computes the largest common embedded subtree for two unlabeled trees. Even you only need to know the size, use lces_size, since it's a slightly simpler problem. 
Trees  Indices  Help 


Generated by Epydoc 3.0.1 on Mon Nov 26 16:04:56 2012  http://epydoc.sourceforge.net 