preciseTAD
preciseTAD predicts topologically associating domain (TAD) and chromatin loop boundaries at base-pair resolution to enable precise mapping of 3D genome boundary locations for studies of chromatin organization.
Key Features:
- Base-pair resolution prediction: Predicts domain and loop boundaries at base-level resolution, enabling identification of exact binding locations of boundary-forming proteins such as CTCF and cohesin.
- Optimized transfer learning framework: Uses an optimized transfer learning approach trained on high-resolution genome annotation data to enhance predictive accuracy and robustness.
- Experimental evidence support: Produces predictions that are supported by experimental evidence ensuring biological relevance of identified boundaries.
- Functionality without Hi-C data: Can accurately predict domain boundaries in cells lacking Hi-C data, extending applicability to datasets without Hi-C contact maps.
Scientific Applications:
- 3D genome structure analysis: Enables high-resolution mapping of TAD and loop boundaries for studies of chromatin architecture.
- Regulatory mechanism investigation: Facilitates analysis of how genomic regulators influence chromatin organization at granular resolution.
- Gene regulation and chromosomal stability studies: Supports research into the roles of boundary locations in gene regulation and chromosomal stability.
- Disease-associated structural variation analysis: Provides insights into the molecular basis of diseases linked to structural genomic alterations.
Methodology:
A machine learning framework integrates high-resolution genome annotation data with an optimized transfer learning approach to predict TAD and chromatin loop boundaries at base-pair resolution.
Topics
Details
- License:
- MIT
- Programming Languages:
- R
- Added:
- 1/18/2021
- Last Updated:
- 1/27/2021
Operations
Publications
Stilianoudakis SC, Marshall MA, Dozmorov MG. preciseTAD: A transfer learning framework for 3D domain boundary prediction at base-pair resolution. Unknown Journal. 2020. doi:10.1101/2020.09.03.282186.