Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming
Background Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different...
Uloženo v:
| Vydáno v: | Algorithms for molecular biology Ročník 12; číslo 1; s. 19 - 14 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
London
BioMed Central
20.07.2017
Springer Nature B.V BMC |
| Témata: | |
| ISSN: | 1748-7188, 1748-7188 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Background
Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour.
Methods
In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations.
Results
We illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach.
Conclusions
Our method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at
http://loicpauleve.name/pint
. |
|---|---|
| AbstractList | Background Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour. Methods In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations. Results We illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach. Conclusions Our method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at http://loicpauleve.name/pint. Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour. In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations. We illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach. Our method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at http://loicpauleve.name/pint. Abstract Background Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour. Methods In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations. Results We illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach. Conclusions Our method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at http://loicpauleve.name/pint . Background Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour. Methods In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations. Results We illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach. Conclusions Our method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at http://loicpauleve.name/pint . BackgroundNumerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour.MethodsIn the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations.ResultsWe illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach.ConclusionsOur method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at loicpauleve.name/pint. Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour.BACKGROUNDNumerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the temporal evolution of the state of the network subject to different competing transitions, potentially leading the system to different attractors. This paper focusses on the formal identification of states and transitions that are crucial for preserving or pre-empting the reachability of a given behaviour.In the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations.METHODSIn the context of non-deterministic automata networks, we propose a static identification of so-called bifurcations, i.e., transitions after which a given goal is no longer reachable. Such transitions are naturally good candidates for controlling the occurrence of the goal, notably by modulating their propensity. Our method combines Answer-Set Programming with static analysis of reachability properties to provide an under-approximation of all the existing bifurcations.We illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach.RESULTSWe illustrate our discrete bifurcation analysis on several models of biological systems, for which we identify transitions which impact the reachability of given long-term behaviour. In particular, we apply our implementation on a regulatory network among hundreds of biological species, supporting the scalability of our approach.Our method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at http://loicpauleve.name/pint.CONCLUSIONSOur method allows a formal and scalable identification of transitions which are responsible for the lost of capability to reach a given state. It can be applied to any asynchronous automata networks, which encompass Boolean and multi-valued models. An implementation is provided as part of the Pint software, available at http://loicpauleve.name/pint. |
| ArticleNumber | 19 |
| Author | Roux, Olivier Guziolowski, Carito Fitime, Louis Fippo Paulevé, Loïc |
| Author_xml | – sequence: 1 givenname: Louis Fippo surname: Fitime fullname: Fitime, Louis Fippo organization: LS2N, UMR CNRS 6004, Ecole Centrale de Nantes, Laboratoire d’Informatique de Paris Nord (LIPN), UMR 7030, Université Paris 13 – sequence: 2 givenname: Olivier surname: Roux fullname: Roux, Olivier organization: LS2N, UMR CNRS 6004, Ecole Centrale de Nantes – sequence: 3 givenname: Carito surname: Guziolowski fullname: Guziolowski, Carito email: carito.guziolowski@ls2n.fr organization: LS2N, UMR CNRS 6004, Ecole Centrale de Nantes – sequence: 4 givenname: Loïc orcidid: 0000-0002-7219-2027 surname: Paulevé fullname: Paulevé, Loïc organization: LRI UMR 8623, Univ. Paris-Sud-CNRS, Université Paris-Saclay |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/28736575$$D View this record in MEDLINE/PubMed https://hal.science/hal-01566380$$DView record in HAL |
| BookMark | eNp9kl2L1DAUhousuB_6A7yRgjfrRTUfTZPeCMOi7sCAgnodTtO0k7FN1iTdZf-96XZWZge0UJqcPO-b03POeXZindVZ9hqj9xiL6kPAFGFWIMzTi1FBn2VnmJei4FiIk4P1aXYewg6hklFEX2SnRHBaMc7Osu261TaaziiIxtncdXljusnvt9GDDWZehtzYdOQG1yd2yL3upwGi8_e51fHO-V8hn4Kxfb6y4U774ruO-Tfveg_jmMIvs-cdDEG_2n8vsp-fP_24ui42X7-sr1abQjGOYkG6lnPeNZTVNWBQtdC8JqxqGt5RoQRWlSqbuqm1ANXUBOlUA2hZhUusMAV6ka0X39bBTt54M4K_lw6MfAg430vw0ahBy-RWVZizFqAsEdRANUVK6Jp3hLSgktfHxetmakbdqlQpD8MT06cn1mxl724lYwSVBCeDd4vB9kh2vdrIOZbaV1VUoNuZvdxf5t3vSYcoRxOUHgaw2k1B4ppQnJ5qRt8eoTs3eZvKOlMMUVISlqg3h9n_vf-x-QngC6C8C8HrTioTH_qefsYMEiM5j5lcxizlyuU8ZpImJT5SPpr_T0MWTUis7bU_SPqfoj-01eU_ |
| CitedBy_id | crossref_primary_10_1007_s13218_018_0551_y crossref_primary_10_1186_s13015_017_0111_2 |
| Cites_doi | 10.1145/5397.5399 10.1007/978-3-319-12982-2_10 10.1016/0022-5193(73)90247-6 10.1017/S0960129511000739 10.1089/cmb.2009.0121 10.1142/S0218339095000526 10.1016/j.entcs.2012.05.017 10.1016/j.entcs.2004.01.038 10.1186/1752-0509-7-135 10.3233/FI-2009-137 10.1016/0304-3975(94)00231-7 10.1093/bioinformatics/18.2.261 10.1016/j.tcs.2015.08.040 10.1007/3-540-45657-0_29 10.1186/1752-0509-3-1 10.1039/C5IB00029G 10.1016/j.biosystems.2008.06.015 10.1186/1752-0509-6-116 10.1017/CBO9780511543357 10.3233/FI-1999-37304 10.1007/978-3-642-39799-8_4 10.1002/stem.1473 10.1016/j.aam.2009.11.011 10.1016/j.artint.2004.04.004 10.1088/1478-3975/9/4/045003 10.1093/bioinformatics/btg395 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2017 Copyright BioMed Central 2017 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: The Author(s) 2017 – notice: Copyright BioMed Central 2017 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | C6C AAYXX CITATION NPM 3V. 7QO 7QP 7QR 7TK 7X7 7XB 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABJCF ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ K9. L6V LK8 M0S M7P M7S P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS PTHSS 7X8 1XC VOOES 5PM DOA |
| DOI | 10.1186/s13015-017-0110-3 |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed ProQuest Central (Corporate) Biotechnology Research Abstracts Calcium & Calcified Tissue Abstracts Chemoreception Abstracts Neurosciences Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection (ProQuest) ProQuest Central (Alumni) ProQuest One Sustainability (subscription) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection (ProQuest) ProQuest Central Essentials Biological Science Collection ProQuest Central Technology collection Natural Science Collection ProQuest One Community College ProQuest Central Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) ProQuest Engineering Collection ProQuest Biological Science Collection Health & Medical Collection (Alumni Edition) Biological Science Database Engineering Database Advanced Technologies & Aerospace Database (ProQuest) ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Databases ProQuest One Academic (New) Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection (ProQuest) MEDLINE - Academic Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials SciTech Premium Collection ProQuest Central China ProQuest One Applied & Life Sciences ProQuest One Sustainability Health Research Premium Collection Natural Science Collection Biological Science Collection Chemoreception Abstracts ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database Neurosciences Abstracts ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic Calcium & Calcified Tissue Abstracts ProQuest One Academic (New) Technology Collection Technology Research Database ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central ProQuest Health & Medical Research Collection ProQuest Engineering Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database PubMed MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology Computer Science |
| EISSN | 1748-7188 |
| EndPage | 14 |
| ExternalDocumentID | oai_doaj_org_article_c8166175daa440a9a3e30c8e97f22dac PMC5520421 oai:HAL:hal-01566380v1 28736575 10_1186_s13015_017_0110_3 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: CNRS grantid: Chair of excellence – fundername: Agence nationale de la recherche (ANR) grantid: ANR-16-CE12-0034 – fundername: ; grantid: Chair of excellence – fundername: ; grantid: ANR-16-CE12-0034 |
| GroupedDBID | 0R~ 23M 2WC 53G 5GY 5VS 6J9 7X7 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AASML ABDBF ABJCF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK E3Z EBD EBLON EBS EJD ESX F5P FYUFA GROUPED_DOAJ GX1 H13 HCIFZ HMCUK HYE IAO IGS IHR ITC KQ8 L6V LK8 M48 M7P M7S M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PUEGO RBZ RNS ROL RPM RSV SBL SOJ TR2 TUS UKHRP WOQ WOW ~8M AAYXX AFFHD CITATION -A0 2VQ 3V. 4.4 ACRMQ ADINQ AHSBF ALIPV C1A C24 IPNFZ NPM RIG 7QO 7QP 7QR 7TK 7XB 8FD 8FK AZQEC DWQXO FR3 GNUQQ K9. P64 PJZUB PKEHL PPXIY PQEST PQUKI PRINS 7X8 1XC VOOES 5PM |
| ID | FETCH-LOGICAL-c570t-2fd777fb3599a1ac98e79256bb7f38c81c6c4b9b9e8acb920e130ad56141c13a3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000405895500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1748-7188 |
| IngestDate | Tue Oct 14 19:09:21 EDT 2025 Tue Nov 04 01:57:31 EST 2025 Tue Oct 14 20:05:14 EDT 2025 Fri Sep 05 09:38:15 EDT 2025 Wed Oct 29 06:23:12 EDT 2025 Wed Feb 19 02:00:52 EST 2025 Tue Nov 18 22:49:34 EST 2025 Sat Nov 29 05:10:43 EST 2025 Sat Sep 06 07:29:42 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Biological Regulatory Networks Complete finite Prefix Bifurcation Transitions Automata Networks Bifurcation Identification |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c570t-2fd777fb3599a1ac98e79256bb7f38c81c6c4b9b9e8acb920e130ad56141c13a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0002-7219-2027 |
| OpenAccessLink | https://doaj.org/article/c8166175daa440a9a3e30c8e97f22dac |
| PMID | 28736575 |
| PQID | 1925032425 |
| PQPubID | 55040 |
| PageCount | 14 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_c8166175daa440a9a3e30c8e97f22dac pubmedcentral_primary_oai_pubmedcentral_nih_gov_5520421 hal_primary_oai_HAL_hal_01566380v1 proquest_miscellaneous_1923111161 proquest_journals_1925032425 pubmed_primary_28736575 crossref_citationtrail_10_1186_s13015_017_0110_3 crossref_primary_10_1186_s13015_017_0110_3 springer_journals_10_1186_s13015_017_0110_3 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-07-20 |
| PublicationDateYYYYMMDD | 2017-07-20 |
| PublicationDate_xml | – month: 07 year: 2017 text: 2017-07-20 day: 20 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | Algorithms for molecular biology |
| PublicationTitleAbbrev | Algorithms Mol Biol |
| PublicationTitleAlternate | Algorithms Mol Biol |
| PublicationYear | 2017 |
| Publisher | BioMed Central Springer Nature B.V BMC |
| Publisher_xml | – name: BioMed Central – name: Springer Nature B.V – name: BMC |
| References | W Abou-Jaoudé (110_CR8) 2015; 2 T Chatain (110_CR11) 2014 C Chaouiya (110_CR30) 2013; 7 R Samaga (110_CR16) 2010; 17 C Baral (110_CR10) 2003 E Plathe (110_CR2) 1995; 3 K Heljanko (110_CR27) 1999; 37 L Paulevé (110_CR17) 2013 O Sahin (110_CR7) 2009; 3 110_CR20 J Esparza (110_CR21) 2008 M Gebser (110_CR24) 2012 L Calzone (110_CR9) 2015; 7 L Paulevé (110_CR4) 2011; 284 A Cheng (110_CR12) 1995; 147 V Acuna (110_CR18) 2009; 95 I Shmulevich (110_CR35) 2002; 18 A Richard (110_CR3) 2010; 44 A Hamez (110_CR19) 2009; 94 R Thomas (110_CR1) 1990 I Crespo (110_CR33) 2013; 31 G Stoll (110_CR36) 2012; 6 J Esparza (110_CR26) 2001; 47 D Thieffry (110_CR28) 1995; 57 110_CR32 S Klamt (110_CR15) 2004; 20 110_CR31 110_CR34 G Bernot (110_CR6) 2007; 180 R Thomas (110_CR5) 1973; 42 M Gelfond (110_CR23) 1988; 88 EM Clarke (110_CR25) 1986; 8 A MacNamara (110_CR29) 2012; 9 F Lin (110_CR22) 2004; 157 L Paulevé (110_CR13) 2012; 22 M Folschette (110_CR14) 2015; 608 19118495 - BMC Syst Biol. 2009 Jan 01;3:1 25674559 - Front Bioeng Biotechnol. 2015 Jan 28;2:86 22932419 - BMC Syst Biol. 2012 Aug 29;6:116 11847074 - Bioinformatics. 2002 Feb;18(2):261-74 14734314 - Bioinformatics. 2004 Jan 22;20(2):226-34 25958956 - Integr Biol (Camb). 2015 Aug;7(8):921-9 18722501 - Biosystems. 2009 Jan;95(1):51-60 7703921 - Bull Math Biol. 1995 Mar;57(2):277-97 22871648 - Phys Biol. 2012 Aug;9(4):045003 4588055 - J Theor Biol. 1973 Dec;42(3):563-85 20078396 - J Comput Biol. 2010 Jan;17(1):39-53 24321545 - BMC Syst Biol. 2013 Dec 10;7:135 23873656 - Stem Cells. 2013 Oct;31(10):2127-35 |
| References_xml | – volume: 8 start-page: 244 issue: 2 year: 1986 ident: 110_CR25 publication-title: ACM Trans Program Lang Syst doi: 10.1145/5397.5399 – ident: 110_CR31 – start-page: 129 volume-title: Computational methods in systems biology year: 2014 ident: 110_CR11 doi: 10.1007/978-3-319-12982-2_10 – volume-title: Answer set solving in practice. Synthesis lectures on artificial intelligence and machine learning year: 2012 ident: 110_CR24 – volume-title: Biological feedback year: 1990 ident: 110_CR1 – volume: 42 start-page: 563 issue: 3 year: 1973 ident: 110_CR5 publication-title: J Theor Biol doi: 10.1016/0022-5193(73)90247-6 – volume: 22 start-page: 651 issue: 04 year: 2012 ident: 110_CR13 publication-title: Math Struct Comput Sci doi: 10.1017/S0960129511000739 – volume: 17 start-page: 39 issue: 1 year: 2010 ident: 110_CR16 publication-title: J Comput Biol doi: 10.1089/cmb.2009.0121 – volume: 3 start-page: 569 year: 1995 ident: 110_CR2 publication-title: J Biol Syst doi: 10.1142/S0218339095000526 – volume: 284 start-page: 93 year: 2011 ident: 110_CR4 publication-title: Electron Notes Theor Comput Sci doi: 10.1016/j.entcs.2012.05.017 – volume: 180 start-page: 3 issue: 3 year: 2007 ident: 110_CR6 publication-title: Electron Notes Theor Comput Sci doi: 10.1016/j.entcs.2004.01.038 – volume: 7 start-page: 1 issue: 1 year: 2013 ident: 110_CR30 publication-title: BMC Syst Biol doi: 10.1186/1752-0509-7-135 – volume: 2 start-page: 86 year: 2015 ident: 110_CR8 publication-title: Front Bioeng Biotechnol – volume: 94 start-page: 413 issue: 3–4 year: 2009 ident: 110_CR19 publication-title: Fundam Inform doi: 10.3233/FI-2009-137 – volume: 57 start-page: 277 year: 1995 ident: 110_CR28 publication-title: Bull Math Biol – volume: 147 start-page: 117 issue: 1&2 year: 1995 ident: 110_CR12 publication-title: Theor Comput Sci doi: 10.1016/0304-3975(94)00231-7 – volume: 18 start-page: 261 issue: 2 year: 2002 ident: 110_CR35 publication-title: Bioinformatics doi: 10.1093/bioinformatics/18.2.261 – volume: 608 start-page: 66 issue: Part 1 year: 2015 ident: 110_CR14 publication-title: Theor Comput Sci doi: 10.1016/j.tcs.2015.08.040 – ident: 110_CR20 doi: 10.1007/3-540-45657-0_29 – volume: 3 start-page: 1 issue: 1 year: 2009 ident: 110_CR7 publication-title: BMC Syst Biol doi: 10.1186/1752-0509-3-1 – volume: 7 start-page: 921 issue: 8 year: 2015 ident: 110_CR9 publication-title: Integr Biol doi: 10.1039/C5IB00029G – volume: 95 start-page: 51 issue: 1 year: 2009 ident: 110_CR18 publication-title: Biosystems doi: 10.1016/j.biosystems.2008.06.015 – ident: 110_CR32 – volume: 6 start-page: 116 issue: 1 year: 2012 ident: 110_CR36 publication-title: BMC Syst Biol doi: 10.1186/1752-0509-6-116 – volume-title: Knowledge representation, reasoning and declarative problem solving year: 2003 ident: 110_CR10 doi: 10.1017/CBO9780511543357 – volume: 37 start-page: 247 issue: 3 year: 1999 ident: 110_CR27 publication-title: Fund Inform doi: 10.3233/FI-1999-37304 – volume: 47 start-page: 231 issue: 3–4 year: 2001 ident: 110_CR26 publication-title: Fund Inform – start-page: 69 volume-title: Computer aided verification year: 2013 ident: 110_CR17 doi: 10.1007/978-3-642-39799-8_4 – volume: 88 start-page: 1070 year: 1988 ident: 110_CR23 publication-title: ICLP/SLP – volume: 31 start-page: 2127 issue: 10 year: 2013 ident: 110_CR33 publication-title: Stem Cells doi: 10.1002/stem.1473 – volume: 44 start-page: 378 issue: 4 year: 2010 ident: 110_CR3 publication-title: Adv Appl Math doi: 10.1016/j.aam.2009.11.011 – volume-title: Unfoldings—a partial-order approach to model checking year: 2008 ident: 110_CR21 – ident: 110_CR34 – volume: 157 start-page: 115 issue: 1 year: 2004 ident: 110_CR22 publication-title: Artif Intell doi: 10.1016/j.artint.2004.04.004 – volume: 9 start-page: 045003 issue: 4 year: 2012 ident: 110_CR29 publication-title: Phys Biol doi: 10.1088/1478-3975/9/4/045003 – volume: 20 start-page: 226 issue: 2 year: 2004 ident: 110_CR15 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btg395 – reference: 19118495 - BMC Syst Biol. 2009 Jan 01;3:1 – reference: 24321545 - BMC Syst Biol. 2013 Dec 10;7:135 – reference: 25674559 - Front Bioeng Biotechnol. 2015 Jan 28;2:86 – reference: 22932419 - BMC Syst Biol. 2012 Aug 29;6:116 – reference: 7703921 - Bull Math Biol. 1995 Mar;57(2):277-97 – reference: 25958956 - Integr Biol (Camb). 2015 Aug;7(8):921-9 – reference: 20078396 - J Comput Biol. 2010 Jan;17(1):39-53 – reference: 23873656 - Stem Cells. 2013 Oct;31(10):2127-35 – reference: 14734314 - Bioinformatics. 2004 Jan 22;20(2):226-34 – reference: 18722501 - Biosystems. 2009 Jan;95(1):51-60 – reference: 4588055 - J Theor Biol. 1973 Dec;42(3):563-85 – reference: 22871648 - Phys Biol. 2012 Aug;9(4):045003 – reference: 11847074 - Bioinformatics. 2002 Feb;18(2):261-74 |
| SSID | ssj0045303 |
| Score | 2.1205294 |
| Snippet | Background
Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models... Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models describe the... Background Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models... BackgroundNumerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These models... Abstract Background Numerous cellular differentiation processes can be captured using discrete qualitative models of biological regulatory networks. These... |
| SourceID | doaj pubmedcentral hal proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 19 |
| SubjectTerms | Algorithms Bifurcations Bioinformatics Biological evolution Biomedical and Life Sciences Boolean algebra Cellular and Medical Topics Cellular communication Computational Biology/Bioinformatics Computer Science Constraints in Bioinformatics Differentiation (biology) Formal Languages and Automata Theory Genes Life Sciences Logic in Computer Science Logic programming Physiological Semantics Signal transduction Static code analysis Transportation networks |
| SummonAdditionalLinks | – databaseName: Biological Science Database dbid: M7P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fb9MwELZggMQLg_ErMJBBPIGiJXFSx0-oIKY9TFMlQNqbZTv2WgmSkaRD---5s51CmdgLj3VcN-59_u7sO98R8sZZlhW65Gllaw0bFFakWvMyFc6h27B0TPiLwsf85KQ-PRWLeOA2xLDKiRM9UTedwTPyA7BEqgy1f_X-_EeKVaPQuxpLaNwktzBLQuFD9xYTE5cV8HP0ZOb17GAAvs4xVA2DLZF-tnSRT9kPGmaJAZFXrc2rQZN_eU69Qjrc_d-p3Cf3oilK5wE7D8gN2-6RO6E45eUe2Z0KPtC4_h-SZbjW6-I5H-0c1Su37uPHEfVeCAGjq5aG_E4IAtqHivddf0nbEHc-UIy4P6Pzdvhp-_SzHekihIp9h-ZH5Ovhpy8fj9JYqiE1Fc_GtHAN59xpVgmhcmVEbTnMcgZyd6w2dW5mptRCC1sro0WRWZCFajANaW5ypthjstN2rX1KaONTyMCuFG25KnPaNhXnYMaZxmWC6YRkk9CkiXnMsZzGN-n3M_VMBjlLkLNEOUuWkLebr5yHJB7Xdf6ASNh0xPzbvqHrz2RcztKguxUsr0apssyUUAwwb2oruCuKRpmEvAYcbY1xND-W2IZ314H0sos8IfsTPmRkjkH-BkdCXm0ew5pHR45qbbf2fRiquhkM8SSgcvNTsANm6ExLCN_C69a7bD9pV0ufV7yqCqBwGPPdhOw_Xutff9ez6yfxnNwt_ILjwMf7ZGfs1_YFuW0uxtXQv_TL9RfN8EdP priority: 102 providerName: ProQuest – databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwELaggMSF9yNQkEGcQFGTOFnbxwVR9VBVFQXUm2U7dnclSFCSLeq_Z8ZOVoQCEhzjOI5jj78ZZz7PEPLKO5YVpuRp5YSBDQorUmN4mUrv0W1YeibDQeFDfnQkTk_l8XiOu5_Y7pNLMiB1WNZisdcD2uZINEOqJILHVXINtJ3AfA0fTj5P8FtWAMqj-_K3j80UUIjTD2plhSzIyybmZabkL-7SoIX2b_9X_--QW6PRSZdRSu6SK665R27ENJQX98kqntb14-872npq1n7TjZcDqrPI7KLrhsawTTi3tIuJ7NvugjaRTt5TJNKf0WXTf3ddeuIGehwZYF-h-AH5tP_-47uDdMzAkNqKZ0Na-Jpz7g2rpNS5tlI4LsFIgun0TFiR24UtjTTSCW2NLDIHH6lrjC6a25xp9pDsNG3jHhNah8gwsNlEE63KvHF1xTlYZ7b2mWQmIdk0LcqO4ckxS8YXFbYpYqHiACoYQIUDqFhCXm8f-RZjc_yt8luc621FDKsdCtruTI2rVFn0ooJBVWtdlpmWmoEoW-Ek90VRa5uQlyApszYOlocKy_BIOmBZdp4nZHcSJDUCQq_AkK4yNF6rhLzY3oaljP4Z3bh2E-ow1GALaOJRlLvtq2Bjy9BHlhA-k8hZX-Z3mvUqhAuvqgKQGdp8M8nlT93603A9-afaT8nNIgg2B9TdJTtDt3HPyHV7Pqz77nlYnz8AvlU2Xw priority: 102 providerName: Springer Nature |
| Title | Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming |
| URI | https://link.springer.com/article/10.1186/s13015-017-0110-3 https://www.ncbi.nlm.nih.gov/pubmed/28736575 https://www.proquest.com/docview/1925032425 https://www.proquest.com/docview/1923111161 https://hal.science/hal-01566380 https://pubmed.ncbi.nlm.nih.gov/PMC5520421 https://doaj.org/article/c8166175daa440a9a3e30c8e97f22dac |
| Volume | 12 |
| WOSCitedRecordID | wos000405895500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: Open Access: BioMedCentral Open Access Titles customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: RBZ dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: DOA dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M~E dateStart: 20060101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database (ProQuest) customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M7P dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M7S dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: PIMPY dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: RSV dateStart: 20060101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrR1db9Mw0IIBEi-IbwKjMognULQkjuv4sUObhjSqaAVUeLFsx6aVIEVpO7R_z52dVisT8MKLpdiOY92d7yN3viPklXcsK0wpUu4qAwYKK1JjRJlK79FtWHomw0XhUzEeV9OprC-V-sKYsJgeOALuwKJjC2Rco3VZZlpqBqvbyknhi6LRFrlvJuTGmIo8uOTAmXsfZl4ND5bAqXMMUsMwS2Q8O1IoJOsH2TLDUMireubVcMnffKZBFB3fJXd6HZKO4t7vkWuuvU9uxaqSFw_ILF6-9f3fOLrw1Mz9uusfVyidYqAWnbc0ZmFCVNEu1qVfdBe0jdHhS4px8V_pqF3-dF06cStax4Cu79D9kHw8Pvrw9iTtCyqklotslRa-EUJ4w7iUOtdWVk5I0HkAO55VAGk7tKWRRrpKWyOLzAHcdIPJQnObM80ekb120bonhDYh0QvYjqhx8cwb13AhQNmyjc8kMwnJNgBWts82jkUvvqlgdVRDFXGiACcKcaJYQl5vX_kRU238bfIhYm07EbNkhw6gHdXTjvoX7STkJeB8Z42T0anCPrxhDqwpO88Tsr8hCdWf76UCvZhnqIvyhLzYDsPJRHeLbt1iHeYwFEhDWOJxpKDtp8BOZejySojYoa2dveyOtPNZyP7NeQGMFtZ8s6HCS9v6E7ie_g9wPSO3i3CEBPDWfbK36tbuOblpz1fzZTcg18VUhLYakBuHR-P6bBAO5QDjaevQTqCt-RcYr9-9rz_D09nk0y_LzDyc |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VFAQXCuVlKLAguICs2l476z0gFB5VoqZVJIpUTou93k0igV2cpFX-FL-RGT8CoaK3Hjh6vV6v7W--mfXMzgC8sIZ7QRoKNzJxigsUHrhpKkJXWktuw9ByWW0UHorDw_j4WI424Ge7F4bCKltOrIg6KzT9I99FSyTySPtHb09-uFQ1iryrbQmNGhb7ZnmGS7bZm8EH_L4vg2Dv49H7vttUFXB1JLy5G9hMCGFTHkmZ-ImWsRE4dhenaHmsY193dZjKVJo40akMPIM0n2SUMdPXPk84jnsFNkMCewc2R4OD0ZeW-8MINULjO_Xj7u4ML_UpOI7CO4nw1rRfVSQAddqEQjDP27fnwzT_8tVWKnBv6397ebfgZmNss14tHbdhw-TbcK0uv7nchq22pAVrGO4OTOqNy7b5k8kKy9KpXZTN4Zw0ex3kxqY5qzNYEcxZacZUCK0olyyvI-tnjPYUjFkvn52Z0v1k5mxUB8N9x-a78PlSnvwedPIiNw-AZVWSHFx3k7UaeTY1WSQEGqo6s57kqQNeCxKlm0ztVDDkm6pWbHFX1bhSiCtFuFLcgVerS07qNCUXdX5HyFt1pAzjVUNRjlVDWEqTQxltyyxJwtBLZMJRqnVspLBBkCXageeI27Ux-r2hojbanY-07p36Duy0eFQNN87UbzA68Gx1GlmNXFVJbopF1YeTMu_iEPdrKVjdCtf4nNyFDog1-Viby_qZfDqpMqdHUYBKCsd83UrSH9P61-t6ePFDPIXr_aODoRoODvcfwY2gEnaB2mcHOvNyYR7DVX06n87KJw1ZMPh62SL2Cxnsphs |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bb9MwFLZgXMQLd0ZggEE8MUVL4qSOH8ulGqKqKg3Q3izbsddKLJmSdGj_nnPipCIMkBCPdRw3sY_PJefzdwh57SyLEp3yMLO5hgCFJaHWPA2Fc5g2TB0T3UHhOV8s8uNjsezrnDYD2n1ISfozDcjSVLYHZ4XzWzyfHDSgeWMEnSFsEhXJVXItRRw9hutHXwdVnGagoPtU5m9vGxmjjrMfTMwKEZGX3c3LqMlfUqedRZrd-e93uUtu984onXrpuUeu2PI-ueHLU148ICt_itf1n_Vo5aheu03d_2zRzHnEF12X1NM54ZrT2he4r-oLWnqYeUMRYH9Cp2Xz3dbhkW3p0iPDTqH5Ifky-_D53WHYV2YITcajNkxcwTl3mmVCqFgZkVsuwHmCZXYsN3lsJibVQgubK6NFEll4SVUg62hsYqbYI7JTVqV9TGjRMcZAEIquWxY5bYuMc_DaTOEiwXRAomGJpOlpy7F6xjfZhS_5RPoJlDCBEidQsoC82d5y5jk7_tb5La77tiPSbXcNVX0i-90rDWZXwdEqlErTSAnFQMRNbgV3SVIoE5BXIDWjMQ6nc4lteFQddFx0HgdkbxAq2SuKRoKDnUXo1GYBebm9DFsc8zaqtNWm68PQsk1giF0vg9u_goCXYe4sIHwknaNnGV8p16uORjzLEtDYMOb-IKM_PdafpuvJP_V-QW4u38_k_OPi01NyK-lknINi3iM7bb2xz8h1c96um_p5t21_ALeuQic |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Identification+of+bifurcation+transitions+in+biological+regulatory+networks+using+Answer-Set+Programming&rft.jtitle=Algorithms+for+molecular+biology&rft.au=Louis+Fippo+Fitime&rft.au=Olivier+Roux&rft.au=Carito+Guziolowski&rft.au=Lo%C3%AFc+Paulev%C3%A9&rft.date=2017-07-20&rft.pub=BMC&rft.eissn=1748-7188&rft.volume=12&rft.issue=1&rft.spage=1&rft.epage=14&rft_id=info:doi/10.1186%2Fs13015-017-0110-3&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_c8166175daa440a9a3e30c8e97f22dac |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1748-7188&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1748-7188&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1748-7188&client=summon |