PAIR: Reconstructing Single‐Cell Open‐Chromatin Landscapes for Transcription Factor Regulome Mapping
Source abstract
Abstract
ABSTRACT Single‐cell ATAC‐seq (scATAC‐seq) enables the interrogation of chromatin accessibility at cellular resolution, yet its practical utility is often constrained by limited sequencing depth, extreme sparsity, and pervasive technical missingness, which collectively hamper robust cell‐state delineation and inference of transcription factor (TF) regulatory programs. We present PAIR, a probabilistic framework that restores scATAC‐seq accessibility profiles by directly modeling the native cell–peak bipartite structure of chromatin accessibility. PAIR leverages a bipartite graph encoder to learn representations for both cells and peaks, and incorporates a variational latent layer to explicitly capture uncertainty arising from sparse and noisy measurements. To jointly recover discrete accessibility patterns and quantitative signal, PAIR integrates two complementary decoders: a qualitative decoder that reconstructs open/closed cell–peak incidences and a quantitative decoder that models accessibility counts under a Negative Binomial likelihood. Trained end‐to‐end with variational and embedding regularization, PAIR yields cell and peak embeddings and an imputed accessibility matrix that improves downstream analyses. Across simulated datasets with controlled sequencing depth, noise, and dropout, as well as multiple publicly available benchmarks, PAIR consistently improves clustering performance and increases sensitivity for differential accessibility. Beyond cell‐level analyses, PAIR‐derived peak embedding enables locus‐centric regulatory interrogation: co‐accessibility analysis around SOX10 reveals structured regulatory neighborhoods, and graph‐based peak modules show selective activity across melanoma cell states and identify gene sets with clinically relevant survival associations. In a forebrain atlas, PAIR restores regulatory signals spanning both promoter‐proximal and distal elements and uncovers biologically coherent enrichment patterns consistent with neuronal specialization.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Single-cell and spatial transcriptomics · Genomics and Chromatin Dynamics · Cell Image Analysis Techniques
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Information Science and Technology Northeast Normal University Jilin China
School of Artificial Intelligence Jilin University Jilin China
Department of Computer Science City University of Hong Kong Hong Kong SAR
School of Artificial Intelligence Hebei University of Technology Tianjin China
Funding
National Natural Science Foundation of China · Fundamental Research Funds for the Central Universities · Northeast Normal University
References (51)
Show source-provided references
1. 10.1038/s41587-019-0206-z10.1038/s41587-019-0206-z ↗
2. 10.1038/s41587-019-0147-610.1038/s41587-019-0147-6 ↗
3. 10.1038/s41467-018-07771-010.1038/s41467-018-07771-0 ↗
4. 10.1038/s41576-022-00509-110.1038/s41576-022-00509-1 ↗
5. 10.1093/bib/bbae09310.1093/bib/bbae093 ↗
6. 10.1126/sciadv.abl739310.1126/sciadv.abl7393 ↗
7. 10.1038/s41592-023-02112-610.1038/s41592-023-02112-6 ↗
8. 10.1093/bioinformatics/btac57010.1093/bioinformatics/btac570 ↗
9. 10.1002/advs.20230728010.1002/advs.202307280 ↗
10. 10.1038/s41467-023-36134-710.1038/s41467-023-36134-7 ↗
11. 10.1002/advs.20250924710.1002/advs.202509247 ↗
12. D. V.Dijk J.Nainys R.Sharma et al. “MAGIC: A Diffusion‐Based Imputation Method Reveals Gene‐Gene Interactions in Single‐Cell RNA‐Sequencing Data ”BioRxiv(2017) 111591.10.1101/111591 ↗
13. 10.1038/s41467-021-21583-910.1038/s41467-021-21583-9 ↗
14. 10.1038/s41592-019-0367-110.1038/s41592-019-0367-1 ↗
15. 10.1038/s41467-019-12630-710.1038/s41467-019-12630-7 ↗
16. 10.1038/s41467-021-26530-210.1038/s41467-021-26530-2 ↗
17. 10.1038/s41588-021-00790-610.1038/s41588-021-00790-6 ↗
18. 10.1038/s41592-021-01282-510.1038/s41592-021-01282-5 ↗
19. 10.1038/s41592-023-02139-910.1038/s41592-023-02139-9 ↗
20. 10.1016/j.crmeth.2022.10018210.1016/j.crmeth.2022.100182 ↗
21. 10.1002/advs.20250909010.1002/advs.202509090 ↗
22. 10.1038/s42003-025-08810-510.1038/s42003-025-08810-5 ↗
23. 10.1093/bib/bbae55110.1093/bib/bbae551 ↗
24. 10.1093/bib/bbae57110.1093/bib/bbae571 ↗
25. 10.1371/journal.pcbi.101288110.1371/journal.pcbi.1012881 ↗
26. 10.1016/j.cell.2018.03.07410.1016/j.cell.2018.03.074 ↗
27. 10.1038/s42003-021-02211-010.1038/s42003-021-02211-0 ↗
28. 10.1038/modpathol.2009.15710.1038/modpathol.2009.157 ↗
29. 10.1007/s40257-018-0414-110.1007/s40257-018-0414-1 ↗
30. 10.1038/s41418-017-0030-210.1038/s41418-017-0030-2 ↗
31. 10.3389/fonc.2016.0024010.3389/fonc.2016.00240 ↗
32. 10.1038/s41467-025-65362-210.1038/s41467-025-65362-2 ↗
33. 10.1126/science.ads660110.1126/science.ads6601 ↗
34. 10.1093/bioinformatics/btv14510.1093/bioinformatics/btv145 ↗
35. 10.1093/cercor/bhr18210.1093/cercor/bhr182 ↗
36. 10.1073/pnas.150714511210.1073/pnas.1507145112 ↗
37. 10.1016/j.conb.2020.03.01210.1016/j.conb.2020.03.012 ↗
38. 10.1038/s41586-021-03500-810.1038/s41586-021-03500-8 ↗
39. 10.1038/s41586-025-09644-110.1038/s41586-025-09644-1 ↗
40. 10.1093/bioinformatics/btac74510.1093/bioinformatics/btac745 ↗
41. 10.3389/fncir.2023.125645510.3389/fncir.2023.1256455 ↗
42. 10.1038/s41583-023-00742-510.1038/s41583-023-00742-5 ↗
43. X.He K.Deng X.Wang Y.Li Y.Zhang andM.Wang “LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation ” inProceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval(2020) 639–648.10.1145/3397271.3401063 ↗
44. T. N.KipfandM.Welling “Variational Graph Auto‐Encoders ”arXiv Preprint arXiv:1611.07308(2016).
45. 10.1186/s13059-019-1854-510.1186/s13059-019-1854-5 ↗
46. 10.1038/s41598-019-41695-z10.1038/s41598-019-41695-z ↗
47. Scikit‐Learn: Machine Learning in Python
48. 10.1016/0377-0427(87)90125-710.1016/0377-0427(87)90125-7 ↗
49. 10.1038/s41592-019-0619-010.1038/s41592-019-0619-0 ↗
50. 10.1038/s41592-021-01336-810.1038/s41592-021-01336-8 ↗
51. 10.1038/s41592-018-0254-110.1038/s41592-018-0254-1 ↗