Search bioRxivSearch

Biology subjects

Zhou, E.

Publications and source records attributed to Zhou, E..

2 recordsLinked to original sources

Decoys provide a scalable platform for the genetic analysis of plant E3 ubiquitin ligases that regulate circadian clock function

The circadian clock in all eukaryotes relies on the regulated degradation of clock proteins to maintain 24-hour rhythmicity. Despite this knowledge, we know very few of the components that mediate degradation of proteins to control clock function. This is likely due to high levels of gene duplication and functional redundancy within plant E3 ubiquitin ligase gene families. In order to overcome this issue and discover E3 ubiquitin ligases that control circadian clock function, we generated a library of transgenic Arabidopsis lines expressing dominant-negative \"decoy\" E3 ubiquitin ligases. We determined their effects on the plant circadian clock and identified dozens of new potential regulators of circadian clock function. To demonstrate the potency of the decoy screening methodology to overcome genetic redundancy and identify bona fide clock regulators, we performed follow-up studies on PUB59 and PUB60. Using knock-out studies, we show that they redundantly control circadian clock period by regulating gene splicing. Furthermore, we confirm that they are part of a conserved protein complex that mediates splicing in eukaryotes. This work demonstrates the viability of E3 ubiquitin ligase decoys as a scalable screening platform to overcome traditional genetic challenges and discover E3 ubiquitin ligases that regulate plant developmental processes.

plant biology

GLaMST: Grow Lineages along Minimum Spanning Tree for B Cell Receptor Sequencing Data

B cell affinity maturation enables B cells to generate high-affinity antibodies. This process involves somatic hypermutation of B cell immunoglobulin receptor (BCR) genes and selection by their ability to bind antigens. Lineage trees are used to describe this microevolution of B cell immunoglobulin genes. In a lineage tree, each node is one BCR sequence that mutated from the germinal center and each directed edge represents a single base mutation, insertion or deletion. In BCR sequencing data, the observed data only contains a subset of BCR sequences in this microevolution process. Therefore, reconstructing the lineage tree from experimental data requires algorithms to build the tree based on partially observed tree nodes. We developed a new algorithm named Grow Lineages along Minimum Spanning Tree (GLaMST), which efficiently reconstruct the lineage tree given observed BCR sequences that correspond to a subset of the tree nodes. GLaMST constructs the minimum-spanning-tree (MST) to approximate the landscape of how observed BCR sequences are related, uses the MST to guide the interpolation of the closest unobserved sequence, updates the MST for the interpolation of additional unobserved sequences, and iterates until a full lineage tree is completed, where all observed sequences are connected by interpolated unobserved sequences and single base operations of mutations, insertions and deletions. Through comparison using simulated and real data, GLaMST outperforms existing algorithms in simulations with high rates of mutation, insertion and deletion, and generates lineage trees with smaller size and closer to ground truth according to tree features that highly correlated with selection pressure.

bioinformatics