Genome-Wide Epigenetic Modifications as a Shared Memory Consensus Problem

A distributed computing system is a collection of processors that communicate either by reading and writing from a shared memory or by sending messages over some communication network. Most prior biologically inspired distributed computing algorithms rely on message passing as the communication model. Here we show that in the process of genome-wide epigenetic modifications cells utilize their DNA as a shared memory system. We formulate a particular consensus problem, called the epigenetic consensus problem, that cells attempt to solve using this shared memory model, and then present algorithms, derive expected run time and discuss, analyze and simulate improved methods for solving this problem. Analysis of real biological data indicates that the computational methods indeed reflect aspects of the biological process for genome-wide epigenetic modifications.

[1]  Ziv Bar-Joseph,et al.  Distributed Gradient Descent in Bacterial Food Search , 2016, RECOMB 2016.

[2]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[3]  James Aspnes,et al.  Wait-free consensus with infinite arrivals , 2002, STOC '02.

[4]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[5]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6]  Karl R. Abrahamson.  On achieving consensus using a shared memory , 1988, PODC '88.

[7]  Richard Cole,et al.  The APRAM: incorporating asynchrony into the PRAM model , 1989, SPAA '89.

[8]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[9]  M. Rots,et al.  Writing of H3K4Me3 overcomes epigenetic silencing in a sustained but context-dependent manner , 2016, Nature Communications.

[10]  Dieter W. Heermann,et al.  Depletion effects massively change chromatin properties and influence genome folding. , 2009, Biophysical journal.

[11]  Nancy A. Lynch,et al.  Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[12]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[13]  Heekuck Oh,et al.  Neural Networks for Pattern Recognition , 1993, Adv. Comput..

[14]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[15]  Michael J. Fischer,et al.  Space-Efficient Asynchronous Consensus Without Shared Memory Initialization , 1993, Inf. Process. Lett..

[16]  C. Allis,et al.  Epigenetics: A Landscape Takes Shape , 2007, Cell.

[17]  Serge A. Plotkin.  Sticky bits and universality of consensus , 1989, PODC '89.

[18]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.

[19]  T. Hwa,et al.  Identification of direct residue contacts in protein–protein interaction by message passing , 2009, Proceedings of the National Academy of Sciences.

[20]  S. Berger.  The complex language of chromatin regulation during transcription , 2007, Nature.

[21]  Nir Shavit,et al.  Optimal time randomized consensus—making resilient algorithms fast in practice , 1991, SODA '91.

[22]  D. M. Hutton,et al.  The Art of Multiprocessor Programming , 2008 .

[23]  C. Peterson,et al.  Histones and histone modifications , 2004, Current Biology.

[24]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[25]  W. Feller,et al.  An Introduction to Probability Theory and its Applications. Vol. 1, 2nd Edition , 1959 .

[26]  Dariusz M Plewczynski,et al.  CTCF-Mediated Human 3D Genome Architecture Reveals Chromatin Topology for Transcription , 2015, Cell.

[27]  Maurice Herlihy,et al.  Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.

[28]  Gadi Taubenfeld.  Coordination Without Prior Agreement , 2017, PODC.

[29]  Ziv Bar-Joseph,et al.  Distributed information processing in biological and computational systems , 2014, Commun. ACM.

[30]  Michael Q. Zhang,et al.  Combinatorial patterns of histone acetylations and methylations in the human genome , 2008, Nature Genetics.

[31]  Noga Alon,et al.  A Biological Solution to a Fundamental Distributed Computing Problem , 2011, Science.

[32]  Michel Raynal,et al.  Concurrent Programming: Algorithms, Principles, and Foundations , 2012, Springer Berlin Heidelberg.

[33]  Francesco Vallania,et al.  Single-Cell Chromatin Modification Profiling Reveals Increased Epigenetic Variations with Aging , 2018, Cell.

[34]  Ferdinand von Meyenn,et al.  Forget the Parents: Epigenetic Reprogramming in Human Germ Cells , 2015, Cell.

[35]  I. O. Torres,et al.  Functional coupling between writers, erasers and readers of histone and DNA methylation. , 2015, Current opinion in structural biology.

[36]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[37]  James Aspnes,et al.  Randomized protocols for asynchronous consensus , 2002, Distributed Computing.

[38]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[39]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[40]  T. Günther,et al.  The Epigenetic Landscape of Latent Kaposi Sarcoma-Associated Herpesvirus Genomes , 2010, PLoS pathogens.

[41]  J. Workman,et al.  Nucleosome remodeling and epigenetics. , 2013, Cold Spring Harbor perspectives in biology.

[42]  Tim Hui-Ming Huang,et al.  Cross-talk among writers, readers, and erasers of m6A regulates cancer growth and progression , 2018, Science Advances.