{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T06:41:19Z","timestamp":1781332879860,"version":"3.54.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2016-04240"],"award-info":[{"award-number":["2016-04240"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s11047-019-09756-4","type":"journal-article","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T05:11:46Z","timestamp":1565241106000},"page":"249-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Approximate majority analyses using tri-molecular chemical reaction networks"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1458-1259","authenticated-orcid":false,"given":"Anne","family":"Condon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monir","family":"Hajiaghayi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"key":"9756_CR2","doi-asserted-by":"crossref","unstructured":"Alistarh D, Aspnes J, Eisenstat D, Gelashvili R, Rivest RL (2017) Time-space trade-offs in population protocols. In: Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete algorithms. pp 2560\u20132579","DOI":"10.1137\/1.9781611974782.169"},{"issue":"4","key":"9756_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R (2006a) Computation in networks of passively mobile finite-state sensors. Distrib Comput 18(4):235\u2013253","journal-title":"Distrib Comput"},{"key":"9756_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11864219_5","volume-title":"Distributed computing (DISC)","author":"D Angluin","year":"2006","unstructured":"Angluin D, Aspnes J, Eisenstat D (2006b) Fast computation by population protocols with a leader. In: Dolev S (ed) Distributed computing (DISC), vol 4167. Lecture notes in computer science. Springer, Berlin, pp 61\u201375"},{"issue":"2","key":"9756_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin D, Aspnes J, Eisenstat D (2008) A simple population protocol for fast robust approximate majority. Distrib Comput 21(2):87\u2013102","journal-title":"Distrib Comput"},{"key":"9756_CR6","first-page":"1","volume":"30","author":"L Becchetti","year":"2016","unstructured":"Becchetti L, Clementi A, Natale E, Pasquale F, Silvestri R, Trevisan L (2016) Simple dynamics for plurality consensus. Distrib Comput 30:1\u201314","journal-title":"Distrib Comput"},{"key":"9756_CR7","doi-asserted-by":"crossref","unstructured":"Becchetti L, Clementi AEF, Natale E, Pasquale F, Trevisan L (2016) Stabilizing consensus with many opinions. In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete algorithms. pp 620\u2013635","DOI":"10.1137\/1.9781611974331.ch46"},{"key":"9756_CR8","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1038\/srep00656","volume":"2","author":"L Cardelli","year":"2012","unstructured":"Cardelli L, Csik\u00e1sz-Nagy A (2012) The cell cycle switch computes approximate majority. Nat Sci Rep 2:656","journal-title":"Nat Sci Rep"},{"key":"9756_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-43994-5_3","volume-title":"DNA computing and molecular programming","author":"L Cardelli","year":"2016","unstructured":"Cardelli L, Kwiatkowska M, Laurenti L (2016) Programming discrete distributions with chemical reaction networks. In: Rondelez Y, Woods D (eds) DNA computing and molecular programming, vol 9818. Lecture notes in computer science. Springer, Cham, pp 35\u201351"},{"issue":"10","key":"9756_CR10","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1038\/nnano.2013.189","volume":"8","author":"Y-J Chen","year":"2013","unstructured":"Chen Y-J, Dalchau N, Srinivas N, Phillips A, Cardelli L, Soloveichik D, Seelig G (2013) Programmable chemical controllers made from DNA. Nat Nanotechnol 8(10):755\u2013762","journal-title":"Nat Nanotechnol"},{"key":"9756_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23:493\u2013507","journal-title":"Ann Math Stat"},{"key":"9756_CR12","doi-asserted-by":"crossref","unstructured":"Condon A, Hajiaghayi M, Kirkpatrick D, Manuch J (2017) Simplifying analyses of chemical reaction networks for approximate majority. In: 23rd international conference on DNA computing and molecular programming (Lecture notes in computer science), vol 10467. Springer-Verlag, pp 189\u2013209","DOI":"10.1007\/978-3-319-66799-7_13"},{"key":"9756_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-88869-7_27","volume-title":"Algorithmic bioprocesses","author":"M Cook","year":"2009","unstructured":"Cook M, Soloveichik D, Winfree E, Bruck J (2009) Programmability of chemical reaction networks. In: Condon A, Harel D, Kok JN, Salomaa A, Winfree E (eds) Algorithmic bioprocesses. Springer, Berlin, pp 543\u2013584"},{"issue":"2","key":"9756_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s11134-014-9397-7","volume":"78","author":"J Cruise","year":"2014","unstructured":"Cruise J, Ganesh A (2014) Probabilistic consensus via polling and majority rules. Queueing Syst 78(2):99\u2013120","journal-title":"Queueing Syst"},{"key":"9756_CR14","doi-asserted-by":"crossref","unstructured":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C (2011) Stabilizing consensus with the power of two choices. In: Proceedings of the twenty-third annual ACM symposium on parallelism in algorithms and architectures, SPAA \u201911. New York, NY, USA, ACM, pp 149\u2013158","DOI":"10.1145\/1989493.1989516"},{"issue":"3","key":"9756_CR15","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/110823018","volume":"50","author":"M Draief","year":"2012","unstructured":"Draief M, Vojnovic M (2012) Convergence speed of binary interval consensus. SIAM J Control Optim 50(3):1087\u20131109","journal-title":"SIAM J Control Optim"},{"key":"9756_CR16","volume-title":"An introduction to probability theory and its applications","author":"W Feller","year":"1968","unstructured":"Feller W (1968) An introduction to probability theory and its applications, vol 1, 3rd edn. Wiley, New York","edition":"3"},{"key":"9756_CR17","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1021\/j100540a008","volume":"81","author":"DT Gillespie","year":"1977","unstructured":"Gillespie DT (1977) Exact stochastic simulation of coupled chemical reactions. J Phys Chem 81:2340\u20132361","journal-title":"J Phys Chem"},{"key":"9756_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Am Stat Assoc 58:13\u201330","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"9756_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-016-0277-8","volume":"30","author":"GB Mertzios","year":"2017","unstructured":"Mertzios GB, Nikoletseas SE, Raptopoulos CL, Spirakis PG (2017) Determining majority in networks with local interactions and very small local memory. Distrib Comput 30(1):1\u201316","journal-title":"Distrib Comput"},{"key":"9756_CR20","doi-asserted-by":"crossref","unstructured":"Perron E, Vasudevan D, Vojnovic M (2009) Using three states for binary consensus on complete graphs. In: Proceedings of the 28th IEEE conference on computer communications (INFOCOM). pp 2527\u20132535","DOI":"10.1109\/INFCOM.2009.5062181"},{"key":"9756_CR21","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik D, Cook M, Winfree E, Bruck J (2008) Computation with finite stochastic chemical reaction networks. Nat Comput 7:615\u2013633","journal-title":"Nat Comput"},{"issue":"12","key":"9756_CR22","doi-asserted-by":"publisher","first-page":"5393","DOI":"10.1073\/pnas.0909380107","volume":"107","author":"D Soloveichik","year":"2010","unstructured":"Soloveichik D, Seelig G, Winfree E (2010) DNA as a universal substrate for chemical kinetics. PNAS 107(12):5393\u20135398","journal-title":"PNAS"},{"key":"9756_CR23","unstructured":"van Kampen N (1997) Stochastic processes in physics and chemistry (revised edition)"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09756-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-019-09756-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-019-09756-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T23:14:13Z","timestamp":1596755653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-019-09756-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["9756"],"URL":"https:\/\/doi.org\/10.1007\/s11047-019-09756-4","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,8]]},"assertion":[{"value":"8 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}