An integer optimization algorithm for robust identification of non-linear gene regulatory networks
Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent n...
Saved in:
| Published in | BMC systems biology Vol. 6; no. 1; p. 119 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
London
BioMed Central
02.09.2012
BioMed Central Ltd |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1752-0509 1752-0509 |
| DOI | 10.1186/1752-0509-6-119 |
Cover
| Abstract | Background
Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction.
Results
We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both
in silico
and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the
in silico
networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the
in silico
and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data.
Conclusions
Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against
in silico
and
E. Coli
data, it can be applied to any biological system. |
|---|---|
| AbstractList | Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction.BACKGROUNDReverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction.We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data.RESULTSWe have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data.Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system.CONCLUSIONSOur integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. Background: Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results: We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. Conclusions: Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. Conclusions Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. Keywords: Gene regulatory networks, Non-linear dynamics, S-system, Robust network identification, Bootstrapping, Integer programming, Optimization algorithm Doc number: 119 Abstract Background: Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results: We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. Conclusions: Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. Conclusions Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. |
| ArticleNumber | 119 |
| Audience | Academic |
| Author | Banerjee, Ipsita Task, Keith Chemmangattuvalappil, Nishanth |
| AuthorAffiliation | 1 Department of Chemical Engineering, University of Pittsburgh, 1249 Benedum Hall, 3700 O’Hara Street, Pittsburgh, PA, 15261, USA |
| AuthorAffiliation_xml | – name: 1 Department of Chemical Engineering, University of Pittsburgh, 1249 Benedum Hall, 3700 O’Hara Street, Pittsburgh, PA, 15261, USA |
| Author_xml | – sequence: 1 givenname: Nishanth surname: Chemmangattuvalappil fullname: Chemmangattuvalappil, Nishanth organization: Department of Chemical Engineering, University of Pittsburgh – sequence: 2 givenname: Keith surname: Task fullname: Task, Keith organization: Department of Chemical Engineering, University of Pittsburgh – sequence: 3 givenname: Ipsita surname: Banerjee fullname: Banerjee, Ipsita email: ipb1@pitt.edu organization: Department of Chemical Engineering, University of Pittsburgh |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/22937832$$D View this record in MEDLINE/PubMed |
| BookMark | eNqFkttrHCEUxqWkNJf2uW9loC_NwyTexllfCkto2kCg0MuzOI5OTB3dqpN0-9fX7W6T3RAaRDzo7zscv3MOwZ4PXgPwGsEThGbsFLUNrmEDec1qhPgzcHB3s7cV74PDlK4hbAjG7QuwjzEn7YzgA9DNfWV91oOOVVhkO9rfMtvgK-mGEG2-GisTYhVDN6Vc2V77bI1VayaYqtRTO-u1jNWgva6iHiYnc4jLyut8G-KP9BI8N9Il_WpzHoHv5x--nX2qLz9_vDibX9aKMZxro3rZYd5BqHvMDOqlorrveMMMNbxpuSKcStn2aoZYy1ujoGwbKHtIITYEkSMA13knv5DLW-mcWEQ7yrgUCIqVXWJliFgZIkqMeJG8X0sWUzfqXpXfRXkvC9KK3Rdvr8QQbgShlHJMS4J3mwQx_Jx0ymK0SWnnpNdhSgIR1tIZQRw-jUKKCKYI44K-fYBehyn6Yl6hZrBlmBF2Tw3SaWG9CaVEtUoq5g2hmLCyC3XyCFVWr0eryjQZW-53BMc7gsJk_SsPckpJXHz9ssu-2fbvzrh_81WAZg2oGFKK2ghl89_hKVVY95_GnD7QPd3KTfdTIX0Z523PHpf8Abs7AEA |
| CitedBy_id | crossref_primary_10_1142_S0219720021500232 crossref_primary_10_2197_ipsjtbio_7_30 crossref_primary_10_1371_journal_pone_0083308 crossref_primary_10_3390_pr3020286 |
| Cites_doi | 10.1038/ng1532 10.1093/bioinformatics/bth448 10.1007/s001099900023 10.1093/bioinformatics/btm163 10.1073/pnas.151588598 10.1523/JNEUROSCI.23-21-07940.2003 10.1142/2792 10.1093/bioinformatics/btq139 10.1093/bioinformatics/bti071 10.1126/science.287.5456.1273 10.1371/journal.pcbi.0030189 10.1093/bioinformatics/btl003 10.1146/annurev.genet.34.1.479 10.1007/978-1-4899-4541-9 10.1093/bioinformatics/btp072 10.1186/1471-2105-11-S1-S56 10.1093/bioinformatics/bth318 10.1093/bioinformatics/18.2.261 10.1073/pnas.092576199 10.1186/1752-0509-2-35 10.1038/msb.2008.52 10.1038/msb4100120 10.1093/bioinformatics/btn075 10.1093/bioinformatics/bth463 10.1093/bioinformatics/btg027 10.1093/bioinformatics/bth389 10.1073/pnas.152046799 10.1109/CEC.2003.1299633 10.1016/S0169-7439(00)00102-7 10.1093/bioinformatics/btl090 |
| ContentType | Journal Article |
| Copyright | Chemmangattuvalappil et al.; licensee BioMed Central Ltd. 2012 This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. COPYRIGHT 2012 BioMed Central Ltd. 2012 Chemmangattuvalappil et al.; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Copyright ©2012 Chemmangattuvalappil et al.; licensee BioMed Central Ltd. 2012 Chemmangattuvalappil et al.; licensee BioMed Central Ltd. |
| Copyright_xml | – notice: Chemmangattuvalappil et al.; licensee BioMed Central Ltd. 2012 This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. – notice: COPYRIGHT 2012 BioMed Central Ltd. – notice: 2012 Chemmangattuvalappil et al.; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. – notice: Copyright ©2012 Chemmangattuvalappil et al.; licensee BioMed Central Ltd. 2012 Chemmangattuvalappil et al.; licensee BioMed Central Ltd. |
| DBID | C6C AAYXX CITATION CGR CUY CVF ECM EIF NPM ISR 3V. 7QL 7TM 7U9 7X7 7XB 88E 8FD 8FE 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA AZQEC BBNVY BENPR BHPHI C1K CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ H94 HCIFZ K9. LK8 M0S M1P M7N M7P P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS RC3 7X8 5PM ADTOC UNPAY |
| DOI | 10.1186/1752-0509-6-119 |
| DatabaseName | Springer Nature OA Free Journals CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed Gale In Context: Science ProQuest Central (Corporate) Bacteriology Abstracts (Microbiology B) Nucleic Acids Abstracts Virology and AIDS Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Natural Science Journals Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest One Sustainability ProQuest Central UK/Ireland ProQuest Central Essentials - QC Biological Science Collection ProQuest Central Natural Science Collection Environmental Sciences and Pollution Management ProQuest One ProQuest Central Korea Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student AIDS and Cancer Research Abstracts SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) Biological Sciences ProQuest Health & Medical Collection Medical Database Algology Mycology and Protozoology Abstracts (Microbiology C) Biological Science Database Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic (New) ProQuest Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Genetics Abstracts MEDLINE - Academic PubMed Central (Full Participant titles) Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) Publicly Available Content Database ProQuest Central Student Technology Research Database ProQuest One Academic Middle East (New) ProQuest Central Essentials Nucleic Acids Abstracts ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central China Environmental Sciences and Pollution Management ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Sustainability ProQuest Health & Medical Research Collection Genetics Abstracts Health Research Premium Collection Health and Medicine Complete (Alumni Edition) Natural Science Collection ProQuest Central Korea Bacteriology Abstracts (Microbiology B) Algology Mycology and Protozoology Abstracts (Microbiology C) Health & Medical Research Collection Biological Science Collection AIDS and Cancer Research Abstracts ProQuest Central (New) ProQuest Medical Library (Alumni) Virology and AIDS Abstracts ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest SciTech Collection ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest Medical Library ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic Genetics Abstracts MEDLINE Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: EIF name: MEDLINE url: https://proxy.k.utb.cz/login?url=https://www.webofscience.com/wos/medline/basic-search sourceTypes: Index Database – sequence: 4 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 5 dbid: BENPR name: ProQuest Central Database Suite (ProQuest) url: http://www.proquest.com/pqcentral?accountid=15518 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1752-0509 |
| EndPage | 119 |
| ExternalDocumentID | 10.1186/1752-0509-6-119 PMC3444924 2772076461 A534236423 22937832 10_1186_1752_0509_6_119 |
| Genre | Journal Article Research Support, N.I.H., Extramural |
| GeographicLocations | Iran |
| GeographicLocations_xml | – name: Iran |
| GrantInformation_xml | – fundername: NCCDPHP CDC HHS grantid: DP2-16520 |
| GroupedDBID | --- 0R~ 23N 2VQ 2WC 4.4 53G 5GY 5VS 6J9 7X7 88E 8FE 8FH 8FI 8FJ ABDBF ABUWG ACGFO ACGFS ACIHN ACPRK ACUHS ADBBV ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFRAH AHBYD AHMBA AHSBF AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AOIJS BAWUL BBNVY BCNDV BENPR BFQNJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK DU5 E3Z EBD EBS EJD EMOBN ESX F5P FYUFA GX1 H13 HCIFZ HMCUK HYE IAO IGS IHR INH INR ISR ITC KQ8 LK8 M1P M48 M7P O5R O5S OK1 OVT P2P PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RNS ROL RPM RSV SBL SJN SOJ SV3 TR2 TUS UKHRP WOQ ~8M AAYXX CITATION ALIPV CGR CUY CVF ECM EIF NPM 3V. 7QL 7TM 7U9 7XB 8FD 8FK AZQEC C1K DWQXO FR3 GNUQQ H94 K9. M7N P64 PKEHL PQEST PQUKI PRINS RC3 7X8 5PM ADTOC C1A IPNFZ RIG UNPAY |
| ID | FETCH-LOGICAL-c662t-fcdab29b00ed26f1dac4edb956f4f9579c394aa7dc816797fc0a750ad0402f313 |
| IEDL.DBID | M48 |
| ISSN | 1752-0509 |
| IngestDate | Sun Oct 26 03:36:19 EDT 2025 Tue Sep 30 16:57:50 EDT 2025 Thu Oct 02 07:08:12 EDT 2025 Fri Sep 05 10:58:21 EDT 2025 Tue Oct 07 05:51:13 EDT 2025 Mon Oct 20 22:49:43 EDT 2025 Mon Oct 20 16:57:35 EDT 2025 Thu Oct 16 16:17:19 EDT 2025 Thu Apr 03 07:07:22 EDT 2025 Thu Apr 24 22:58:33 EDT 2025 Wed Oct 01 02:15:33 EDT 2025 Sat Sep 06 07:24:48 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Robust network identification Bootstrapping Integer programming Gene regulatory networks Optimization algorithm Non-linear dynamics S-system |
| Language | English |
| License | This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c662t-fcdab29b00ed26f1dac4edb956f4f9579c394aa7dc816797fc0a750ad0402f313 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 ObjectType-Article-2 ObjectType-Feature-1 |
| OpenAccessLink | https://www.proquest.com/docview/1080762636?pq-origsite=%requestingapplication%&accountid=15518 |
| PMID | 22937832 |
| PQID | 1080762636 |
| PQPubID | 55238 |
| PageCount | 1 |
| ParticipantIDs | unpaywall_primary_10_1186_1752_0509_6_119 pubmedcentral_primary_oai_pubmedcentral_nih_gov_3444924 proquest_miscellaneous_1367483190 proquest_miscellaneous_1041324122 proquest_journals_1080762636 gale_infotracmisc_A534236423 gale_infotracacademiconefile_A534236423 gale_incontextgauss_ISR_A534236423 pubmed_primary_22937832 crossref_citationtrail_10_1186_1752_0509_6_119 crossref_primary_10_1186_1752_0509_6_119 springer_journals_10_1186_1752_0509_6_119 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012-09-02 |
| PublicationDateYYYYMMDD | 2012-09-02 |
| PublicationDate_xml | – month: 09 year: 2012 text: 2012-09-02 day: 02 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | BMC systems biology |
| PublicationTitleAbbrev | BMC Syst Biol |
| PublicationTitleAlternate | BMC Syst Biol |
| PublicationYear | 2012 |
| Publisher | BioMed Central BioMed Central Ltd |
| Publisher_xml | – name: BioMed Central – name: BioMed Central Ltd |
| References | K Basso (930_CR8) 2005; 37 MD Sutton (930_CR27) 2000; 34 S Huang (930_CR3) 1999; 77 R Morishita (930_CR20) 2003 RD Leclerc (930_CR24) 2008; 4 N Soranzo (930_CR9) 2007; 23 P-K Liu (930_CR15) 2008; 24 I Banerjee (930_CR25) 2010; 26 M Kabir (930_CR1) 2010; 11 S Kikuchi (930_CR16) 2003; 19 M Thattai (930_CR21) 2001; 98 MR DeWeese (930_CR23) 2003; 23 X-w Chen (930_CR5) 2006; 22 M Zou (930_CR11) 2005; 21 M Bansal (930_CR14) 2006; 22 M Vilela (930_CR19) 2008; 2 WE Vinje (930_CR22) 2000; 287 M Ronen (930_CR28) 2002; 99 S Imoto (930_CR6) 2002; 7 X Zhou (930_CR7) 2004; 20 R Wehrens (930_CR33) 2000; 54 RN Gutenkunst (930_CR32) 2007; 3 B Efron (930_CR26) 1993 S Kimura (930_CR12) 2009; 25 J Yu (930_CR10) 2004; 20 I Shmulevich (930_CR4) 2002; 18 M Bansal (930_CR2) 2007; 3 X Yao (930_CR31) 1999 MKS Yeung (930_CR13) 2002; 99 930_CR29 R Thomas (930_CR18) 2004; 20 CH Papadimitriou (930_CR30) 1998 S Kimura (930_CR17) 2005; 21 16543279 - Bioinformatics. 2006 Jun 1;22(11):1367-74 18682703 - Mol Syst Biol. 2008;4:213 11928473 - Pac Symp Biocomput. 2002;:175-86 12944525 - J Neurosci. 2003 Aug 27;23(21):7940-9 11847074 - Bioinformatics. 2002 Feb;18(2):261-74 10475062 - J Mol Med (Berl). 1999 Jun;77(6):469-80 15514004 - Bioinformatics. 2005 Apr 1;21(7):1154-63 19189976 - Bioinformatics. 2009 Apr 1;25(7):918-25 18416837 - BMC Syst Biol. 2008;2:35 11092836 - Annu Rev Genet. 2000;34:479-497 15247105 - Bioinformatics. 2004 Nov 22;20(17):3221-35 17922568 - PLoS Comput Biol. 2007 Oct;3(10):1871-78 17299415 - Mol Syst Biol. 2007;3:78 15778709 - Nat Genet. 2005 Apr;37(4):382-90 15284094 - Bioinformatics. 2004 Dec 12;20(18):3594-603 11438714 - Proc Natl Acad Sci U S A. 2001 Jul 17;98(15):8614-9 17485431 - Bioinformatics. 2007 Jul 1;23(13):1640-7 10678835 - Science. 2000 Feb 18;287(5456):1273-6 15308537 - Bioinformatics. 2005 Jan 1;21(1):71-9 20363729 - Bioinformatics. 2010 May 15;26(10):1332-9 15145802 - Bioinformatics. 2004 Nov 22;20(17):2918-27 12651723 - Bioinformatics. 2003 Mar 22;19(5):643-50 12145321 - Proc Natl Acad Sci U S A. 2002 Aug 6;99(16):10555-60 16418235 - Bioinformatics. 2006 Apr 1;22(7):815-22 11983907 - Proc Natl Acad Sci U S A. 2002 Apr 30;99(9):6163-8 18321886 - Bioinformatics. 2008 Apr 15;24(8):1085-92 20122231 - BMC Bioinformatics. 2010;11 Suppl 1:S56 |
| References_xml | – volume: 37 start-page: 382 issue: 4 year: 2005 ident: 930_CR8 publication-title: Nat Genet doi: 10.1038/ng1532 – volume: 20 start-page: 3594 issue: 18 year: 2004 ident: 930_CR10 publication-title: Bioinform doi: 10.1093/bioinformatics/bth448 – volume: 77 start-page: 469 issue: 6 year: 1999 ident: 930_CR3 publication-title: J Mole Med doi: 10.1007/s001099900023 – volume: 23 start-page: 1640 issue: 13 year: 2007 ident: 930_CR9 publication-title: Bioinform doi: 10.1093/bioinformatics/btm163 – volume: 98 start-page: 8614 issue: 15 year: 2001 ident: 930_CR21 publication-title: Proc Natl Acad Sci doi: 10.1073/pnas.151588598 – ident: 930_CR29 – volume: 23 start-page: 10 issue: 21 year: 2003 ident: 930_CR23 publication-title: J Neurosci doi: 10.1523/JNEUROSCI.23-21-07940.2003 – volume-title: Evolutionary computation: Theory and applications year: 1999 ident: 930_CR31 doi: 10.1142/2792 – volume: 26 start-page: 1332 issue: 10 year: 2010 ident: 930_CR25 publication-title: Bioinform doi: 10.1093/bioinformatics/btq139 – volume: 21 start-page: 1154 issue: 7 year: 2005 ident: 930_CR17 publication-title: Bioinform doi: 10.1093/bioinformatics/bti071 – volume: 287 start-page: 1273 issue: 5456 year: 2000 ident: 930_CR22 publication-title: Sci doi: 10.1126/science.287.5456.1273 – volume: 3 start-page: e189 issue: 10 year: 2007 ident: 930_CR32 publication-title: PLoS Comput Biol doi: 10.1371/journal.pcbi.0030189 – volume: 22 start-page: 815 issue: 7 year: 2006 ident: 930_CR14 publication-title: Bioinform doi: 10.1093/bioinformatics/btl003 – volume: 34 start-page: 479 issue: 1 year: 2000 ident: 930_CR27 publication-title: Annu Rev Genet doi: 10.1146/annurev.genet.34.1.479 – volume-title: An introduction to bootstrap year: 1993 ident: 930_CR26 doi: 10.1007/978-1-4899-4541-9 – volume: 25 start-page: 918 issue: 7 year: 2009 ident: 930_CR12 publication-title: Bioinform doi: 10.1093/bioinformatics/btp072 – volume: 11 start-page: S56 issue: Suppl 1 year: 2010 ident: 930_CR1 publication-title: BMC Bioinform doi: 10.1186/1471-2105-11-S1-S56 – volume: 20 start-page: 2918 issue: 17 year: 2004 ident: 930_CR7 publication-title: Bioinform doi: 10.1093/bioinformatics/bth318 – volume: 18 start-page: 261 issue: 2 year: 2002 ident: 930_CR4 publication-title: Bioinform doi: 10.1093/bioinformatics/18.2.261 – volume: 99 start-page: 6163 issue: 9 year: 2002 ident: 930_CR13 publication-title: Proc Natl Acad Sci doi: 10.1073/pnas.092576199 – volume: 2 start-page: 35 issue: 1 year: 2008 ident: 930_CR19 publication-title: BMC Syst Biol doi: 10.1186/1752-0509-2-35 – volume: 4 start-page: 213 year: 2008 ident: 930_CR24 publication-title: Mol Syst Biol doi: 10.1038/msb.2008.52 – volume: 3 start-page: 122 year: 2007 ident: 930_CR2 publication-title: Mol Syst Biol doi: 10.1038/msb4100120 – volume: 24 start-page: 1085 issue: 8 year: 2008 ident: 930_CR15 publication-title: Bioinform doi: 10.1093/bioinformatics/btn075 – volume: 21 start-page: 71 issue: 1 year: 2005 ident: 930_CR11 publication-title: Bioinform doi: 10.1093/bioinformatics/bth463 – volume: 19 start-page: 643 issue: 5 year: 2003 ident: 930_CR16 publication-title: Bioinform doi: 10.1093/bioinformatics/btg027 – volume: 20 start-page: 3221 issue: 17 year: 2004 ident: 930_CR18 publication-title: Bioinform doi: 10.1093/bioinformatics/bth389 – volume: 99 start-page: 10555 issue: 16 year: 2002 ident: 930_CR28 publication-title: Proc Natl Acad Sci doi: 10.1073/pnas.152046799 – volume: 7 start-page: 12 year: 2002 ident: 930_CR6 publication-title: Pac symp Biocomput – start-page: 615 volume-title: Evolutionary Computation, 2003 CEC '03 The 2003 Congress on: 8–12 Dec. 2003 2003 year: 2003 ident: 930_CR20 doi: 10.1109/CEC.2003.1299633 – volume: 54 start-page: 18 year: 2000 ident: 930_CR33 publication-title: Chemometrics and Intelligent Laboratory Syst doi: 10.1016/S0169-7439(00)00102-7 – volume: 22 start-page: 1367 issue: 11 year: 2006 ident: 930_CR5 publication-title: Bioinform doi: 10.1093/bioinformatics/btl090 – volume-title: Combinatorial optimization: Algorithms and complexity year: 1998 ident: 930_CR30 – reference: 12944525 - J Neurosci. 2003 Aug 27;23(21):7940-9 – reference: 11928473 - Pac Symp Biocomput. 2002;:175-86 – reference: 15247105 - Bioinformatics. 2004 Nov 22;20(17):3221-35 – reference: 15308537 - Bioinformatics. 2005 Jan 1;21(1):71-9 – reference: 20363729 - Bioinformatics. 2010 May 15;26(10):1332-9 – reference: 20122231 - BMC Bioinformatics. 2010;11 Suppl 1:S56 – reference: 19189976 - Bioinformatics. 2009 Apr 1;25(7):918-25 – reference: 11092836 - Annu Rev Genet. 2000;34:479-497 – reference: 11438714 - Proc Natl Acad Sci U S A. 2001 Jul 17;98(15):8614-9 – reference: 11983907 - Proc Natl Acad Sci U S A. 2002 Apr 30;99(9):6163-8 – reference: 12651723 - Bioinformatics. 2003 Mar 22;19(5):643-50 – reference: 12145321 - Proc Natl Acad Sci U S A. 2002 Aug 6;99(16):10555-60 – reference: 18416837 - BMC Syst Biol. 2008;2:35 – reference: 15778709 - Nat Genet. 2005 Apr;37(4):382-90 – reference: 10475062 - J Mol Med (Berl). 1999 Jun;77(6):469-80 – reference: 15514004 - Bioinformatics. 2005 Apr 1;21(7):1154-63 – reference: 16543279 - Bioinformatics. 2006 Jun 1;22(11):1367-74 – reference: 16418235 - Bioinformatics. 2006 Apr 1;22(7):815-22 – reference: 17922568 - PLoS Comput Biol. 2007 Oct;3(10):1871-78 – reference: 17485431 - Bioinformatics. 2007 Jul 1;23(13):1640-7 – reference: 17299415 - Mol Syst Biol. 2007;3:78 – reference: 18682703 - Mol Syst Biol. 2008;4:213 – reference: 15284094 - Bioinformatics. 2004 Dec 12;20(18):3594-603 – reference: 15145802 - Bioinformatics. 2004 Nov 22;20(17):2918-27 – reference: 10678835 - Science. 2000 Feb 18;287(5456):1273-6 – reference: 18321886 - Bioinformatics. 2008 Apr 15;24(8):1085-92 – reference: 11847074 - Bioinformatics. 2002 Feb;18(2):261-74 |
| SSID | ssj0053227 |
| Score | 1.990567 |
| Snippet | Background
Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes.... Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high... Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes.... Doc number: 119 Abstract Background: Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision... Background: Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes.... |
| SourceID | unpaywall pubmedcentral proquest gale pubmed crossref springer |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 119 |
| SubjectTerms | Algorithms Analysis Bioinformatics Biomedical and Life Sciences Case studies Cellular and Medical Topics Computational Biology - methods Computational Biology/Bioinformatics Confidence intervals DNA Repair E coli Escherichia coli Escherichia coli - genetics Gene expression Gene Regulatory Networks Genes Genetic algorithms Genetic research Hypotheses Life Sciences Mathematical optimization Methods Models, Genetic Noise Noise control Nonlinear Dynamics Objective function Ordinary differential equations Physiological Research Article Reverse engineering Simulation and Modeling software and technology Sparsity Systems Biology Time series Topology Transcriptome Uncertainty |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV3da9RAEB_qFVEfxG-jVVYRtA_bXjbfDyKntFTBQ6qFvoXNZrctXJMzH8j9984km3hXaH072Amb7M7Hb29mfwPwLnC90JcJ2ndgEu6bKOPSmyqOoUBSAtIVhi4Kf5-HRyf-t9PgdAvmw10YKqscfGLnqPNS0X_k-1QLFxF1Svhp-ZtT1yjKrg4tNKRtrZB_7CjGbsE2zTOdwPbng_mP48E3B6i-kSX4ceNwH2On4MSAwkPuEtnOWmy66qHXQtTV8skxh3oP7rTFUq7-yMViLUwdPoD7Fl-yWa8QD2FLF4_gdt9xcvUYslnBOoYIXbESvcWlvYbJ5OIMv7Y5v2SIYllVZm3dsIvc1hL1MqVhRVlwAqayYqh5mlV9K_uyWrGiLyivn8DJ4cGvL0fctlngKgxFw43KZSaIG1HnIjRuLpWv8wwPTsY3lMVTXuJLGeUqppxNZNRUIs6QOdq_MJ7rPYUJzq6fA0PwE0YqzjLXeOgZvCSQxPAea1fmbqy1A3vDAqfKcpBTK4xF2p1F4jClHUlpR1L87SYOfBgfWPb0G9eLvqUdS4nUoqCqmTPZ1nX69edxOguI5xBPWp4D762QKXFiJe0lBHx94sHakNzZkESrU5vDg2Kk1urr9J-OOvBmHKYnqZKt0GVLMggbEDYJcYOMRy1g0DlOHXjW69r49QLxWYRu2IFoQwtHAeIL3xwpLs473nDP9308bjuwO-jr-qtfs6i7o0L_bwNe3LwkL-Eugk3R1eeJHZg0VatfIaBrstfWSv8CUDdH9w priority: 102 providerName: ProQuest – databaseName: Springer Nature OA Free Journals dbid: C6C link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9RAEB-kItoH8dtolVUE7cPq7W6ySR6PYqmCPqiFvoXNZrctXJOSu1Duv3cm2QuXYhXfAjubr_lmZn8D8C4RSscmR_1OfM5jn5bcqJnl6AoMFSCF9HRQ-Nt3fXQcfz1JTgJIEp2F2a7fi0x_Qu8mOWGUcM0FwXveRg-l-6qsPtiY3ASlMg24PX_YNHE51w3vlue53hU5lkZ34W5XX5r1lVkstrzP4QO4H8JGNh_4_BBuufoR3BkGSa4fQzmvWQ_84FrWoBG4CKcrmVmcNpj-n10wDE5Z25TdcsXOq9AiNNA0ntVNzSneNC1DgXKsHSbUN-2a1UOf-PIJHB9-_nVwxMP0BG61livubWVKSZCHrpLai8rY2FUl5kM-9lScsyqPjUkrm1EpJvV2ZjB8MBWqtfRKqKewg093z4FhTKNTm5Wl8AoVXuWJIeD2zAlTicy5CD5ufnBhA7Q4TbhYFH2KkemCOFIQRwq8FnkEH8YNlwOqxs2kb4ljBWFV1NQMc2q65bL48vNHMU8IvhATKBXB-0DkG3ywNeFsAb4-wVtNKPcmlKhMdrq8EYwiKPOyx1BNCbVHR_BmXKad1KBWu6YjGowGMBqS8i80iia7oM2bRfBskLXx6yWGXSla1wjSiRSOBAQDPl2pz896OHAVxzFm0RHsb-R1-9Vv-Kn7o0D_iwEv_uO-L-EeBpSy78GTe7Czajv3CoO2Vfm6V9jfmFM4ow priority: 102 providerName: Springer Nature – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3di9NAEB-kh6gPfn9ET1lF0HtIr9kkm_SxiMcpeIhaOJ_CZrPbq7ZJSROk_vXOJNvQFE8RfAvsLMlu5uO37MxvAF6Gni8COUb7Ds3YDUyUutIfKRdDgaQLSI8bKhT-cCZOp8H78_DcUgpRLUy6VERhTAxEw90C9EVb30D9E3R5vMpMa-6xOMb4x11iMXGF6xEB6IEIEZYP4GB69nHytSmItBKW2uc3s3pRad837wSn_cTJ7vb0Blyr85Xc_JCLxU6AOrkF37ZLa_NSvg_rKh2qn3usj_9l7bfhpoWxbNLq3R24ovO7cLVtbLm5B-kkZw0RhS5ZgU5paas9mVzMinJeXSwZgmVWFmm9rtg8sylLrUxhWF7kLuFfWTJUcM1KPaM2Y0W5YXmbt76-D9OTt1_enLq2m4OrhOCVa1QmU04UjDrjwniZVIHOUjyfmcDQZaHyx4GUUaZiuhqKjBpJhDMyQzfDje_5D2CAb9ePgCHGEpGK09QzPjogfxxKIpKPtSczL9bageH2bybKUp1Tx41F0hx5YpHQxiW0cQk-e2MHXncTVi3Lx-WiL0g9EuLOyCk5Zybr9Tp59_lTMgmJThEPdL4Dr6yQKfDFStpaB_x8otvqSR72JNG4VX94q4WJdS7rhtM1IhYh4cDzbphmUsJcrouaZBCdIDrj_A8yPnWaQR88cuBhq9jd6jnCwAi9vQNRT-U7AaIl74_k84uGntwPggBP9Q4cbY1j99Mv2dSjznr-9gMe_4PsE7iOAJc3OYH8EAZVWeunCCKr9Jl1D78ApPlriA priority: 102 providerName: Unpaywall |
| Title | An integer optimization algorithm for robust identification of non-linear gene regulatory networks |
| URI | https://link.springer.com/article/10.1186/1752-0509-6-119 https://www.ncbi.nlm.nih.gov/pubmed/22937832 https://www.proquest.com/docview/1080762636 https://www.proquest.com/docview/1041324122 https://www.proquest.com/docview/1367483190 https://pubmed.ncbi.nlm.nih.gov/PMC3444924 https://bmcsystbiol.biomedcentral.com/counter/pdf/10.1186/1752-0509-6-119 |
| UnpaywallVersion | publishedVersion |
| Volume | 6 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: BioMed Central Open Access Free customDbUrl: eissn: 1752-0509 dateEnd: 20191231 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: RBZ dateStart: 20070101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1752-0509 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: KQ8 dateStart: 20070101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1752-0509 dateEnd: 20190812 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: ABDBF dateStart: 20070101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVBFR databaseName: Free Medical Journals customDbUrl: eissn: 1752-0509 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: DIK dateStart: 20070101 isFulltext: true titleUrlDefault: http://www.freemedicaljournals.com providerName: Flying Publisher – providerCode: PRVFQY databaseName: GFMER Free Medical Journals customDbUrl: eissn: 1752-0509 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: GX1 dateStart: 0 isFulltext: true titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php providerName: Geneva Foundation for Medical Education and Research – providerCode: PRVAQN databaseName: PubMed Central customDbUrl: eissn: 1752-0509 dateEnd: 20191231 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: RPM dateStart: 20070101 isFulltext: true titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/ providerName: National Library of Medicine – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1752-0509 dateEnd: 20190131 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central Database Suite (ProQuest) customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1752-0509 dateEnd: 20190131 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVFZP databaseName: Scholars Portal Open Access Journals customDbUrl: eissn: 1752-0509 dateEnd: 20190430 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: M48 dateStart: 20070501 isFulltext: true titleUrlDefault: http://journals.scholarsportal.info providerName: Scholars Portal – providerCode: PRVAVX databaseName: Springer Nature OA Free Journals customDbUrl: eissn: 1752-0509 dateEnd: 20190112 omitProxy: true ssIdentifier: ssj0053227 issn: 1752-0509 databaseCode: C6C dateStart: 20070106 isFulltext: true titleUrlDefault: http://www.springeropen.com/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3db9MwED_BJgQ8IL4JjMogJNhDRuMkTvKAUFdtGkirpkKlwkvkOPZWKUtG2gr633OXpKGZNuClauVLk_i-deffAbzxHVd4MkL99k1keyZIbOn2lY2uQFIB0uGGDgofj8TRxPs89ad_xgE1Gzi_MrWjeVKTMtv79WP1ERX-Q6XwoXiPHpDbhGNiC9shCNBtdFMRzXE49tqSgo-SW01aWRM3OD9X_EHHRV021Bue6nIXZVtKvQu3l_mFXP2UWbbhrQ7vw70mzGSDWi4ewA2dP4Rb9eDJ1SNIBjmrgCJ0yQo0GufNaUwms9OinC3OzhkGs6wskuV8wWZp01JU0xSG5UVuU3wqS4YCqFlZT7QvyhXL677y-WOYHB58HR7ZzbQFWwnBF7ZRqUw4QSTqlAvjpFJ5Ok0wfzKeoWKeciNPyiBVIZVuAqP6EsMNmaIZ4MZ13CewhXfXz4BhDCQCFSaJY1w0EG7kSwJ6D7UjUyfU2oK99QbHqoEip4kYWVylJKGIiSMxcSTG705kwbv2gosaheN60tfEsZiwLXJqnjmVy_k8_vRlHA98gjvEhMu14G1DZAq8sZLNWQR8fILD6lDudChR-VR3eS0Y8Vp2K8zVgFB-hAWv2mW6khracl0siQajB4yeOP8LjUuTYNBG9i14Wsta-_Ycw7QArbEFQUcKWwKCDe-u5LOzCj7c9TwPs24Ldtfyuvno12zqbivQ_2LA8__n1Qu4g_Enr1r2-A5sLcqlfokx3iLpwc1gGvRge_9gdDLGX0Mx7FX6jJ_j_e-4MhmdDL79BnMRTrY |
| linkProvider | Scholars Portal |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEB6VVqhwQLwxFFgQCHowjdfvQ4UCtEpoG6HSSr2Z9Xo3rZTaIU5U5c_x25ix1yap1HLqzdKOH5mdZ3bmG4B3vuMGnohRv30d254OU1u4HWmjKxB0AOlwTY3CB4Ogd-x9P_FPVuBP0wtDZZWNTawMdVZI-o98i2rhQoJOCT6Pf9s0NYpOV5sRGsKMVsi2K4gx09ixp-YXmMKV2_1vuN_vOd_dOfras82UAVsGAZ_aWmYi5QQNqDIeaCcT0lNZinmD9jQdYkk39oQIMxnRkUWoZUegmxUZij_XruPic2_Bmud6MSZ_a192Bj8OG1_go7qEBlDIiYIt9NXcJsQVO7AdAvdZ8IWXPcKCS7xcrtme2d6F9Vk-FvMLMRotuMXd-3DPxLOsWwvgA1hR-UO4XU-4nD-CtJuzCpFCTViB1unctH0yMRoid6en5wyjZjYp0lk5ZWeZqV2qaQrN8iK3KRAWE4aSrthEDWneWDGZs7wuYC8fw_GNMPwJrOLb1TNgGGwFoYzS1NEuWiI39gUhykfKEZkTKWXBp4bBiTSY5zR6Y5RUuU8UJLQjCe1IgtdObMHH9oZxDfdxNelb2rGEQDRyqtIZillZJv2fh0nXJ1xFzOxcCz4YIl3gi6UwTQ_4-YS7tUS5sUSJWi6XlxvBSIyVKZN_OmHBm3aZ7qTKuVwVM6LBMAXDNM6voXFp5Awa444FT2tZa389x3gwRLNvQbgkhS0B4ZMvr-RnpxVOuet5Hqb3Fmw28rr46VcwdbMV6P9twPPrWfIa1ntHB_vJfn-w9wLuYKDLq9pAvgGr08lMvcRgcpq-MhrL4NdNG4m_5LqGMw |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Zb9QwELZQEdcD4ioEChiEBH0w3TiOk31cLaxajgoBlfoWOY7drrR1VjmE9t8zk0ubioJ4i-RxLs_xWTP-hpA3oR9IoaZg36GdMmGjlKlgohmEAoUJSJ9bPCj89VgenohPp-FpV5tT9tXufUqyPdOALE2uOlhntjXxWB5AzOMMmUuYZD6Sfl4XENqwgcFczntHHIKuRh2bzx8mjQLRZXe8FY8u10oOCdM75Fbt1mrzS61WWzFpcY_c7cAknbWrf59cM-4BudG2l9w8JOnM0YYOwhQ0B9dw0Z25pGp1lhfL6vyCAmSlRZ7WZUWXWVc41MrklrrcMUShqqCgZoYWbd_6vNhQ11aPl4_IyeLjz_kh63oqMC0lr5jVmUo5EiGajEvrZ0oLk6WwS7LCYspOB1OhVJTpGBM0kdUTBaBCZWDs3AZ-sEt24OnmCaGAdGSk4zT1bQBuIJiGCuncY-OrzI-N8cj7_gcnuiMcx74Xq6TZeMQywRVJcEUSuPanHnk3TFi3XBtXi77GFUuQwcJhicyZqssyOfrxPZmFSGoI26rAI287IZvDg7XqThzA6yPp1UhybyQJJqbHw71iJJ2Jlw2zaoRcPtIjr4ZhnIlla87kNcoARgCMxPlfZALs9wKecOKRx62uDV_PAYxF4HM9Eo20cBBAcvDxiFueNyThgRAC9tYe2e_1dfvVr_ip-4NC_2sBnv7HfV-Sm98-LJIvR8efn5HbgDh5U6TH98hOVdTmOaC6Kn3R2O5vqEBD2Q |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3di9NAEB-kh6gPfn9ET1lF0HtIr9kkm_SxiMcpeIhaOJ_CZrPbq7ZJSROk_vXOJNvQFE8RfAvsLMlu5uO37MxvAF6Gni8COUb7Ds3YDUyUutIfKRdDgaQLSI8bKhT-cCZOp8H78_DcUgpRLUy6VERhTAxEw90C9EVb30D9E3R5vMpMa-6xOMb4x11iMXGF6xEB6IEIEZYP4GB69nHytSmItBKW2uc3s3pRad837wSn_cTJ7vb0Blyr85Xc_JCLxU6AOrkF37ZLa_NSvg_rKh2qn3usj_9l7bfhpoWxbNLq3R24ovO7cLVtbLm5B-kkZw0RhS5ZgU5paas9mVzMinJeXSwZgmVWFmm9rtg8sylLrUxhWF7kLuFfWTJUcM1KPaM2Y0W5YXmbt76-D9OTt1_enLq2m4OrhOCVa1QmU04UjDrjwniZVIHOUjyfmcDQZaHyx4GUUaZiuhqKjBpJhDMyQzfDje_5D2CAb9ePgCHGEpGK09QzPjogfxxKIpKPtSczL9bageH2bybKUp1Tx41F0hx5YpHQxiW0cQk-e2MHXncTVi3Lx-WiL0g9EuLOyCk5Zybr9Tp59_lTMgmJThEPdL4Dr6yQKfDFStpaB_x8otvqSR72JNG4VX94q4WJdS7rhtM1IhYh4cDzbphmUsJcrouaZBCdIDrj_A8yPnWaQR88cuBhq9jd6jnCwAi9vQNRT-U7AaIl74_k84uGntwPggBP9Q4cbY1j99Mv2dSjznr-9gMe_4PsE7iOAJc3OYH8EAZVWeunCCKr9Jl1D78ApPlriA |
| 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=An+integer+optimization+algorithm+for+robust+identification+of+non-linear+gene+regulatory+networks&rft.jtitle=BMC+systems+biology&rft.au=Chemmangattuvalappil%2C+Nishanth&rft.au=Task%2C+Keith&rft.au=Banerjee%2C+Ipsita&rft.date=2012-09-02&rft.issn=1752-0509&rft.eissn=1752-0509&rft.volume=6&rft.issue=1&rft_id=info:doi/10.1186%2F1752-0509-6-119&rft.externalDBID=n%2Fa&rft.externalDocID=10_1186_1752_0509_6_119 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1752-0509&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1752-0509&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1752-0509&client=summon |