{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:24:27Z","timestamp":1761719067860,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030795269"},{"type":"electronic","value":"9783030795276"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79527-6_9","type":"book-chapter","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:43Z","timestamp":1624100623000},"page":"146-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Epigenetic Consensus Problem"],"prefix":"10.1007","author":[{"given":"Sabrina","family":"Rashid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziv","family":"Bar-Joseph","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson, K.: On achieving consensus using a shared memory. In: Proceedings of the 7th ACM Symposium on Principles of Distributed Computing, PODC 1988, pp. 291\u2013302 (1988)","DOI":"10.1145\/62546.62594"},{"issue":"6014","key":"9_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1126\/science.1193210","volume":"331","author":"Y Afek","year":"2011","unstructured":"Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science 331(6014), 183\u2013185 (2011)","journal-title":"Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J.: Randomized protocols for asynchronous consensus. Distrib. Comput. 16(2\u20133), 165\u2013175 (2003). ArXiv version: arXiv:cs.DS\/0209014. Accessed 28 May 2018","DOI":"10.1007\/s00446-002-0081-5"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Shahand, G., Shah, J.: Wait-free consensus with infinite arrivals. In: Proceedings of the 24th ACM Symposium on Theory of Computing, STOC 2002, pp. 524\u2013533 (2002)","DOI":"10.1145\/509907.509983"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J Aspnes","year":"1990","unstructured":"Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. J. Algorithms 11(3), 441\u2013461 (1990)","journal-title":"J. Algorithms"},{"issue":"9","key":"9_CR6","doi-asserted-by":"publisher","first-page":"a017905","DOI":"10.1101\/cshperspect.a017905","volume":"5","author":"PB Becker","year":"2013","unstructured":"Becker, P.B., Workman, J.L.: Nucleosome remodeling and epigenetics. Cold Spring Harb. Perspect Biol. 5(9), a017905 (2013)","journal-title":"Cold Spring Harb. Perspect Biol."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Berger, S.L.: The complex language of chromatin regulation during transcription. Nature 447(7143), 407 (2007)","DOI":"10.1038\/nature05915"},{"key":"9_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538493.001.0001","volume-title":"Neural Networks for Pattern Recognition","author":"C Bishop","year":"1995","unstructured":"Bishop, C.: Neural Networks for Pattern Recognition. Oxford University Press, New York (1995)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/j.cell.2018.03.079","volume":"173","author":"P Cheung","year":"2018","unstructured":"Cheung, P., et al.: Single-cell chromatin modification profiling reveals increased epigenetic variations with aging. Cell 173, 1385\u20131397 (2018)","journal-title":"Cell"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Zajicek, O.: The APRAM: incorporating asynchrony into the PRAM model. In: SPAA, pp. 169\u2013178 (1989)","DOI":"10.1145\/72935.72954"},{"issue":"8","key":"9_CR11","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1016\/j.bpj.2009.06.057","volume":"97","author":"PM Diesinger","year":"2009","unstructured":"Diesinger, P.M., Heermann, D.W.: Depletion effects massively change chromatin properties and influence genome folding. Biophys. J. 97(8), 2146\u20132153 (2009)","journal-title":"Biophys. J."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. J. ACM 34(1), 77\u201397 (1987)","journal-title":"J. ACM"},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"12284","DOI":"10.1038\/ncomms12284","volume":"7","author":"D Cano-Rodriguez","year":"2016","unstructured":"Cano-Rodriguez, D., et al.: Writing of H3K4Me3 overcomes epigenetic silencing in a sustained but context-dependent manner. Nature Commun. 7, 12284 (2016)","journal-title":"Nature Commun."},{"key":"9_CR17","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1, 2nd edn. Wiley, Hoboken (1959). 461 pages"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-12689-9_99","volume-title":"Foundations of Computation Theory","author":"MJ Fischer","year":"1983","unstructured":"Fischer, M.J.: The consensus problem in unreliable distributed systems (a brief survey). In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 127\u2013140. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-12689-9_99"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"MJ Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986)","journal-title":"Distrib. Comput."},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(93)90223-V","volume":"45","author":"MJ Fischer","year":"1993","unstructured":"Fischer, M.J., Moran, S., Taubenfeld, G.: Space-efficient asynchronous consensus without shared memory initialization. Inf. Process. Lett. 45(2), 101\u2013105 (1993)","journal-title":"Inf. Process. Lett."},{"key":"9_CR22","unstructured":"Goemans, M.: Chernoff bounds, and some applications (lecture notes), November 2015. http:\/\/math.mit.edu\/goemans\/18310S15\/chernoff-notes.pdf. 6 pages"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.cell.2007.02.006","volume":"128","author":"AD Goldberg","year":"2007","unstructured":"Goldberg, A.D., Allis, D.C., Bernstein, E.: Epigenetics: a landscape takes shape. Cell 128(4), 635\u2013638 (2007)","journal-title":"Cell"},{"issue":"6","key":"9_CR24","doi-asserted-by":"publisher","first-page":"e1000935","DOI":"10.1371\/journal.ppat.1000935","volume":"6","author":"T G\u00fcnther","year":"2010","unstructured":"G\u00fcnther, T., Grundhoff, A.: The epigenetic landscape of latent Kaposi sarcoma-associated herpesvirus genomes. PLoS Pathog. 6(6), e1000935 (2010)","journal-title":"PLoS Pathog."},{"key":"9_CR25","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers, San Francisco (2008). 508 pages"},{"issue":"3","key":"9_CR26","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR27","first-page":"163","volume":"4","author":"MC Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183 (1987)","journal-title":"Adv. Comput. Res."},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/2678280","volume":"58","author":"S Navlakha","year":"2015","unstructured":"Navlakha, S., Bar-Joseph, Z.: Distributed information processing in biological and computational systems. Commun. ACM 58(1), 94\u2013102 (2015)","journal-title":"Commun. ACM"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Panneerdoss, S., et al.: Cross-talk among writers, readers, and erasers of m6a regulates cancer growth and progression. Sci. Adv. 4(10), eaar8263 (2018)","DOI":"10.1126\/sciadv.aar8263"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"14","key":"9_CR31","doi-asserted-by":"publisher","first-page":"R546","DOI":"10.1016\/j.cub.2004.07.007","volume":"14","author":"CL Peterson","year":"2004","unstructured":"Peterson, C.L., Laniel, M.: Histones and histone modifications. Curr. Biol. 14(14), R546\u2013R551 (2004)","journal-title":"Curr. Biol."},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Plotkin, S.A.: Sticky bits and universality of consensus. In: Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pp. 159\u2013175 (1989)","DOI":"10.1145\/72981.72992"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles, and Foundations. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-32027-9. 515 pages","DOI":"10.1007\/978-3-642-32027-9"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Ross, S.M.: Stochastic Processes. Wiley, Hoboken (1983). 309 pages","DOI":"10.1016\/B978-0-12-598420-1.50011-8"},{"key":"9_CR35","unstructured":"Saks, M., Shavit, N., Woll, H.: Optimal time randomized consensus - making resilient algorithms fast in practice. In: Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, SODA 1991, pp. 351\u2013362 (1991)"},{"key":"9_CR36","unstructured":"Singh, S., et al.: Distributed gradient descent in bacterial food search. In: Proceedings of the 20th Annual International Conference on Research in Computational Molecular Biology (RECOMB) (2016)"},{"issue":"7","key":"9_CR37","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1016\/j.cell.2015.11.024","volume":"163","author":"Z Tang","year":"2015","unstructured":"Tang, Z., et al.: CTCF-mediated human 3D genome architecture reveals chromatin topology for transcription. Cell 163(7), 1611\u20131627 (2015)","journal-title":"Cell"},{"key":"9_CR38","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Pearson\/Prentice-Hall, New York (2006). ISBN 0-131-97259-6, 423 pages"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Coordination without prior agreement. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, pp. 325\u2013334 (2017)","DOI":"10.1145\/3087801.3087807"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.sbi.2015.09.007","volume":"35","author":"IO Torres","year":"2015","unstructured":"Torres, I.O., Fujimori, D.G.: Functional coupling between writers, erasers and readers of histone and DNA methylation. Curr. Opin. Struct. Biol. 35, 68\u201375 (2015)","journal-title":"Curr. Opin. Struct. Biol."},{"issue":"6","key":"9_CR41","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1016\/j.cell.2015.05.039","volume":"161","author":"F von Meyenn","year":"2015","unstructured":"von Meyenn, F., Reik, W.: Forget the parents: epigenetic reprogramming in human germ cells. Cell 161(6), 1248\u20131251 (2015)","journal-title":"Cell"},{"issue":"7","key":"9_CR42","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1038\/ng.154","volume":"40","author":"Z Wang","year":"2008","unstructured":"Wang, Z., et al.: Combinatorial patterns of histone acetylations and methylations in the human genome. Nat. Genet. 40(7), 897 (2008)","journal-title":"Nat. Genet."},{"issue":"1","key":"9_CR43","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1073\/pnas.0805923106","volume":"106","author":"M Weigt","year":"2009","unstructured":"Weigt, M., White, R.A., Szurmant, H., Hoch, J.A., Hwa, T.: Identification of direct residue contacts in protein-protein interaction by message passing. Proc. Natl. Acad. Sci. 106(1), 67\u201372 (2009)","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79527-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T03:44:06Z","timestamp":1699155846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79527-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030795269","9783030795276"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79527-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2021.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}