loading
Documents

Research.Publish.Connect.

Paper

Authors: Morihiro Hayashida 1 ; Hitoshi Koyano 2 and Tatsuya Akutsu 3

Affiliations: 1 National Institute of Technology and Matsue College, Japan ; 2 Quantitative Biology Center and Riken, Japan ; 3 Institute for Chemical Research and Kyoto University, Japan

ISBN: 978-989-758-280-6

ISSN: 2184-4305

Keyword(s): Generalized Series-parallel Graph, Grammar-based Compression, Integer Linear Programming.

Related Ontology Subjects/Areas/Topics: Algorithms and Software Tools ; Bioinformatics ; Biomedical Engineering ; Pattern Recognition, Clustering and Classification

Abstract: We address a problem of finding generation rules from biological data, especially, represented as directed and undirected generalized series-parallel graphs (GSPGs), which include trees, outerplanar graphs, and series-parallel graphs. In the previous study, grammars for edge-labeled rooted ordered and unordered trees, called SEOTG and SEUTG, respectively, were defined, and it was examined to extract generation rules from glycans and RNAs that can be represented by rooted tree structures, where integer linear programming-based methods for finding the minimum SEOTG and SEUTG that produce only given trees were developed. In nature and organisms, however, there are various kinds of structures such as gene regulatory networks, metabolic pathways, and chemical structures that cannot be represented as rooted trees. In this study, we relax the limitation of structures to be compressed, and propose grammars representing edge-labeled directed and undirected GSPGs based on context-free grammars by extending SEOTG and SEUTG. In addition, we propose an integer linear programming-based method for finding the minimum GSPG grammar in order to analyze more complicated biological networks and structures. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.168.112.145

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Hayashida, M.; Koyano, H. and Akutsu, T. (2018). Grammar-based Compression for Directed and Undirected Generalized Series-parallel Graphs using Integer Linear Programming.In Proceedings of the 11th International Joint Conference on Biomedical Engineering Systems and Technologies - Volume 3 BIOINFORMATICS: BIOINFORMATICS, ISBN 978-989-758-280-6, ISSN 2184-4305, pages 105-111. DOI: 10.5220/0006583001050111

@conference{bioinformatics18,
author={Morihiro Hayashida. and Hitoshi Koyano. and Tatsuya Akutsu.},
title={Grammar-based Compression for Directed and Undirected Generalized Series-parallel Graphs using Integer Linear Programming},
booktitle={Proceedings of the 11th International Joint Conference on Biomedical Engineering Systems and Technologies - Volume 3 BIOINFORMATICS: BIOINFORMATICS,},
year={2018},
pages={105-111},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006583001050111},
isbn={978-989-758-280-6},
}

TY - CONF

JO - Proceedings of the 11th International Joint Conference on Biomedical Engineering Systems and Technologies - Volume 3 BIOINFORMATICS: BIOINFORMATICS,
TI - Grammar-based Compression for Directed and Undirected Generalized Series-parallel Graphs using Integer Linear Programming
SN - 978-989-758-280-6
AU - Hayashida, M.
AU - Koyano, H.
AU - Akutsu, T.
PY - 2018
SP - 105
EP - 111
DO - 10.5220/0006583001050111

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.