On Approximative Reachability Analysis of Biochemical Dynamical Systems View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2012

AUTHORS

L. Brim , J. Fabriková , S. Dražan , D. Šafránek

ABSTRACT

This is an extended version of the workshop paper [1], in which a new computational technique called quantitative discrete approximation has been introduced. The technique provides finite discrete approximation of continuous dynamical systems which is suitable especially for a significant class of biochemical dynamical systems. With decreasing granularity the approximation of behaviour between a discrete state and its successor converges to the behaviour of the original continuous system in the respective part of the phase space.This paper provides a detailed description of the method and algorithms solving the reachability problem in biochemical dynamical systems. The method is supplemented with heuristics for reducing the cardinality of the reachable state space. The algorithms are evaluated on six models (with numbers of variables ranging from 2 to 12). More... »

PAGES

77-101

Book

TITLE

Transactions on Computational Systems Biology XIV

ISBN

978-3-642-35523-3
978-3-642-35524-0

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-35524-0_4

DOI

http://dx.doi.org/10.1007/978-3-642-35524-0_4

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1047009526


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0102", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Applied Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Brim", 
        "givenName": "L.", 
        "id": "sg:person.0645117057.83", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0645117057.83"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fabrikov\u00e1", 
        "givenName": "J.", 
        "id": "sg:person.07463352667.48", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07463352667.48"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Dra\u017ean", 
        "givenName": "S.", 
        "id": "sg:person.01343575050.41", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01343575050.41"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "\u0160afr\u00e1nek", 
        "givenName": "D.", 
        "id": "sg:person.011410250615.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011410250615.43"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2012", 
    "datePublishedReg": "2012-01-01", 
    "description": "This is an extended version of the workshop paper [1], in which a new computational technique called quantitative discrete approximation has been introduced. The technique provides finite discrete approximation of continuous dynamical systems which is suitable especially for a significant class of biochemical dynamical systems. With decreasing granularity the approximation of behaviour between a discrete state and its successor converges to the behaviour of the original continuous system in the respective part of the phase space.This paper provides a detailed description of the method and algorithms solving the reachability problem in biochemical dynamical systems. The method is supplemented with heuristics for reducing the cardinality of the reachable state space. The algorithms are evaluated on six models (with numbers of variables ranging from 2 to 12).", 
    "editor": [
      {
        "familyName": "Priami", 
        "givenName": "Corrado", 
        "type": "Person"
      }, 
      {
        "familyName": "Petre", 
        "givenName": "Ion", 
        "type": "Person"
      }, 
      {
        "familyName": "de Vink", 
        "givenName": "Erik", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-35524-0_4", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-35523-3", 
        "978-3-642-35524-0"
      ], 
      "name": "Transactions on Computational Systems Biology XIV", 
      "type": "Book"
    }, 
    "keywords": [
      "dynamical systems", 
      "discrete approximation", 
      "continuous dynamical systems", 
      "original continuous system", 
      "new computational technique", 
      "reachable state space", 
      "phase space", 
      "state space", 
      "continuous system", 
      "approximation", 
      "discrete states", 
      "reachability analysis", 
      "reachability problem", 
      "computational techniques", 
      "significant class", 
      "extended version", 
      "algorithm", 
      "space", 
      "converges", 
      "cardinality", 
      "system", 
      "detailed description", 
      "problem", 
      "heuristics", 
      "class", 
      "technique", 
      "description", 
      "model", 
      "version", 
      "behavior", 
      "state", 
      "granularity", 
      "method", 
      "analysis", 
      "respective parts", 
      "part", 
      "workshop paper", 
      "paper"
    ], 
    "name": "On Approximative Reachability Analysis of Biochemical Dynamical Systems", 
    "pagination": "77-101", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1047009526"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-35524-0_4"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-35524-0_4", 
      "https://app.dimensions.ai/details/publication/pub.1047009526"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-10T10:40", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_181.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-35524-0_4"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-35524-0_4'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-35524-0_4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-35524-0_4'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-35524-0_4'


 

This table displays all metadata directly associated to this object as RDF triples.

