Skip to main content
Figure 1 | BMC Bioinformatics

Figure 1

From: Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures

Figure 1

Illustration of the minimum CFG for a string “abcabcab” In the minimum CFG, the substring “abc” is generated from a nonterminal symbol A abc . Then, z abc = 1, x1,3 = 1, and x4,6 = 1. To generate “abcabc”, that is, x1,6 = 1, at least one variable of y1,k,6 (k = 1,,5) must be 1, that is, the substring s1,6 must be divided into s1,k and s k +1,6. Here, y1,3,6 = 1 because x1,3 = x4,6 = 1. Then, the production rule A abcabc → A abc A abc appears.

Back to article page