Evidence map›Paper›PMID 26315910›Full record

ArticleBioinformatics (Oxford, England)2016

Identification of hierarchical chromatin domains.

Caleb Weinreb, Benjamin J Raphael

Open access · bronzeAbstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 92 papers.

0numbers the graph read from it
0cells of the map it votes in
92citing papers in PubMed
8.3field-weighted citation impact, top 2% of its field
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

92 citing papers in PubMed, 179 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. Machine and Deep Learning Methods for Predicting 3D Genome Organization.Methods in molecular biology (Clifton, N.J.) · 2025
    Review
  10. Article
  11. [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
  12. Article
  13. Article
  14. Article
  15. Review
  16. Review
  17. Revisiting Assessment of Computational Methods for Hi-C Data Analysis.International journal of molecular sciences · 2023
    Article
  18. Article
  19. Review
  20. Article

32 more citing papers are in PubMed but not listed here.

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

2 authors at 1 institution in 1 country.

Caleb WeinrebCenter for Computational Molecular Biology and.
Benjamin J RaphaelCenter for Computational Molecular Biology and Department of Computer Science, Brown University, Providence, RI 02912, USA.
Brown University · US

Funding

Computational Approaches for Structural Variation Studies in GenomesR01HG005690 · NHGRI · BROWN UNIVERSITY · PI RAPHAEL, BENJAMIN · 2011 to 2015
$2.4M
NHGRI NIH HHS R01 HG005690
6 · The paper itself

Abstract

motivationThe three-dimensional structure of the genome is an important regulator of many cellular processes including differentiation and gene regulation. Recently, technologies such as Hi-C that combine proximity ligation with high-throughput sequencing have revealed domains of self-interacting chromatin, called topologically associating domains (TADs), in many organisms. Current methods for identifying TADs using Hi-C data assume that TADs are non-overlapping, despite evidence for a nested structure in which TADs and sub-TADs form a complex hierarchy.

resultsWe introduce a model for decomposition of contact frequencies into a hierarchy of nested TADs. This model is based on empirical distributions of contact frequencies within TADs, where positions that are far apart have a greater enrichment of contacts than positions that are close together. We find that the increase in contact enrichment with distance is stronger for the inner TAD than for the outer TAD in a TAD/sub-TAD pair. Using this model, we develop the TADtree algorithm for detecting hierarchies of nested TADs. TADtree compares favorably with previous methods, finding TADs with a greater enrichment of chromatin marks such as CTCF at their boundaries. AVAILABILITY AND IMPLEMENTATION: A python implementation of TADtree is available at http://compbio.cs.brown.edu/software/ CONTACT: braphael@cs.brown.edu SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

ChromatinCell DifferentiationGene Expression RegulationGenomeChromatin

Identifiers

PMID26315910
PMCPMC4892410
OpenAlexW2310342073

What OpenQuestion holds

Textmetadata
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.