Suffix Classification Trees

[edit]

Wojciech Wieczorek, Olgierd Unold, Łukasz Strąk ;
Proceedings of The 14th International Conference on Grammatical Inference 2018, PMLR 93:44-53, 2019.

Abstract

In this paper, a new method for generating acyclic word graph is proposed. The essential characteristics of the method are: the construction of the data structure in linear time with respect to the size of an input and gathering factor frequencies. Moreover, it has been shown through a computational experiment that the proposed approach surpasses—with respect to AUC score—similar grammatical inference algorithms on the sequences from a real biological dataset.

Related Material