Evidence map›Paper›PMID 28742097›Full record

ArticlePLoS computational biology2017

MrTADFinder: A network modularity based approach to identify topologically associating domains in multiple resolutions.

Koon-Kiu Yan, Shaoke Lou, Mark Gerstein

Abstract read
In one paragraph

Article in PLoS computational biology, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 34 papers.

0numbers the graph read from it
0cells of the map it votes in
34citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

34 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. [An identification method of chromatin topological associated domains based on spatial density clustering].Sheng wu yi xue gong cheng xue za zhi = Journal of biomedical engineering = Shengwu yixue gongchengxue zazhi · 2024
    Article
  8. Review
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Review
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Koon-Kiu YanProgram in Computational Biology and Bioinformatics, Yale University, New Haven, CT, United States of America.ORCID http://orcid.org/0000-0003-2337-485X
Shaoke LouProgram in Computational Biology and Bioinformatics, Yale University, New Haven, CT, United States of America.ORCID http://orcid.org/0000-0002-2626-5897
Mark GersteinProgram in Computational Biology and Bioinformatics, Yale University, New Haven, CT, United States of America.ORCID http://orcid.org/0000-0002-9746-3719

Funding

EDAC: ENCODE Data Analysis CenterU24HG009446 · NHGRI · UNIV OF MASSACHUSETTS MED SCH WORCESTER · PI GERSTEIN, MARK BENDER, WENG, ZHIPING · 2017 to 2022
$10.4M
EDAC: ENCODE Data Analysis CenterU41HG007000 · NHGRI · UNIV OF MASSACHUSETTS MED SCH WORCESTER · PI WENG, ZHIPING · 2012 to 2016
$9.8M
NHGRI NIH HHS U24 HG009446NHGRI NIH HHS U41 HG007000
6 · The paper itself

Abstract

Genome-wide proximity ligation based assays such as Hi-C have revealed that eukaryotic genomes are organized into structural units called topologically associating domains (TADs). From a visual examination of the chromosomal contact map, however, it is clear that the organization of the domains is not simple or obvious. Instead, TADs exhibit various length scales and, in many cases, a nested arrangement. Here, by exploiting the resemblance between TADs in a chromosomal contact map and densely connected modules in a network, we formulate TAD identification as a network optimization problem and propose an algorithm, MrTADFinder, to identify TADs from intra-chromosomal contact maps. MrTADFinder is based on the network-science concept of modularity. A key component of it is deriving an appropriate background model for contacts in a random chain, by numerically solving a set of matrix equations. The background model preserves the observed coverage of each genomic bin as well as the distance dependence of the contact frequency for any pair of bins exhibited by the empirical map. Also, by introducing a tunable resolution parameter, MrTADFinder provides a self-consistent approach for identifying TADs at different length scales, hence the acronym "Mr" standing for Multiple Resolutions. We then apply MrTADFinder to various Hi-C datasets. The identified domain boundaries are marked by characteristic signatures in chromatin marks and transcription factors (TF) that are consistent with earlier work. Moreover, by calling TADs at different length scales, we observe that boundary signatures change with resolution, with different chromatin features having different characteristic length scales. Furthermore, we report an enrichment of HOT (high-occupancy target) regions near TAD boundaries and investigate the role of different TFs in determining boundaries at various resolutions. To further explore the interplay between TADs and epigenetic marks, as tumor mutational burden is known to be coupled to chromatin structure, we examine how somatic mutations are distributed across boundaries and find a clear stepwise pattern. Overall, MrTADFinder provides a novel computational framework to explore the multi-scale structures in Hi-C contact maps.

Indexed as

ChromatinChromosomesModels, GeneticAlgorithmsCell LineCell NucleusComputational BiologyGenomeHumansProtein BindingTranscription FactorsChromatinTranscription Factors

Identifiers

PMID28742097
PMCPMC5546724

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.