Grammatical inference of directed acyclic graph languages with polynomial time complexity

Abstract

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Highlights• We tackle the task of graph language learning.• We extend the classes of k-testability and k-TSS languages to directed graph languages.• We propose a grammatical inference algorithm to learn this class of languages.• The algorithm runs in polynomial time.• The algorithm identifies this class of languages from positive data.

A Survey on Syntactic Pattern Recognition Methods in Bioinformatics

“…String-regulated rewriting graph grammars were used for genetic regulation in [130]. The use of an inference algorithm for k-testable graph languages in order to analyze hairpin RNA molecules data sets was presented in [72].…”