Grammar-based Compression for Multiple Trees Using Integer Programming

• Item type: SIG Technical Reports(1)
• 公開日: 2014-06-18
• タイトル: Grammar-based Compression for Multiple Trees Using Integer Programming
• タイトル / 言語: en
• タイトル: Grammar-based Compression for Multiple Trees Using Integer Programming
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属: Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属: Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属: Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属: Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属(英): en
• 著者所属(英): Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属(英): en
• 著者所属(英): Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属(英): en
• 著者所属(英): Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属(英): en
• 著者所属(英): Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者所属(英): en
• 著者所属(英): Bioinformatics Center, Institute for Chemical Research, Kyoto University
• 著者名: Yang, Zhao; Morihiro, Hayashida; Yue, Cao; Jaewook, Hwang; Tatsuya, Akutsu
• 著者名(英): Yang, Zhao; Morihiro, Hayashida; Yue, Cao; Jaewook, Hwang; Tatsuya, Akutsu
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: 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 celluar systems and are regarded as tree structures. As a result, our method successfully found the minimum grammar and several common rules among these glycans.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: 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 celluar systems and are regarded as tree structures. As a result, our method successfully found the minimum grammar and several common rules among these glycans.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN10505667
• 書誌情報: 研究報告数理モデル化と問題解決（MPS）; 巻 2014-MPS-98, 号 27, p. 1-2, 発行日 2014-06-18
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会