Application to Gene Cluster Analysis of Inductive Inference of Languages over Patterns with Conceptual Hierarchy
Yukako Tohsato, Hideo Matsuda, Akihiro Hashimoto · 1999
The MINL problem is a problem that finds a minimum and reduced set of patterns explaining a given set of positive example strings. By restricting the number of patterns to be a fixed constant in advance, a polynomial time algorithm that solves this problem is known [1]. This algorithm is applicable to determining gene clusters based on functional classification if genes having the same