Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Random Sampling Method01:09

Random Sampling Method

15.8K
Sampling is a technique to select a portion (or subset) of the larger population and study that portion (the sample) to gain information about the population. Data are the result of sampling from a population. The sampling method ensures that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest. Among the various sampling methods used by...
15.8K
Randomized Experiments01:13

Randomized Experiments

9.3K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
9.3K
Censoring Survival Data01:09

Censoring Survival Data

654
Survival analysis is a statistical method used to analyze time-to-event data, often employed in fields such as medicine, engineering, and social sciences. One of the key challenges in survival analysis is dealing with incomplete data, a phenomenon known as "censoring." Censoring occurs when the event of interest (such as death, relapse, or system failure) has not occurred for some individuals by the end of the study period or is otherwise unobservable, and it might have many different...
654

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks.

Entropy (Basel, Switzerland)·2026
Same author

Characterizing behavioural differentiation in gene regulatory networks with representation graphs.

NAR genomics and bioinformatics·2024
Same author

Transcriptional Hubs Within Cliques in Ensemble Hi-C Chromatin Interaction Networks.

Journal of computational biology : a journal of computational molecular cell biology·2024
Same author

Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma.

Clinical cancer research : an official journal of the American Association for Cancer Research·2023
Same author

Behavioral dynamics of bacteriophage gene regulatory networks.

Journal of bioinformatics and computational biology·2022
Same author

Morphological findings in frozen non-neoplastic kidney tissues of patients with kidney cancer from large-scale multicentric studies on renal cancer.

Virchows Archiv : an international journal of pathology·2021
Same journal

CNV-ECOD: A copy number variation detection method based on ECOD algorithm using next-generation sequencing data.

Journal of bioinformatics and computational biology·2026
Same journal

ReinVar: A model-free paradigm-based reinforcement learning approach to detect copy number variation.

Journal of bioinformatics and computational biology·2026
Same journal

When pipelines run but coordinates fail: A simple spatial specificity check for false locality in post-GWAS analysis.

Journal of bioinformatics and computational biology·2026
Same journal

Comparative benchmarking of template-based, evolutionary-diffusion, and generative language models for IsPETase structure prediction.

Journal of bioinformatics and computational biology·2026
Same journal

Trap spaces as labelled ideals of SCC posets: A structural-functional theory of reachability in asynchronous boolean networks.

Journal of bioinformatics and computational biology·2026
Same journal

Erratum - DDINet: Drug-drug interaction prediction network based on multi-molecular fingerprint features and multi-head attention centered weighted autoencoder.

Journal of bioinformatics and computational biology·2026
See all related articles

Related Experiment Video

Updated: Apr 9, 2026

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.
22:27

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.

Published on: May 6, 2010

408.9K

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

Andrejs Sizovs1, Gatis Melkus1, Peteris Rucevskis1

  • 1Institute of Mathematics and Computer Science, University of Latvia, Rainis Boulevard 29, Riga LV-1459, Latvia.

Journal of Bioinformatics and Computational Biology
|August 26, 2024
PubMed
Summary
This summary is machine-generated.

We developed a new algorithm to create simulated chromatin interaction networks. This method preserves key network features, aiding in quality assessment and validation of Hi-C data analysis.

Keywords:
Chromatin interaction graphsHi-C data simulationbiological networksensemble Hi-C data

More Related Videos

Capturing Chromosome Conformation Across Length Scales
10:15

Capturing Chromosome Conformation Across Length Scales

Published on: January 20, 2023

3.4K
Deciphering High-Resolution 3D Chromatin Organization via Capture Hi-C
09:32

Deciphering High-Resolution 3D Chromatin Organization via Capture Hi-C

Published on: October 14, 2022

3.4K

Related Experiment Videos

Last Updated: Apr 9, 2026

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.
22:27

Hi-C: A Method to Study the Three-dimensional Architecture of Genomes.

Published on: May 6, 2010

408.9K
Capturing Chromosome Conformation Across Length Scales
10:15

Capturing Chromosome Conformation Across Length Scales

Published on: January 20, 2023

3.4K
Deciphering High-Resolution 3D Chromatin Organization via Capture Hi-C
09:32

Deciphering High-Resolution 3D Chromatin Organization via Capture Hi-C

Published on: October 14, 2022

3.4K

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.