Smc5/6: a link between DNA repair and unidirectional replication?

Of the three structural maintenance of chromosome (SMC) complexes, two directly regulate chromosome dynamics. The third, Smc5/6, functions mainly in homologous recombination and in completing DNA replication. The literature suggests that Smc5/6 coordinates DNA repair, in part through post-translational modification of uncharacterized target proteins that can dictate their subcellular localization, and that Smc5/6 also functions to establish DNA-damage-dependent cohesion. A nucleolar-specific Smc5/6 function has been proposed because Smc5/6 yeast mutants display penetrant phenotypes of ribosomal DNA (rDNA) instability. rDNA repeats are replicated unidirectionally. Here, we propose that unidirectional replication, combined with global Smc5/6 functions, can explain the apparent rDNA specificity

Specialized interfaces of Smc5/6 control hinge stability and DNA association

The Structural Maintenance of Chromosomes (SMC) complexes: cohesin, condensin and Smc5/6 are involved in the organization of higher-order chromosome structure—which is essential for accurate chromosome duplication and segregation. Each complex is scaffolded by a specific SMC protein dimer (heterodimer in eukaryotes) held together via their hinge domains. Here we show that the Smc5/6-hinge, like those of cohesin and condensin, also forms a toroidal structure but with distinctive subunit interfaces absent from the other SMC complexes; an unusual ‘molecular latch’ and a functional ‘hub’. Defined mutations in these interfaces cause severe phenotypic effects with sensitivity to DNA-damaging agents in fission yeast and reduced viability in human cells. We show that the Smc5/6-hinge complex binds preferentially to ssDNA and that this interaction is affected by both ‘latch’ and ‘hub’ mutations, suggesting a key role for these unique features in controlling DNA association by the Smc5/6 complex

Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure Convergence

Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step, every node updates its state based on a Bernoulli trial, independent in time and among different nodes: either averaging among the neighbor set generated by the random graph, or sticking with its current state. Connectivity-independence and arc-independence are introduced to capture the fundamental influence of the random graphs on the consensus convergence. Necessary and/or sufficient conditions are presented on the success probabilities of the Bernoulli trials for the network to reach a global almost sure consensus, with some sharp threshold established revealing a consensus zero-one law. Convergence rates are established by lower and upper bounds of the $\epsilon$-computation time. We also generalize the concepts of connectivity/arc independence to their analogues from the $*$-mixing point of view, so that our results apply to a very wide class of graphical models, including the majority of random graph models in the literature, e.g., Erd\H{o}s-R\'{e}nyi, gossiping, and Markovian random graphs. We show that under $*$-mixing, our convergence analysis continues to hold and the corresponding almost sure consensus conditions are established. Finally, we further investigate almost sure finite-time convergence of random gossiping algorithms, and prove that the Bernoulli trials play a key role in ensuring finite-time convergence. These results add to the understanding of the interplay between random graphs, random computations, and convergence probability for distributed information processing.Comment: IEEE Transactions on Information Theory, In Pres