![]() Minimum pairwise genomic distance constraint for multi-way interactions (in unit of the number of bins) Note that, some scripts only use part of these parameters, so these parameters can be filled in before running those specific script. Please fill in this file before running the program. The visualization part of the algorihtm ( denoise_contact.py) requiresĪll the input parameters are stored in the config.JSON file. ![]() The main part of the alogrithm ( process.py, generate_kmers.py, main.py) requires This is the implementation of the algorithm MATCHA for analyzing multi-way chromatin interaction data via hypergraph representation learning. MATCHA: Probing multi-way chromatin interaction with hypergraph representation learning
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |