HiCRep.py : Fast comparison of Hi-C contact matrices in Python.
Ontology highlight
ABSTRACT: Motivation
Hi-C is the most widely used assay for investigating genome-wide 3D organization of chromatin. When working with Hi-C data, it is often useful to calculate the similarity between contact matrices in order to asses experimental reproducibility or to quantify relationships among Hi-C data from related samples. The HiCRep algorithm has been widely adopted for this task, but the existing R implementation suffers from run time limitations on high resolution Hi-C data or on large single-cell Hi-C datasets.Results
We introduce a Python implementation of HiCRep and demonstrate that it is much faster and consume much less memory than the existing R implementation. Furthermore, we give examples of HiCRep's ability to accurately distinguish replicates from non-replicates and to reveal cell type structure among collections of Hi-C data.Availability
HiCRep.py and its documentation are available with a GPL license at https://github.com/Noble-Lab/hicrep. The software may be installed automatically using the pip package installer.Supplementary information
Supplementary methods and results are included in an appendix at Bioinformatics online.
SUBMITTER: Lin D
PROVIDER: S-EPMC8479650 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Three-dimensional chromosome structure plays an important role in fundamental genomic functions. Hi-C, a high-throughput, sequencing-based technique, has drastically expanded our comprehension of 3D chromosome structures. The first step of Hi-C analysis pipeline involves mapping sequencing reads from Hi-C to linear reference genomes. However, the linear reference genome does not incorporate genetic variation information, which can lead to incorrect read alignments, especially when analyzing samples with substantial genomic differences from the reference such as cancer samples. Using genome graphs as the reference facilitates more accurate mapping of reads, however, new algorithms are required for inferring linear genomes from Hi-C reads mapped on genome graphs and constructing corresponding Hi-C contact matrices, which is a prerequisite for the subsequent steps of the Hi-C analysis such as identifying topologically associated domains and calling chromatin loops. We introduce the problem of genome sequence inference from Hi-C data mediated by genome graphs. We formalize this problem, show the hardness of solving this problem, and introduce a novel heuristic algorithm specifically tailored to this problem. We provide a theoretical analysis to evaluate the efficacy of our algorithm. Finally, our empirical experiments indicate that the linear genomes inferred from our method lead to the creation of improved Hi-C contact matrices. These enhanced matrices show a reduction in erroneous patterns caused by structural variations and are more effective in accurately capturing the structures of topologically associated domains.
| S-EPMC10659349 | biostudies-literature
Project description:Numerous biophysical approaches provide information about residues spatial proximity in proteins. However, correct assignment of the protein fold from this proximity information is not straightforward if the spatially close protein residues are not assigned to residues in the primary sequence. Here, we propose an algorithm to assign such residue numbers by ordering the columns and lines of the raw protein contact matrix directly obtained from proximity information between unassigned amino acids. The ordering problem is formatted as the search of a trail within a graph connecting protein residues through the nonzero contact values. The algorithm performs in two steps: (i) finding the longest trail of the graph using an original dynamic programming algorithm, (ii) clustering the individual ordered matrices using a self-organizing map (SOM) approach. The combination of the dynamic programming and self-organizing map approaches constitutes a quite innovative point of the present work. The algorithm was validated on a set of about 900 proteins, representative of the sizes and proportions of secondary structures observed in the Protein Data Bank. The algorithm was revealed to be efficient for noise levels up to 40%, obtaining average gaps of about 20% at maximum between ordered and initial matrices. The proposed approach paves the ways toward a method of fold prediction from noisy proximity information, as TM scores larger than 0.5 have been obtained for ten randomly chosen proteins, in the case of a noise level of 10%. The methods has been also validated on two experimental cases, on which it performed satisfactorily.
| S-EPMC5889711 | biostudies-literature
Project description:Recent advances in protein residue contact prediction algorithms have led to the emergence of many new methods and a variety of file formats. We present ConKit , an open source, modular and extensible Python interface which allows facile conversion between formats and provides an interface to analyses of sequence alignments and sets of contact predictions.ConKit is available via the Python Package Index. The documentation can be found at http://www.conkit.org . ConKit is licensed under the BSD 3-Clause.hlfsimko@liverpool.ac.uk or drigden@liverpool.ac.uk.Supplementary data are available at Bioinformatics online.
| S-EPMC5870551 | biostudies-literature
Project description:The three-dimensional (3D) organization of the genome plays an important role in gene regulation bringing distal sequence elements in 3D proximity to genes hundreds of kilobases away. Hi-C is a powerful genome-wide technique to study 3D genome organization. Owing to experimental costs, high resolution Hi-C datasets are limited to a few cell lines. Computational prediction of Hi-C counts can offer a scalable and inexpensive approach to examine 3D genome organization across multiple cellular contexts. Here we present HiC-Reg, an approach to predict contact counts from one-dimensional regulatory signals. HiC-Reg predictions identify topologically associating domains and significant interactions that are enriched for CCCTC-binding factor (CTCF) bidirectional motifs and interactions identified from complementary sources. CTCF and chromatin marks, especially repressive and elongation marks, are most important for HiC-Reg's predictive performance. Taken together, HiC-Reg provides a powerful framework to generate high-resolution profiles of contact counts that can be used to study individual locus level interactions and higher-order organizational units of the genome.
| S-EPMC6898380 | biostudies-literature
Project description:The modeling of large-scale communicable epidemics has greatly benefited in the last years from the increasing availability of highly detailed data. Particullarly, in order to achieve quantitative descriptions of the evolution of epidemics, contact networks and mixing patterns are key. These heterogeneous patterns depend on several factors such as location, socioeconomic conditions, time, and age. This last factor has been shown to encapsulate a large fraction of the observed inter-individual variation in contact patterns, an observation validated by different measurements of age-dependent contact matrices. Recently, several works have studied how to project those matrices to areas where empirical data are not available. However, the dependence of contact matrices on demographic structures and their time evolution has been largely neglected. In this work, we tackle the problem of how to transform an empirical contact matrix that has been obtained for a given demographic structure into a different contact matrix that is compatible with a different demography. The methodology discussed here allows to extrapolate a contact structure measured in a particular area to any other whose demographic structure is known, as well as to obtain the time evolution of contact matrices as a function of the demographic dynamics of the populations they refer to. To quantify the effect of considering time-dynamics of contact patterns on disease modeling, we implemented a Susceptible-Exposed-Infected-Recovered (SEIR) model on 16 different countries and regions and evaluated the impact of neglecting the temporal evolution of mixing patterns. Our results show that simulated disease incidence rates, both at the aggregated and age-specific levels, are significantly dependent on contact structures variation driven by demographic evolution. The present work opens the path to eliminate technical biases from model-based impact evaluations of future epidemic threats and warns against the use of contact matrices to model diseases without correcting for demographic evolution or geographic variations.
| S-EPMC6300299 | biostudies-literature
Project description:Hi-C is one of the most widely used approaches to study three-dimensional genome conformations. Contacts captured by a Hi-C experiment are represented in a contact frequency matrix. Due to the limited sequencing depth and other factors, Hi-C contact frequency matrices are only approximations of the true interaction frequencies and are further reported without any quantification of uncertainty. Hence, downstream analyses based on Hi-C contact maps (e.g., TAD and loop annotation) are themselves point estimations. Here, we present the Hi-C interaction frequency sampler (HiCSampler) that reliably infers the posterior distribution of the interaction frequency for a given Hi-C contact map by exploiting dependencies between neighboring loci. Posterior predictive checks demonstrate that HiCSampler can infer highly predictive chromosomal interaction frequency. Summary statistics calculated by HiCSampler provide a measurement of the uncertainty for Hi-C experiments, and samples inferred by HiCSampler are ready for use by most downstream analysis tools off the shelf and permit uncertainty measurements in these analyses without modifications.
| S-EPMC10919286 | biostudies-literature
Project description:Heterogeneities in contact networks have a major effect in determining whether a pathogen can become epidemic or persist at endemic levels. Epidemic models that determine which interventions can successfully prevent an outbreak need to account for social structure and mixing patterns. Contact patterns vary across age and locations (e.g. home, work, and school), and including them as predictors in transmission dynamic models of pathogens that spread socially will improve the models' realism. Data from population-based contact diaries in eight European countries from the POLYMOD study were projected to 144 other countries using a Bayesian hierarchical model that estimated the proclivity of age-and-location-specific contact patterns for the countries, using Markov chain Monte Carlo simulation. Household level data from the Demographic and Health Surveys for nine lower-income countries and socio-demographic factors from several on-line databases for 152 countries were used to quantify similarity of countries to estimate contact patterns in the home, work, school and other locations for countries for which no contact data are available, accounting for demographic structure, household structure where known, and a variety of metrics including workforce participation and school enrolment. Contacts are highly assortative with age across all countries considered, but pronounced regional differences in the age-specific contacts at home were noticeable, with more inter-generational contacts in Asian countries than in other settings. Moreover, there were variations in contact patterns by location, with work-place contacts being least assortative. These variations led to differences in the effect of social distancing measures in an age structured epidemic model. Contacts have an important role in transmission dynamic models that use contact rates to characterize the spread of contact-transmissible diseases. This study provides estimates of mixing patterns for societies for which contact data such as POLYMOD are not yet available.
| S-EPMC5609774 | biostudies-literature
Project description:Learning low-dimensional representations (embeddings) of nodes in large graphs is key to applying machine learning on massive biological networks. Node2vec is the most widely used method for node embedding. However, its original Python and C ++ implementations scale poorly with network density, failing for dense biological networks with hundreds of millions of edges. We have developed PecanPy, a new Python implementation of node2vec that uses cache-optimized compact graph data structures and precomputing/parallelization to result in fast, high-quality node embeddings for biological networks of all sizes and densities. PecanPy software is freely available at https://github.com/krishnanlab/PecanPy. Supplementary data are available at Bioinformatics online.
| S-EPMC8504639 | biostudies-literature
Project description:Summary:The genome-wide chromosome conformation capture (Hi-C) has revealed that the eukaryotic genome can be partitioned into A and B compartments that have distinctive chromatin and transcription features. Current Principle Component Analyses (PCA)-based method for the A/B compartment prediction based on Hi-C data requires substantial CPU time and memory. We report the development of a method, CscoreTool, which enables fast and memory-efficient determination of A/B compartments at high resolution even in datasets with low sequencing depth. Availability and implementation:https://github.com/scoutzxb/CscoreTool. Contact:xzheng@carnegiescience.edu. Supplementary information:Supplementary data are available at Bioinformatics online.
| S-EPMC5925784 | biostudies-literature
Project description:Mathematical models have played a key role in understanding the spread of directly-transmissible infectious diseases such as Coronavirus Disease 2019 (COVID-19), as well as the effectiveness of public health responses. As the risk of contracting directly-transmitted infections depends on who interacts with whom, mathematical models often use contact matrices to characterise the spread of infectious pathogens. These contact matrices are usually generated from diary-based contact surveys. However, the majority of places in the world do not have representative empirical contact studies, so synthetic contact matrices have been constructed using more widely available setting-specific survey data on household, school, classroom, and workplace composition combined with empirical data on contact patterns in Europe. In 2017, the largest set of synthetic contact matrices to date were published for 152 geographical locations. In this study, we update these matrices with the most recent data and extend our analysis to 177 geographical locations. Due to the observed geographic differences within countries, we also quantify contact patterns in rural and urban settings where data is available. Further, we compare both the 2017 and 2020 synthetic matrices to out-of-sample empirically-constructed contact matrices, and explore the effects of using both the empirical and synthetic contact matrices when modelling physical distancing interventions for the COVID-19 pandemic. We found that the synthetic contact matrices show qualitative similarities to the contact patterns in the empirically-constructed contact matrices. Models parameterised with the empirical and synthetic matrices generated similar findings with few differences observed in age groups where the empirical matrices have missing or aggregated age groups. This finding means that synthetic contact matrices may be used in modelling outbreaks in settings for which empirical studies have yet to be conducted.
| S-EPMC8354454 | biostudies-literature