Speeding up the core algorithm for the dual calculation of minimal cut sets in large metabolic networks
Background The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the...
Saved in:
| Published in | BMC bioinformatics Vol. 21; no. 1; pp. 1 - 21 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
London
BioMed Central
09.11.2020
BioMed Central Ltd Springer Nature B.V BMC |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1471-2105 1471-2105 |
| DOI | 10.1186/s12859-020-03837-3 |
Cover
| Abstract | Background
The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS
2
approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS
2
approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations.
Results
In this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS
2
approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables.
Conclusions
Our results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework. |
|---|---|
| AbstractList | The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS.sup.2 approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS.sup.2 approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations. In this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS.sup.2 approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables. Our results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework. Background The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS 2 approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS 2 approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations. Results In this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS 2 approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables. Conclusions Our results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework. The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS2 approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS2 approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations.BACKGROUNDThe concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS2 approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS2 approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations.In this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS2 approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables.RESULTSIn this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS2 approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables.Our results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework.CONCLUSIONSOur results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework. Abstract Background The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS2 approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS2 approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations. Results In this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS2 approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables. Conclusions Our results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework. Background The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS.sup.2 approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS.sup.2 approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations. Results In this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS.sup.2 approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables. Conclusions Our results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework. Keywords: Constraint-based modeling, Stoichiometric modeling, Metabolic networks, Metabolic engineering, Computational strain design, Duality, Elementary modes Background The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS2 approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS2 approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to further enhance MCS computations. Results In this work, we introduce several new variants and modifications of duality-based MCS algorithms and benchmark their effects on the overall performance. As one major result, we generalize the original MCS2 approach (which was limited to blocking the operation of certain target reactions) to the most general case of MCS computations with arbitrary target and desired regions. Building upon these developments, we introduce a new MILP variant which allows maximal flexibility in the formulation of MCS problems and fully leverages the reduced size of the nullspace-based dual system. With a comprehensive set of benchmarks, we show that the MILP with the nullspace-based dual system outperforms the MILP with the Farkas-lemma-based dual system speeding up MCS computation with an averaged factor of approximately 2.5. We furthermore present several simplifications in the formulation of constraints, mainly related to binary variables, which further enhance the performance of MCS-related MILP. However, the benchmarks also reveal that some highly condensed formulations of constraints, especially on reversible reactions, may lead to worse behavior when compared to variants with a larger number of (more explicit) constraints and involved variables. Conclusions Our results further enhance the algorithmic toolbox for MCS calculations and are of general importance for theoretical developments as well as for practical applications of the MCS framework. |
| ArticleNumber | 510 |
| Audience | Academic |
| Author | Klamt, Steffen Mahadevan, Radhakrishnan von Kamp, Axel |
| Author_xml | – sequence: 1 givenname: Steffen orcidid: 0000-0003-2563-7561 surname: Klamt fullname: Klamt, Steffen email: klamt@mpi-magdeburg.mpg.de organization: Max Planck Institute for Dynamics of Complex Technical Systems – sequence: 2 givenname: Radhakrishnan orcidid: 0000-0002-1270-9063 surname: Mahadevan fullname: Mahadevan, Radhakrishnan organization: Department of Chemical Engineering and Applied Chemistry, University of Toronto – sequence: 3 givenname: Axel orcidid: 0000-0002-2956-7815 surname: von Kamp fullname: von Kamp, Axel organization: Max Planck Institute for Dynamics of Complex Technical Systems |
| BookMark | eNqNUktrFjEUHaRiH_oHXAXc6GJqHjNJZiOU4qNQEKyuQyZzZ5qaST6TjLX_3nwPrF-RIlkknJxz7s09Oa4OfPBQVS8JPiVE8reJUNl2Naa4xkwyUbMn1RFpBKkpwe3BX-fD6jilG4yJkLh9Vh0yRriQghxV09UKYLB-QssK5WtAJkRA2k0h2nw9ozHEDTws2iGjnVmczjZ4FEY0W2_nNbxklCAnZD1yOk6AZsi6D84a5CHfhvg9Pa-ejtoleLHbT6pvH95_Pf9UX37-eHF-dlkbTmSumewGJhgfGAaOaYO7QQAlIHCPGaOc9L2gYwcNB0pJX3DRjaJhLRPQy25kJ9XF1ncI-katYmkw3qmgrdoAIU5Kx2yNA9UNkhAjRtyPshG8LdbYGAPUDLzrMS9ebOu1-JW-u9XO_TEkWK0jUNsIVIlAbSJQrKjebVWrpZ9hMOBz1G6vlf0bb6_VFH6q0kKDG1oMXu8MYvixQMpqtsmAc9pDWJKiTduxhssWF-qrB9SbsERfBlxYZaAtxa28Z026PNv6MZS6Zm2qznhDqcC8Wb_29B-ssgaYrSk_b7QF3xO82RMUToZfedJLSuri6ss-V265JoaUIozK2Lz5SKWIdY_Pkz6Q_lcIu-hSIfsJ4v1gHlH9BpYaBPI |
| CitedBy_id | crossref_primary_10_1016_j_ymben_2024_07_003 crossref_primary_10_1089_cmb_2022_0319 crossref_primary_10_1007_s11538_024_01293_1 crossref_primary_10_1038_s41598_022_18177_w crossref_primary_10_1186_s12934_023_02277_x crossref_primary_10_1016_j_coisb_2021_100392 crossref_primary_10_3390_pr9020322 crossref_primary_10_3389_fpsyg_2022_750713 crossref_primary_10_3390_land13081199 |
| Cites_doi | 10.1093/bioinformatics/btv217 10.1016/S0167-7799(98)01290-6 10.1093/bioinformatics/btx171 10.1089/cmb.2007.0229 10.1093/bioinformatics/bty656 10.1016/j.biosystems.2005.04.009 10.1093/bioinformatics/btr674 10.1038/ncomms5893 10.1093/bioinformatics/btw072 10.1093/bioinformatics/bty1027 10.1038/ncomms15956 10.1371/journal.pcbi.1008110 10.1038/s41467-018-07719-4 10.1038/nrg3643 10.1093/bioinformatics/btg395 10.1038/s41467-017-00555-y 10.1186/1471-2105-14-318 10.1093/bioinformatics/btv649 10.1371/journal.pcbi.1003378 10.1101/2020.02.21.954792 10.1186/s12859-019-3329-9 10.1371/journal.pcbi.1005409 10.15252/msb.20167411 10.1016/j.ymben.2010.12.004 10.1093/bioinformatics/btz393 10.1023/A:1020390132244 10.1016/j.ymben.2015.05.006 10.1007/978-3-319-08437-4_5 10.1016/j.jbiotec.2017.05.001 10.1109/TCBB.2013.116 10.1038/nrmicro2737 10.1186/1752-0509-1-2 10.1016/j.ymben.2016.05.008 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2020 COPYRIGHT 2020 BioMed Central Ltd. 2020. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2020 – notice: COPYRIGHT 2020 BioMed Central Ltd. – notice: 2020. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION ISR 3V. 7QO 7SC 7X7 7XB 88E 8AL 8AO 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ JQ2 K7- K9. L7M LK8 L~C L~D M0N M0S M1P M7P P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 5PM ADTOC UNPAY DOA |
| DOI | 10.1186/s12859-020-03837-3 |
| DatabaseName | Springer Nature OA Free Journals CrossRef Gale In Context: Science ProQuest Central (Corporate) Biotechnology Research Abstracts Computer and Information Systems Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology 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 Advanced Technologies & Computer Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Technology Collection Natural Science Collection ProQuest One ProQuest Central Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) Advanced Technologies Database with Aerospace Biological Sciences Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database ProQuest Health & Medical Collection Medical Database Biological Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic 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 ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) Unpaywall for CDI: Periodical Content Unpaywall DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ProQuest One Applied & Life Sciences ProQuest One Sustainability Health Research Premium Collection Natural Science Collection Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Advanced Technologies & Aerospace Collection ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic 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 Pharma Collection ProQuest Central ProQuest Health & Medical Research Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) ProQuest Central Korea Advanced Technologies Database with Aerospace ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Medical Library ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: C6C name: SpringerOpen Free (Free internet resource, activated by CARLI) url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 3 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository – sequence: 4 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1471-2105 |
| EndPage | 21 |
| ExternalDocumentID | oai_doaj_org_article_9d811c7f0bf84765bb70ccce2cd69b06 10.1186/s12859-020-03837-3 PMC7654042 A642270646 10_1186_s12859_020_03837_3 |
| GeographicLocations | Germany |
| GeographicLocations_xml | – name: Germany |
| GrantInformation_xml | – fundername: Bundesministerium für Bildung und Forschung grantid: 031B0524B; 031L0104B funderid: http://dx.doi.org/10.13039/501100002347 – fundername: Projekt DEAL – fundername: European Research Council grantid: 721176 – fundername: ; – fundername: ; grantid: 721176 – fundername: ; grantid: 031B0524B; 031L0104B |
| GroupedDBID | --- 0R~ 23N 2WC 53G 5VS 6J9 7X7 88E 8AO 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AAKPC AASML ABDBF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS AZQEC BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK DU5 DWQXO E3Z EAD EAP EAS EBD EBLON EBS EMB EMK EMOBN ESX F5P FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HMCUK HYE IAO ICD IHR INH INR ISR ITC K6V K7- KQ8 LK8 M1P M48 M7P MK~ ML0 M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RNS ROL RPM RSV SBL SOJ SV3 TR2 TUS UKHRP W2D WOQ WOW XH6 XSB AAYXX CITATION 3V. 7QO 7SC 7XB 8AL 8FD 8FK FR3 JQ2 K9. L7M L~C L~D M0N P64 PKEHL PQEST PQUKI PRINS Q9U 7X8 5PM 123 2VQ 4.4 ADRAZ ADTOC AHSBF C1A EJD H13 IPNFZ RIG UNPAY |
| ID | FETCH-LOGICAL-c618t-389d3736d30e602409d7e21e70b033261bb72f9e46e221be7079f743537eb89f3 |
| IEDL.DBID | UNPAY |
| ISSN | 1471-2105 |
| IngestDate | Fri Oct 03 12:42:34 EDT 2025 Sun Oct 26 03:42:09 EDT 2025 Tue Sep 30 16:52:24 EDT 2025 Fri Sep 05 08:40:17 EDT 2025 Mon Oct 06 18:38:50 EDT 2025 Mon Oct 20 22:16:02 EDT 2025 Mon Oct 20 16:26:03 EDT 2025 Thu Oct 16 13:55:55 EDT 2025 Wed Oct 01 04:15:35 EDT 2025 Thu Apr 24 23:01:36 EDT 2025 Sat Sep 06 07:27:25 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Computational strain design Stoichiometric modeling Metabolic networks Metabolic engineering Duality Constraint-based modeling Elementary modes |
| Language | English |
| License | Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. 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 in a credit line to the data. cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c618t-389d3736d30e602409d7e21e70b033261bb72f9e46e221be7079f743537eb89f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0002-2956-7815 0000-0003-2563-7561 0000-0002-1270-9063 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://bmcbioinformatics.biomedcentral.com/track/pdf/10.1186/s12859-020-03837-3 |
| PMID | 33167871 |
| PQID | 2461852058 |
| PQPubID | 44065 |
| PageCount | 21 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_9d811c7f0bf84765bb70ccce2cd69b06 unpaywall_primary_10_1186_s12859_020_03837_3 pubmedcentral_primary_oai_pubmedcentral_nih_gov_7654042 proquest_miscellaneous_2459346850 proquest_journals_2461852058 gale_infotracmisc_A642270646 gale_infotracacademiconefile_A642270646 gale_incontextgauss_ISR_A642270646 crossref_citationtrail_10_1186_s12859_020_03837_3 crossref_primary_10_1186_s12859_020_03837_3 springer_journals_10_1186_s12859_020_03837_3 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2020-11-09 |
| PublicationDateYYYYMMDD | 2020-11-09 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-11-09 day: 09 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London |
| PublicationTitle | BMC bioinformatics |
| PublicationTitleAbbrev | BMC Bioinformatics |
| PublicationYear | 2020 |
| Publisher | BioMed Central BioMed Central Ltd Springer Nature B.V BMC |
| Publisher_xml | – name: BioMed Central – name: BioMed Central Ltd – name: Springer Nature B.V – name: BMC |
| References | S Schuster (3837_CR25) 1999; 17 NE Lewis (3837_CR3) 2012; 10 I Apaolaza (3837_CR8) 2017; 8 A Bordbar (3837_CR1) 2014; 15 B-J Harder (3837_CR9) 2016; 38 R Mahadevan (3837_CR18) 2015; 31 A von Kamp (3837_CR33) 2017; 261 A von Kamp (3837_CR7) 2014; 10 S Klamt (3837_CR27) 2002; 29 L Chindelevitch (3837_CR31) 2014; 5 I Apaolaza (3837_CR20) 2019; 35 H-S Song (3837_CR23) 2017; 33 S Klamt (3837_CR26) 2017; 13 A von Kamp (3837_CR11) 2017; 8 UU Haus (3837_CR14) 2008; 15 A Röhl (3837_CR22) 2019; 35 L Tobalina (3837_CR19) 2016; 32 N Venayak (3837_CR12) 2018; 9 PS Bekiaris (3837_CR29) 2020; 21 R Miraskarshahi (3837_CR21) 2019; 35 S Klamt (3837_CR4) 2004; 20 3837_CR10 S Klamt (3837_CR5) 2006; 83 P Schneider (3837_CR24) 2020; 16 O Hädicke (3837_CR6) 2011; 13 K Ballerstein (3837_CR15) 2012; 28 C Jungreuthmayer (3837_CR16) 2013; 14 S Klamt (3837_CR30) 2015; 30 S Klamt (3837_CR2) 2014 MP Gerstl (3837_CR13) 2016; 32 3837_CR17 BJ Sánchez (3837_CR28) 2017; 13 S Klamt (3837_CR32) 2007; 1 |
| References_xml | – volume: 31 start-page: 2844 year: 2015 ident: 3837_CR18 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btv217 – volume: 17 start-page: 53 issue: 2 year: 1999 ident: 3837_CR25 publication-title: Trends Biotechnol doi: 10.1016/S0167-7799(98)01290-6 – volume: 33 start-page: 2345 year: 2017 ident: 3837_CR23 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btx171 – volume: 15 start-page: 259 year: 2008 ident: 3837_CR14 publication-title: J Comput Biol doi: 10.1089/cmb.2007.0229 – volume: 35 start-page: 535 year: 2019 ident: 3837_CR20 publication-title: Bioinformatics doi: 10.1093/bioinformatics/bty656 – volume: 83 start-page: 233 year: 2006 ident: 3837_CR5 publication-title: Biosystems doi: 10.1016/j.biosystems.2005.04.009 – volume: 28 start-page: 381 year: 2012 ident: 3837_CR15 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btr674 – volume: 5 start-page: 1 year: 2014 ident: 3837_CR31 publication-title: Nat Commun doi: 10.1038/ncomms5893 – volume: 32 start-page: 2001 year: 2016 ident: 3837_CR19 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btw072 – volume: 35 start-page: 2618 year: 2019 ident: 3837_CR22 publication-title: Bioinformatics doi: 10.1093/bioinformatics/bty1027 – volume: 8 start-page: 15956 year: 2017 ident: 3837_CR11 publication-title: Nat Commun doi: 10.1038/ncomms15956 – volume: 16 start-page: e1008110 year: 2020 ident: 3837_CR24 publication-title: PLOS Comput Biol doi: 10.1371/journal.pcbi.1008110 – volume: 9 start-page: 5332 year: 2018 ident: 3837_CR12 publication-title: Nat Commun doi: 10.1038/s41467-018-07719-4 – volume: 15 start-page: 107 issue: 2 year: 2014 ident: 3837_CR1 publication-title: Nat Rev Genet doi: 10.1038/nrg3643 – volume: 20 start-page: 226 year: 2004 ident: 3837_CR4 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btg395 – volume: 8 start-page: 1 year: 2017 ident: 3837_CR8 publication-title: Nat Commun doi: 10.1038/s41467-017-00555-y – volume: 14 start-page: 318 year: 2013 ident: 3837_CR16 publication-title: BMC Bioinform doi: 10.1186/1471-2105-14-318 – volume: 32 start-page: 730 year: 2016 ident: 3837_CR13 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btv649 – volume: 10 start-page: e1003378 year: 2014 ident: 3837_CR7 publication-title: PLOS Comput Biol doi: 10.1371/journal.pcbi.1003378 – ident: 3837_CR10 doi: 10.1101/2020.02.21.954792 – volume: 21 start-page: 19 year: 2020 ident: 3837_CR29 publication-title: BMC Bioinform doi: 10.1186/s12859-019-3329-9 – volume: 13 start-page: e1005409 year: 2017 ident: 3837_CR26 publication-title: PLoS Comput Biol doi: 10.1371/journal.pcbi.1005409 – volume: 13 start-page: 935 year: 2017 ident: 3837_CR28 publication-title: Mol Syst Biol doi: 10.15252/msb.20167411 – volume: 13 start-page: 204 year: 2011 ident: 3837_CR6 publication-title: Metab Eng doi: 10.1016/j.ymben.2010.12.004 – volume: 35 start-page: i615 year: 2019 ident: 3837_CR21 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btz393 – volume: 29 start-page: 233 year: 2002 ident: 3837_CR27 publication-title: Mol Biol Rep doi: 10.1023/A:1020390132244 – volume: 30 start-page: 166 year: 2015 ident: 3837_CR30 publication-title: Metab Eng doi: 10.1016/j.ymben.2015.05.006 – start-page: 263 volume-title: Large-scale networks in engineering and life sciences year: 2014 ident: 3837_CR2 doi: 10.1007/978-3-319-08437-4_5 – volume: 261 start-page: 221 year: 2017 ident: 3837_CR33 publication-title: J Biotechnol doi: 10.1016/j.jbiotec.2017.05.001 – ident: 3837_CR17 doi: 10.1109/TCBB.2013.116 – volume: 10 start-page: 291 issue: 4 year: 2012 ident: 3837_CR3 publication-title: Nat Rev Microbiol doi: 10.1038/nrmicro2737 – volume: 1 start-page: 2 year: 2007 ident: 3837_CR32 publication-title: BMC Syst Biol doi: 10.1186/1752-0509-1-2 – volume: 38 start-page: 29 year: 2016 ident: 3837_CR9 publication-title: Metab Eng doi: 10.1016/j.ymben.2016.05.008 |
| SSID | ssj0017805 |
| Score | 2.4037855 |
| Snippet | Background
The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However,... The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the... Background The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However,... Abstract Background The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks.... |
| SourceID | doaj unpaywall pubmedcentral proquest gale crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithms Benchmarks Bioinformatics Biological research Biomedical and Life Sciences Computational biology Computational Biology/Bioinformatics Computational strain design Computer Appl. in Life Sciences Computer applications Constraint-based modeling Duality Enumeration Genomes Genotype & phenotype Life Sciences Mathematical models Matrix methods Metabolic engineering Metabolic networks Metabolism Metabolites Methodology Methodology Article Methods Microarrays Mixed integer Networks Novel computational methods for the analysis of biological systems Size reduction Stoichiometric modeling |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3La9ZAEF-kIOpBfGLaKqsIHmzoJpvdTY5VLFXQg7XQ25J95OsH-ZKPJkH633cmLxsK1YO3sDshzGNnZ7KzvyHkvTPMJTaRofF4zChMBE8sD33mmPLO2wFn-_sPeXKWfDsX5zdafWFN2AAPPAjuMHNpFFlVMFOAI5XCGMWstT62TmZmANtmaTYlU-P5ASL1T1dkUnnYRIjTFmKqxDAlC_liG-rR-m_75Nt1kvNh6SPyoKu2-dXvvCxv7EfHT8jjMZCkRwMDT8k9Xz0j94fWklfPyep0O-xLtNtSCPIowlXSvFzVl-v2YkMhVu2H8SoWBT3ZsY0XrQuKcCMbHO5a2vi2oeuKllgxTje-BaMp15ZWQ_l484KcHX_59fkkHJsqhFZGaRtCgOK44tJx5iUCnGVO-TjyihnGIZaLQMBxkflE-jiOjEcEvQLCDMGVN2lW8Jdkp6or_4pQ6axIuAVvmeSJ58qoxBgIeKzw3EKmFJBokrG2I-I4Nr4odZ95pFIPetGgF93rRfOAfJzf2Q54G3dSf0LVzZSIld0PgAXp0YL03ywoIO9Q8RrRMCost1nlXdPor6c_9RFkZ7GCqA2IPoxERQ082Hy8vQCSQACtBeX-ghKWq11OT_alR3fRaAT1S0XMRBqQt_M0voklcJWvO6QRGU9kKlhA1MIuF-wvZ6r1RQ8ZDmwn4J4DcjBZ8J-P3yXeg9nK_0Ebu_9DG3vkYYzrFP_cZ_tkp73s_GuI-1rzpl_i19lZUeM priority: 102 providerName: Directory of Open Access Journals – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3da9RAEF_qFdE-iF_FaJVVBB9s6CabbJIHkVZaquAhrYW-LdmPXA9yydkklP73zuSrhsLhW9idJczO7OzM7uxvCPloFDOBDoSrLF4zhsqDL5a6NjEsssbqDmf751ycXgQ_LsPLLTIf3sJgWuVgE1tDbUqNZ-QHiHsWhz4L46_rPy5WjcLb1aGERtqXVjBfWoixB2TbR2SsGdk-Op7_OhvvFRDBf3g6E4uDykP8NhdDKIahmssn21OL4n_fVt_PnxwvUXfIo6ZYp7c3aZ7_s0-dPCVPegeTHnYa8Yxs2eI5ediVnLx9QRbn626_os2agvNHEcaSpvkCeK2vVhR82LYZn2hRkJ_uy3vRMqMIQ7LC5qamla0ruixojpnkdGVrUKZ8qWnRpZVXL8nFyfHvb6duX2zB1TCxtQuOi-ERF4YzKxD4LDGR9T0bMcU4-HieUpGfJTYQ1vc9ZRFZLwP3I-SRVXGS8V0yK8rCviJUGB0GXIMVDdLA8khFgVLgCOnQcg0RlEO8YY6l7pHIsSBGLtuIJBayk4sEuchWLpI75PM4Zt3hcGykPkLRjZSIod02lNcL2S9JmZjY83SUMZXBFi1CYJBpra2vjUgUEw75gIKXiJJRYBrOIm2qSn4_P5OHELX5EXhzQPSpJ8pK4EGn_asGmAkE1ppQ7k0oYRnrafegX7I3I5W8U3qHvB-7cSSmxhW2bJAmTHgg4pA5JJro5YT9aU-xvGqhxIHtAMy2Q_YHDb77-abp3R-1_D-k8Xoza2_IYx9XIJ7VJ3tkVl839i14erV61y_fv6t6TwI priority: 102 providerName: ProQuest – databaseName: Scholars Portal Journals: Open Access dbid: M48 link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9QwDI_GEAIeEJ-iMFBASDywQto0SfuA0EBMA2k8ME7aW9Sk6e2kXntcW8H999j9uFFtmuCtSpxWie3YbpyfCXmVGZZFNpK-cXjMKEwATyz1XZIx5TJne5zt42_yaBZ9PRWnO2QsdzQsYH1paIf1pGbr4u3vn5sPoPDvO4WP5bs6QBQ2HwMhhgGXz6-R62CpEizlcBydnyogfn9320gFPoQ6YrxEc-k7Joaqw_O_uGtfzKTcHqfeJjfbcpVufqVF8ZfFOrxL7gyuJj3oZeMe2XHlfXKjLz65eUDmJ6vectF2RcENpAhoSdNiXq0XzdmSgjfbNeNlLQqctEOhL1rlFAFJltjcNrR2TU0XJS0wp5wuXQNiVSwsLfsE8_ohmR1-_vHpyB_KLvhWBnHjgwuTccVlxpmTCIGWZMqFgVPMMA7eXmCMCvPERdKFYWAcYuzl4IgIrpyJk5w_IrtlVbrHhMrMiohb2E-jNHJcGRUZAy6RFY5biKU8EoxrrO2ASY6lMQrdxSax1D1fNPBFd3zR3CNvtmNWPSLHldQfkXVbSkTT7hqq9VwPyqmTLA4Cq3JmcjDWUsAEmbXWhTaTiWHSIy-R8RrxMkpMyJmnbV3rLyff9QHEb6ECvw6IXg9EeQVzsOlwvwFWAiG2JpR7E0pQaDvtHuVLj_qgEfYvFiETsUdebLtxJCbJla5qkUYkPJKxYB5RE7mcTH_aUy7OOlBxmHYEG7hH9kcJPv_4Vcu7v5Xyf-DGk__i3VNyK0SFxJ_4yR7ZbdatewYuYGOed3r9B5N1UU4 priority: 102 providerName: Scholars Portal – databaseName: Springer Nature OA Free Journals dbid: C6C link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELagCAEHxFMECjIIiQONsONXciwVVUGCA6VSb1bsONuVstlVk6jqv2cmyYZGRRXcVvZ4V_aMPd_sjD8T8r5wrJBe6tgFTDMqx-ETy-OQFcyEIviBZ_v7D310Ir-dqtORJgfvwlzN3_NUf2o4MqzFGOQwDKZicZvcASel-8SsPpgyBsjNv70U89dxM8fT8_NfP4WvV0ZO6dEH5F5Xb_LLi7yqrnigw0fk4Qgd6f6g68fkVqifkLvDY5KXT8nieDN4ItptKMA6igSVNK8Wa4j_z1YU0GnfjJevKGjGjw930XVJkWBkhc1dS5vQNnRZ0wprxOkqtGAm1dLTeigYb56Rk8Mvvw6O4vEZhdhrnrYxQJJCGKELwYJGSrOsMCHhwTDHBKA37pxJyixIHZKEu4CceSUACyVMcGlWiudkp17X4QWhuvBKCg_no8xlEMYZ6RxAHK-C8BAbRYRv19j6kWMcn7qobB9rpNoOerGgF9vrxYqIfJzGbAaGjRulP6PqJklkx-4bwGjsuNlsVqSce1MyV4Lz1QomyLz3IfGFzhzTEXmHirfIf1Fjgc0i75rGfj3-afchHksM4DQQ-jAKlWuYg8_H-wqwEkiZNZPcnUnCBvXz7q192fGAaCzS-KUqYSqNyNupG0di0Vsd1h3KqExInSoWETOzy9n05z318qwnCYdpSziQI7K3teA_P37T8u5NVv4P2nj5f9_-itxPcEfiv_LZLtlpz7vwGjBd6970m_k3pfxBYA priority: 102 providerName: Springer Nature |
| Title | Speeding up the core algorithm for the dual calculation of minimal cut sets in large metabolic networks |
| URI | https://link.springer.com/article/10.1186/s12859-020-03837-3 https://www.proquest.com/docview/2461852058 https://www.proquest.com/docview/2459346850 https://pubmed.ncbi.nlm.nih.gov/PMC7654042 https://bmcbioinformatics.biomedcentral.com/track/pdf/10.1186/s12859-020-03837-3 https://doaj.org/article/9d811c7f0bf84765bb70ccce2cd69b06 |
| UnpaywallVersion | publishedVersion |
| Volume | 21 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: BioMed Central Open Access Free customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RBZ dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: KQ8 dateStart: 20000101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: KQ8 dateStart: 20000701 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DOA dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: ABDBF dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: ADMLS dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVBFR databaseName: Free Medical Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DIK dateStart: 20000101 isFulltext: true titleUrlDefault: http://www.freemedicaljournals.com providerName: Flying Publisher – providerCode: PRVFQY databaseName: GFMER Free Medical Journals customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 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: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M~E dateStart: 20000101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVAQN databaseName: PubMed Central (Free e-resource, activated by CARLI) customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RPM dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/ providerName: National Library of Medicine – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Health & Medical Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 8FG dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVFZP databaseName: Scholars Portal Journals: Open Access customDbUrl: eissn: 1471-2105 dateEnd: 20250131 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M48 dateStart: 20000701 isFulltext: true titleUrlDefault: http://journals.scholarsportal.info providerName: Scholars Portal – providerCode: PRVAVX databaseName: HAS SpringerNature Open Access 2022 customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: AAJSJ dateStart: 20001201 isFulltext: true titleUrlDefault: https://www.springernature.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerOpen Free (Free internet resource, activated by CARLI) customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: C6C dateStart: 20000112 isFulltext: true titleUrlDefault: http://www.springeropen.com/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3db9MwELe2VQh44HOIwKgMQuKBZcunnTx208qotGnamDSerNhxumppUppEaPz13OWjLAxNIPGSRPZZjS9357v67mdC3sfSij3lMVNq3Gb0pQ1PVmTqMLa4jrVqcLaPjtnhuTe58C_WyElXCyPnSs7yFjQUgYp3bpahp7Xthgd1tbuIk0blA7Zb2IjDZmIoZGHIZbrrZMB88M43yOD8-GT0tS4y4rYJEY7f1c78cWBvfaph_G8b69sJlKtd1IfkfpUtouvvUZreWKjGj8m3bopNfsrVTlXKHfXjN_TH_8mDJ-RR69XSUSOGT8mazp6Re805l9fPyfRs0SyStFpQ8DgpYmfSKJ3my1l5OafwCnUz1oVREBrVnilG84Qi9skcm6uSFros6CyjKaav07kuQYLTmaJZk8tebJLz8cGX_UOzPeHBVMwOShO8pdjlLotdSzNEWwtjrh1bc0taLjiWtpTcSULtMe04ttQI55eAz-O7XMsgTNwXZCPLM_2SUBYr33MVmG4v8rTLJfekBO9L-dpVELYZxO6-q1At_DmewpGKOgwKmGgYKICBomagcA3ycTVm0YB_3Em9h-KyokTg7rohX05FawdEGAe2rXhiyQT8AubDBC2llHZUzEJpMYO8Q2ETCM2RYe7PNKqKQnw-OxUjCBUdDi4kEH1oiZIcBSFqSymAE4jm1aPc6lGC7VD97k6mRWu7CoEIg4HvWH5gkLerbhyJ-XiZziuk8UPXY4FvGYT3dKE3_X5PNrus8cth2h6sFQbZ7rTm14_fxd7tlWb9xdd49W_kr8kDB1UHNwzCLbJRLiv9BtzNUg7JOr_gcA3Gn4ZkMBpNziZw3zs4PjmF1n22P6z_yIHrkRcMW3vzEzvjf6c |
| linkProvider | Unpaywall |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZKESocEE8RKGAQiAON6sSJkxwQKo9qlz4OtJX2ZmLH2a6UTZYmUbV_it_ITB5bokorLr2t7ElW4xnPIx5_Q8i7RLHE056wlcFjRl858IvFtokSFpjE6BZn--hYjM68HxN_skH-9HdhsKyyt4mNoU4Kjd_IdxH3LPRd5oefF79t7BqFp6t9C41WLQ7M8hJStvLT-BvI973r7n8__Tqyu64CtoY3VDZ46IQHXCScGYEIX1ESGNcxAVOMQzDjKBW4aWQ8YVzXUQYh5FLwsz4PjAqjlMN7b5HbHgdbAvsnmKwSPAf7A_QXc0KxWzqIDmdjgsYwEbT5wPk1PQKue4Lr1ZmrI9p7ZKvOF_HyMs6yf7zg_gNyvwtf6V6rbw_JhskfkTttQ8vlYzI9WbTekNYLCqElRZBMGmdTWMnqfE4hQm6G8QIYBe3QXfMwWqQUQU7mOFxXtDRVSWc5zbBOnc5NBaqazTTN26L18gk5u5FFf0o28yI3zwgVifY9rsFGe7FneKACTykIs7RvuIb8zCJOv8ZSdzjn2G4jk02-EwrZykWCXGQjF8kt8nH1zKJF-VhL_QVFt6JEhO5moLiYym7DyygJHUcHKVMpBADCBwaZ1tq4OhGRYsIib1HwEjE4cizymcZ1WcrxyU-5BzmhG0CsCEQfOqK0AB503N2ZgJVA2K4B5faAEoyEHk73-iU7I1XKqy1lkTeraXwSC-9yU9RI40fcE6HPLBIM9HLA_nAmn503QOXAtgdOwSI7vQZf_fm65d1Zafl_SOP5etZek63R6dGhPBwfH7wgd13cjXgqEG2TzeqiNi8hpqzUq2YjU_Lrpi3HX-zogvM |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9QwDI9giK8HxKcoDAgIiQdWLW3SpH0cB9PGx4QYk_YWNWl6O6nXnq6t0P577LZXVg1N8HZKnDsltmP7Yv9MyNvMsExYIX3j8JkxMgF8Yqnvkowplznb42x_O5IHJ-LzaXR6oYq_y3bfPEn2NQ2I0lQ2u6ss71U8lrt1gLhrPoY-DEMsn18nNwRYN-xhMJOz8R0BEfs3pTJ_XTcxRx1q_-W7-XK-5PhoepfcbstVev4rLYoLdmn_Prk3OJR0r5eAB-SaKx-Sm32LyfNHZH686u0TbVcUnD2KsJU0LebVetGcLSn4rN0wlmRR4Jcd2nnRKqcIO7LE4bahtWtquihpgZnjdOkaEJ5iYWnZp5HXj8nJ_qefswN_aK7gWxnEjQ-OSsYVlxlnTiLQWZIpFwZOMcM4-HSBMSrMEyekC8PAOETSy8HdiLhyJk5y_oRslVXpnhIqMxsJbuHWFKlwXBkljAHHx0aOW4iYPBJszljbAXkcG2AUuotAYql7vmjgi-74orlH3o9rVj3uxpXUH5B1IyViZncD1XquBxXUSRYHgVU5MzmYZBnBBpm11oU2k4lh0iNvkPEaUTFKTLuZp21d68PjH3oPorRQgfcGRO8GoryCPdh0qGKAk0AgrQnl9oQS1NZOpzfypYdro9YI7hdHIYtij7wep3ElpsKVrmqRJkq4kHHEPKImcjnZ_nSmXJx10OGwbQHXtEd2NhL858evOt6dUcr_gRvP_u_bX5Fb3z_u66-HR1-ekzshKif-bZ9sk61m3boX4PQ15mWn178BQDVMlg |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3fb9MwELZGJwQ88BsRGMggJB5YOieOneSxIKaBxDQxKo0nK3acrlqalCYRGn89d0laFoYmkHiL7LMSX87n7-S7z4S8SjVLAxNIV1s8ZhTagyeWuDZOWWhTazqe7U-H8mAafDwRJ1vkaF0LoxdGz8ueNBSJiscXy9Dz1nfDgznbW6ZZt-QjuVd5yMPmYijEMORy-TWyLQWg8xHZnh4eTb62RUah50KEI9a1M38cONifWhr_y876cgLl5hT1FrnRFMvk_HuS5xc2qv075Nt6il1-ytm4qfXY_PiN_fF_6uAuud2jWjrpzPAe2bLFfXK9u-fy_AGZHS-7TZI2SwqIkyJ3Jk3yWbma16cLCp_QNmNdGAWjMf2dYrTMKHKfLLC5qWll64rOC5pj-jpd2BosOJ8bWnS57NVDMt1__-Xdgdvf8OAa6UW1C2gp5SGXKWdWIttanIbW92zINOMALD2tQz-LbSCt73vaIp1fBphH8NDqKM74IzIqysI-JlSmRgTcgOsOksDyUIeB1oC-jLDcQNjmEG_9X5Xp6c_xFo5ctWFQJFWnQAUKVK0CFXfIm82YZUf-caX0WzSXjSQSd7cN5Wqmej-g4jTyPBNmTGeAC6SACTJjjPVNKmPNpENeorEppOYoMPdnljRVpT4cf1YTCBX9ECAkCL3uhbISDSHpSylAE8jmNZDcGUiC7zDD7rVNq953VQoZBiPhMxE55MWmG0diPl5hywZlRMwDGQnmkHCwFgbTH_YU89OWvxymHcBe4ZDd9ar59fKr1Lu7WVl_8Tee_Jv4U3LTx6WDBwbxDhnVq8Y-A7hZ6-e9B_kJDCl4CA |
| 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=Speeding+up+the+core+algorithm+for+the+dual+calculation+of+minimal+cut+sets+in+large+metabolic+networks&rft.jtitle=BMC+bioinformatics&rft.au=Klamt%2C+Steffen&rft.au=Mahadevan%2C+Radhakrishnan&rft.au=von+Kamp%2C+Axel&rft.date=2020-11-09&rft.issn=1471-2105&rft.eissn=1471-2105&rft.volume=21&rft.issue=1&rft_id=info:doi/10.1186%2Fs12859-020-03837-3&rft.externalDBID=n%2Fa&rft.externalDocID=10_1186_s12859_020_03837_3 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon |