Influence of combinatorial histone modifications on antibody and effector protein recognition

Increasing evidence suggests that histone posttranslational modifications (PTMs) function in a combinatorial fashion to regulate the diverse activities associated with chromatin. Yet how these patterns of histone PTMs influence the adapter proteins known to bind them is poorly understood. In addition, how histone-specific antibodies are influenced by these same patterns of PTMs is largely unknown. Here we examine the binding properties of histone-specific antibodies and histone-interacting proteins using peptide arrays containing a library of combinatorially modified histone peptides. We find that modification-specific antibodies are more promiscuous in their PTM recognition than expected and are highly influenced by neighboring PTMs. Furthermore, we find that the binding of histone-interaction domains from BPTF, CHD1, and RAG2 to H3 lysine 4 trimethylation is also influenced by combinatorial PTMs. These results provide further support for the histone code hypothesis and raise specific concerns with the quality of the currently available modification-specific histone antibodies.     

Trawler: de novo regulatory motif discovery pipeline for chromatin immunoprecipitation

We developed Trawler, the fastest computational pipeline to date, to efficiently discover over-represented motifs in chromatin immunoprecipitation (ChIP) experiments and to predict their functional instances. When we applied Trawler to data from yeast and mammals, 83% of the known binding sites were accurately called, often with other additional binding sites, providing hints of combinatorial input. Newly discovered motifs and their features (identity, conservation, position in sequence) are displayed on a web interface.     

Local multiple sequence alignment using dead-end elimination

MOTIVATION: Local multiple sequence alignment is a basic tool for extracting functionally important regions shared by a family of protein sequences. We present an effectively polynomial-time algorithm for rigorously solving the local multiple alignment problem. RESULTS: The algorithm is based on the dead-end elimination procedure that makes it possible to avoid an exhaustive search. In the framework of the sum-of-pairs scoring system, certain rejection criteria are derived in order to eliminate those sequence segments and segment pairs that can be mathematically shown to be inconsistent (dead-ending) with the globally optimal alignment. Iterative application of the elimination criteria results in a rapid reduction of combinatorial possibilities without considering them explicitly. In the vast majority of cases, the procedure converges to a unique globally optimal solution. In contrast to the exhaustive search, whose computational complexity is combinatorial, the algorithm is computationally feasible because the number of operations required to eliminate the dead-ending segments and segment pairs grows quadratically and cubically, respectively, with the total number of sequence elements. The method is illustrated on a set of protein families for which the globally optimal alignments are well recognized. AVAILABILITY: The source code of the program implementing the algorithm is available upon request from the authors. CONTACT: alex_lukashin@biogen.com.     

In vivo protein-protein and protein-DNA crosslinking for genomewide binding microarray

Chromatin immunoprecipitation (ChrIP or ChIP) has commonly been used to map protein-DNA interaction sites at specific genomic loci through use of formaldehyde-induced crosslinking. However, formaldehyde alone has proved inadequate for crosslinking of certain proteins such as the yeast histone deacetylase Rpd3. We report here a modified crosslinking procedure that includes a protein-protein crosslinking agent in addition to formaldehyde. Using this double crosslinking method, we have successfully mapped Rpd3 binding sites in vivo. We also describe the use of ChrIP in combination with DNA microarrays (ChrIP-array) to determine the pattern of Rpd3 binding genomewide. This approach couples the versatility of ChrIP with that of microarrays to identify binding patterns that would otherwise be hidden in a gene-by-gene survey.     

Combinatorial chromatin modification patterns in the human genome revealed by subspace clustering

Chromatin modifications, such as post-translational modification of histone proteins and incorporation of histone variants, play an important role in regulating gene expression. Joint analyses of multiple histone modification maps are starting to reveal combinatorial patterns of modifications that are associated with functional DNA elements, providing support to the 'histone code' hypothesis. However, due to the lack of analytical methods, only a small number of chromatin modification patterns have been discovered so far. Here, we introduce a scalable subspace clustering algorithm, coherent and shifted bicluster identification (CoSBI), to exhaustively identify the set of combinatorial modification patterns across a given epigenome. Performance comparisons demonstrate that CoSBI can generate biclusters with higher intra-cluster coherency and biological relevance. We apply our algorithm to a compendium of 39 genome-wide chromatin modification maps in human CD4(+) T cells. We identify 843 combinatorial patterns that recur at >0.1% of the genome. A total of 19 chromatin modifications are observed in the combinatorial patterns, 10 of which occur in more than half of the patterns. We also identify combinatorial modification signatures for eight classes of functional DNA elements. Application of CoSBI to epigenome maps of different cells and developmental stages will aid in understanding how chromatin structure helps regulate gene expression.