{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:47Z","timestamp":1750220867232,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T00:00:00Z","timestamp":1550275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2019,2,16]]},"abstract":"<jats:p>The international interdisciplinary SYMBIONT project ranges from mathematics via computer science to systems biology, with a balanced team of researchers from those fields. At the present stage the project has a clear focus on fundamental research on mathematical methods, and prototypes in software. Results are systematically benchmarked against models from computational biology databases. We summarize the motivation and aims for the project, and report on existing results by the consortium and first activities. The project website can be found at www.symbiont-project.org.<\/jats:p>","DOI":"10.1145\/3313880.3313885","type":"journal-article","created":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T20:54:15Z","timestamp":1550609655000},"page":"67-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The SYMBIONT project"],"prefix":"10.1145","volume":"52","author":[{"given":"Fran\u00e7ois","family":"Boulier","sequence":"first","affiliation":[{"name":"Univ. Lille 1, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Fages","sequence":"additional","affiliation":[{"name":"Inria Saclay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ovidiu","family":"Radulescu","sequence":"additional","affiliation":[{"name":"Univ. Montpellier, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satya Swarup","family":"Samal","sequence":"additional","affiliation":[{"name":"RWTH Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Schuppert","sequence":"additional","affiliation":[{"name":"RWTH Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Seiler","sequence":"additional","affiliation":[{"name":"Univ. Kassel, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sturm","sequence":"additional","affiliation":[{"name":"CNRS, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Walcher","sequence":"additional","affiliation":[{"name":"RWTH Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Weber","sequence":"additional","affiliation":[{"name":"Univ. Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2015.02.050"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24021-3_10"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11538-015-0118-0"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2016.07.004"},{"key":"e_1_2_1_5_1","volume-title":"A constraint solving approach to model reduction by tropical equilibration. Algorithms for Molecular Biology, 9(24)","author":"Soliman S.","year":"2014","unstructured":"S. Soliman , F. Fages , and O. Radulescu . A constraint solving approach to model reduction by tropical equilibration. Algorithms for Molecular Biology, 9(24) , 2014 . S. Soliman, F. Fages, and O. Radulescu. A constraint solving approach to model reduction by tropical equilibration. Algorithms for Molecular Biology, 9(24), 2014."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313880.3313885","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313880.3313885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:46Z","timestamp":1750202626000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313880.3313885"}},"subtitle":["symbolic methods for biological networks"],"short-title":[],"issued":{"date-parts":[[2019,2,16]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,2,16]]}},"alternative-id":["10.1145\/3313880.3313885"],"URL":"https:\/\/doi.org\/10.1145\/3313880.3313885","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2019,2,16]]},"assertion":[{"value":"2019-02-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}