Many tree structures can be found in nature and organisms. It is considered that such trees are constructed by some rules. In our previous study, bisection-type grammar-based compression methods for ordered and unordered single trees have been developed. Here, these methods find construction rules for one tree. On the other hand, specified construction rules can be contributed to generate several similar trees. In this technical report, hence, we develop a method to find common rules generating multiple kinds of trees based on the previous method using integer programming. We apply our proposed method to several glycans that are one of important molecules in cellular systems and are regarded as tree structures. As a result, our method successfully found the minimum grammar and several common rules among these glycans.
展开▼
