Abstract
Chromatin interaction data are frequently analyzed as a network to study several aspects of chromatin structure. Hi-C experiments are costly and there is a need to create simulated networks for quality assessment or result validation purposes. Existing tools do not maintain network properties during randomization. We propose an algorithm to modify an existing chromatin interaction graph while preserving the graphs most basic topological features- node degrees and interaction length distribution. The algorithm is implemented in Python and its open-source code as well as the data to reproduce the results are available on Github.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of bioinformatics and computational biology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
