Answers are grounded in this paper and cite their sources.
Analysis highlights ParMol's integration of five algorithms, suggesting a unified approach to graph mining.
Joerg Wegner mentioned in his blog the graph mining program ParMol which integrates four mining algorithms: MoSS (aka MoFa) and Gaston, which I mentioned in November last year , and FFSM and gSpan, which I did not know about yet. ParMol provides a common interface to the four different algorithms and is, like the four mining modules, licensed GPL. An interesting aspect is that Gaston was originally written in C++.
No takes yet. Share an insight, caveat, or question.
Egon Willighagen (2006) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: