6 citations · 12 across the 4 of their papers we have counts for
4 papers
Detection of Common Subtrees with Identical Label Distribution
Romain Azaïs, Florian Ingels
Frequent pattern mining is a relevant method to analyse structured data, like sequences, trees or graphs. It consists in identifying characteristic substructures of a dataset. This…
Isomorphic unordered labeled trees up to substitution ciphering
Florian Ingels, Romain Azaïs
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the…
Enumeration of Irredundant Forests
Florian Ingels, Romain Azaïs
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has alr…
The Weight Function in the Subtree Kernel is Decisive
Romain Azaïs, Florian Ingels
Tree data are ubiquitous because they model a large variety of situations, e.g., the architecture of plants, the secondary structure of RNA, or the hierarchy of XML files. Neverthe…