Figure 6From: Grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAsMinimum SEOTG with (Σ,Γ,{S 1,S 2,S 3},Δ) that generates T 1, T 2, and T 3, as shown in Figure 5. S 1, S 2, S 3 are start symbols in this grammar, Γ={S 1,S 2,S 3,U 2,A 1,A 2,B}, and Δ is the set of seven production rules, R 1,⋯,R 7.Back to article page