frequent pattern graph miner Algorithm

In computer science, frequent subtree mining is the problem of finding all shapes in a given database whose support (a metric associated to its number of occurrences in other subtrees) is over a given threshold. It is a more general form of the maximal agreement subtree problem.

frequent pattern graph miner source code, pseudocode and analysis