Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model

Despite the recent rapid progress in high throughput measurements of biological data, it is still difficult to gather all of the reaction speed data in biological pathways. This paper presents a Petri net-based algorithm that can derive estimated values for non-valid reaction speeds in a signaling p...

Full description

Bibliographic Details
Main Authors: Atsushi Mizuta, Qi-Wei Ge, Hiroshi Matsuno
Format: Article
Language:English
Published: MDPI AG 2016-12-01
Series:Algorithms
Subjects:
Online Access:http://www.mdpi.com/1999-4893/10/1/4
id doaj-9581b8f70b1a429b9609c903831b52ba
record_format Article
spelling doaj-9581b8f70b1a429b9609c903831b52ba2020-11-24T23:29:24ZengMDPI AGAlgorithms1999-48932016-12-01101410.3390/a10010004a10010004Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net ModelAtsushi Mizuta0Qi-Wei Ge1Hiroshi Matsuno2Graduate School of Science and Engineering, Yamaguchi University, Yamaguchi 7538512, JapanFaculty of Education, Yamaguchi University, Yamaguchi 7538513, JapanGraduate School of Science and Technology for Innovation, Yamaguchi University, Yamaguchi 7538512, JapanDespite the recent rapid progress in high throughput measurements of biological data, it is still difficult to gather all of the reaction speed data in biological pathways. This paper presents a Petri net-based algorithm that can derive estimated values for non-valid reaction speeds in a signaling pathway from biologically-valid data. In fact, these reaction speeds are reflected based on the delay times in the timed Petri net model of the signaling pathway. We introduce the concept of a “dependency relation” over a transition set of a Petri net and derive the properties of the dependency relation through a structural analysis. Based on the theoretical results, the proposed algorithm can efficiently shrink the transitions with two elementary structures into a single transition repeatedly to reduce the Petri net size in order to eventually discover all transition sets with a dependency relation. Finally, to show the usefulness of our algorithm, we apply our algorithm to the IL-3 Petri net model.http://www.mdpi.com/1999-4893/10/1/4signaling pathwayPetri netretention-free Petri netdependent shrinkdependency relation
collection DOAJ
language English
format Article
sources DOAJ
author Atsushi Mizuta
Qi-Wei Ge
Hiroshi Matsuno
spellingShingle Atsushi Mizuta
Qi-Wei Ge
Hiroshi Matsuno
Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model
Algorithms
signaling pathway
Petri net
retention-free Petri net
dependent shrink
dependency relation
author_facet Atsushi Mizuta
Qi-Wei Ge
Hiroshi Matsuno
author_sort Atsushi Mizuta
title Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model
title_short Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model
title_full Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model
title_fullStr Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model
title_full_unstemmed Dependent Shrink of Transitions for Calculating Firing Frequencies in Signaling Pathway Petri Net Model
title_sort dependent shrink of transitions for calculating firing frequencies in signaling pathway petri net model
publisher MDPI AG
series Algorithms
issn 1999-4893
publishDate 2016-12-01
description Despite the recent rapid progress in high throughput measurements of biological data, it is still difficult to gather all of the reaction speed data in biological pathways. This paper presents a Petri net-based algorithm that can derive estimated values for non-valid reaction speeds in a signaling pathway from biologically-valid data. In fact, these reaction speeds are reflected based on the delay times in the timed Petri net model of the signaling pathway. We introduce the concept of a “dependency relation” over a transition set of a Petri net and derive the properties of the dependency relation through a structural analysis. Based on the theoretical results, the proposed algorithm can efficiently shrink the transitions with two elementary structures into a single transition repeatedly to reduce the Petri net size in order to eventually discover all transition sets with a dependency relation. Finally, to show the usefulness of our algorithm, we apply our algorithm to the IL-3 Petri net model.
topic signaling pathway
Petri net
retention-free Petri net
dependent shrink
dependency relation
url http://www.mdpi.com/1999-4893/10/1/4
work_keys_str_mv AT atsushimizuta dependentshrinkoftransitionsforcalculatingfiringfrequenciesinsignalingpathwaypetrinetmodel
AT qiweige dependentshrinkoftransitionsforcalculatingfiringfrequenciesinsignalingpathwaypetrinetmodel
AT hiroshimatsuno dependentshrinkoftransitionsforcalculatingfiringfrequenciesinsignalingpathwaypetrinetmodel
_version_ 1725545925226528768