A technique for preserving network structure in randomized Hi-C data

Area of Science:

• Genomics
• Bioinformatics
• Computational Biology

Background:

• Chromatin interaction data, often from Hi-C experiments, is analyzed as networks to understand chromatin structure.
• Hi-C experiments are expensive, necessitating simulated data for validation and quality control.
• Current network randomization tools often fail to preserve essential topological properties.

Purpose of the Study:

• To propose a novel algorithm for modifying existing chromatin interaction graphs.
• To ensure that the randomization process maintains fundamental network topological features.
• To provide a tool for generating reliable simulated chromatin interaction networks.

Main Methods:

• Development of a Python-based algorithm to alter chromatin interaction graphs.
• Focus on preserving node degrees and interaction length distribution during network modification.
• Implementation of the algorithm with open-source code and reproducible data.

Main Results:

• The proposed algorithm successfully modifies chromatin interaction graphs.
• Preservation of key topological features, specifically node degrees and interaction length distribution, was achieved.
• The method provides a viable approach for generating validated simulated networks.

Conclusions:

• The developed algorithm offers a robust method for simulating chromatin interaction networks.
• This approach addresses the limitations of existing tools by preserving critical network properties.
• The open-source availability facilitates its use in quality assessment and result validation for Hi-C data.