Evidence map›Paper›PMID 41366351›Full record

ArticleCommunications biology2025

EmbedTAD Using Graph Embedding and Unsupervised Learning to Identify TADs from High-Resolution Hi-C Data.

H M A Mohit Chowdhury, Oluwatosin Oluwadare

Abstract read
In one paragraph

Article in Communications biology, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing 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

2 citing papers in PubMed.

  1. Article
  2. 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

2 authors.

H M A Mohit ChowdhuryDepartment of Computer Science and Engineering, University of North Texas, Denton, TX, USA.ORCID http://orcid.org/0009-0000-8687-4064
Oluwatosin OluwadareDepartment of Computer Science and Engineering, University of North Texas, Denton, TX, USA. oluwatosin.oluwadare@unt.edu.ORCID http://orcid.org/0000-0002-5264-2342

Funding

Can one size fit all? - High-Resolution 3D Genome Spatial Organization Inference with Generalizable ModelsR35GM150402 · NIGMS · UNIVERSITY OF NORTH TEXAS · PI Oluwatosin Oluwadare · 2023 to 2026
$1.3M
NIGMS NIH HHS R35 GM150402U.S. Department of Health & Human Services | NIH | National Institute of General Medical Sciences (NIGMS) R35GM150402
6 · The paper itself

Abstract

Topologically Associating Domains (TADs) serve a functional purpose as self-interacting regions whose boundaries are enriched with various proteins. Identifying these TAD regions is essential for examining several biological characteristics, including immune system function and chromosome organization. In this study, we propose EmbedTAD for identifying TAD regions from high-resolution Hi-C data. To achieve this, we utilize NetMF, a graph embedding technique that employs low computational resources, and cluster the embeddings into TAD regions using the HDBSCAN algorithm. We demonstrate that, during T-cell differentiation, EmbedTAD detects TAD rearrangements and can differentiate between active and inactive cells. Furthermore, we show that EmbedTAD recovers a significant number of TADs also present in PLAC-seq data, demonstrating its reproducibility. We confirm that EmbedTAD detects TADs with distinct ChIP-seq signals surrounding their boundaries, including CTCF, RAD21, and SMC3. Overall, EmbedTAD reliably and efficiently identifies TADs with minimal computational resources, outperforming many state-of-the-art methods.

Indexed as

ChromatinComputational BiologyUnsupervised Machine LearningAlgorithmsCell DifferentiationChromatin Immunoprecipitation SequencingHumansT-LymphocytesChromatin

Identifiers

PMID41366351
PMCPMC12764586

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.