133 TRIPLES      23 PREDICATES      65 URIs      57 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-35524-0_4 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 anzsrc-for:0102
4 schema:author Nd9ae179fb4a2456e95a94cefaae31e52
5 schema:datePublished 2012
6 schema:datePublishedReg 2012-01-01
7 schema:description This is an extended version of the workshop paper [1], in which a new computational technique called quantitative discrete approximation has been introduced. The technique provides finite discrete approximation of continuous dynamical systems which is suitable especially for a significant class of biochemical dynamical systems. With decreasing granularity the approximation of behaviour between a discrete state and its successor converges to the behaviour of the original continuous system in the respective part of the phase space.This paper provides a detailed description of the method and algorithms solving the reachability problem in biochemical dynamical systems. The method is supplemented with heuristics for reducing the cardinality of the reachable state space. The algorithms are evaluated on six models (with numbers of variables ranging from 2 to 12).
8 schema:editor N847576cf7a164a4f9ce1e8a9f8601e1a
9 schema:genre chapter
10 schema:inLanguage en
11 schema:isAccessibleForFree false
12 schema:isPartOf N2bb7adf31c454d8cb4b0a198fec66e13
13 schema:keywords algorithm
14 analysis
15 approximation
16 behavior
17 cardinality
18 class
19 computational techniques
20 continuous dynamical systems
21 continuous system
22 converges
23 description
24 detailed description
25 discrete approximation
26 discrete states
27 dynamical systems
28 extended version
29 granularity
30 heuristics
31 method
32 model
33 new computational technique
34 original continuous system
35 paper
36 part
37 phase space
38 problem
39 reachability analysis
40 reachability problem
41 reachable state space
42 respective parts
43 significant class
44 space
45 state
46 state space
47 system
48 technique
49 version
50 workshop paper
51 schema:name On Approximative Reachability Analysis of Biochemical Dynamical Systems
52 schema:pagination 77-101
53 schema:productId N3594d405ba5e47f18ab917194b5a7e34
54 N8c5748095e3e4176a4cba069990900b9
55 schema:publisher N2bd9639570be43efa774638732e8efb0
56 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047009526
57 https://doi.org/10.1007/978-3-642-35524-0_4
58 schema:sdDatePublished 2022-05-10T10:40
59 schema:sdLicense https://scigraph.springernature.com/explorer/license/
60 schema:sdPublisher N9419a1d3808e497f96e92c9f3f9d049b
61 schema:url https://doi.org/10.1007/978-3-642-35524-0_4
62 sgo:license sg:explorer/license/
63 sgo:sdDataset chapters
64 rdf:type schema:Chapter
65 N0817c49e11be47e69382e985e27ad670 rdf:first N1a1572b6bc0b4079bf0cf22c399f8b37
66 rdf:rest Ne3d76cb2fb764d24a65f7e9a73d4f541
67 N08bb3e76b9914ef6b16a6e79cc28c64f rdf:first sg:person.07463352667.48
68 rdf:rest N2505418d6b564ef68c22cfada1dbaaa1
69 N1a1572b6bc0b4079bf0cf22c399f8b37 schema:familyName Petre
70 schema:givenName Ion
71 rdf:type schema:Person
72 N2505418d6b564ef68c22cfada1dbaaa1 rdf:first sg:person.01343575050.41
73 rdf:rest N656a548a42df47348df976f56089ed3e
74 N2bb7adf31c454d8cb4b0a198fec66e13 schema:isbn 978-3-642-35523-3
75 978-3-642-35524-0
76 schema:name Transactions on Computational Systems Biology XIV
77 rdf:type schema:Book
78 N2bd9639570be43efa774638732e8efb0 schema:name Springer Nature
79 rdf:type schema:Organisation
80 N3594d405ba5e47f18ab917194b5a7e34 schema:name doi
81 schema:value 10.1007/978-3-642-35524-0_4
82 rdf:type schema:PropertyValue
83 N495f68df08734ab2b89d7abdf91161ba schema:familyName Priami
84 schema:givenName Corrado
85 rdf:type schema:Person
86 N656a548a42df47348df976f56089ed3e rdf:first sg:person.011410250615.43
87 rdf:rest rdf:nil
88 N847576cf7a164a4f9ce1e8a9f8601e1a rdf:first N495f68df08734ab2b89d7abdf91161ba
89 rdf:rest N0817c49e11be47e69382e985e27ad670
90 N8c5748095e3e4176a4cba069990900b9 schema:name dimensions_id
91 schema:value pub.1047009526
92 rdf:type schema:PropertyValue
93 N9419a1d3808e497f96e92c9f3f9d049b schema:name Springer Nature - SN SciGraph project
94 rdf:type schema:Organization
95 Nd9ae179fb4a2456e95a94cefaae31e52 rdf:first sg:person.0645117057.83
96 rdf:rest N08bb3e76b9914ef6b16a6e79cc28c64f
97 Ne3d76cb2fb764d24a65f7e9a73d4f541 rdf:first Necb6c0b7fd1e44a9907a5230152cc0ec
98 rdf:rest rdf:nil
99 Necb6c0b7fd1e44a9907a5230152cc0ec schema:familyName de Vink
100 schema:givenName Erik
101 rdf:type schema:Person
102 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
103 schema:name Mathematical Sciences
104 rdf:type schema:DefinedTerm
105 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
106 schema:name Pure Mathematics
107 rdf:type schema:DefinedTerm
108 anzsrc-for:0102 schema:inDefinedTermSet anzsrc-for:
109 schema:name Applied Mathematics
110 rdf:type schema:DefinedTerm
111 sg:person.011410250615.43 schema:affiliation grid-institutes:grid.10267.32
112 schema:familyName Šafránek
113 schema:givenName D.
114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011410250615.43
115 rdf:type schema:Person
116 sg:person.01343575050.41 schema:affiliation grid-institutes:grid.10267.32
117 schema:familyName Dražan
118 schema:givenName S.
119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01343575050.41
120 rdf:type schema:Person
121 sg:person.0645117057.83 schema:affiliation grid-institutes:grid.10267.32
122 schema:familyName Brim
123 schema:givenName L.
124 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0645117057.83
125 rdf:type schema:Person
126 sg:person.07463352667.48 schema:affiliation grid-institutes:grid.10267.32
127 schema:familyName Fabriková
128 schema:givenName J.
129 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07463352667.48
130 rdf:type schema:Person
131 grid-institutes:grid.10267.32 schema:alternateName Faculty of Informatics, Masaryk University, Botanická 68a, Brno, Czech Republic
132 schema:name Faculty of Informatics, Masaryk University, Botanická 68a, Brno, Czech Republic
133 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...