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

Genome Annotation and Assembly03:36

Genome Annotation and Assembly

16.6K
The genome refers to all of the genetic material in an organism. It can range from a few million base pairs in microbial cells to several billion base pairs in many eukaryotic organisms. Genome assembly refers to the process of taking the DNA sequencing data and putting it all back together in a correct order to create a close representation of the original genome. This is followed by the identification of functional elements on the newly assembled genome, a process called genome annotation.
16.6K
Genome-wide Association Studies-GWAS01:11

Genome-wide Association Studies-GWAS

12.4K
Genome-wide association studies or GWAS are used to identify whether common SNPs are associated with certain diseases. Suppose specific SNPs are more frequently observed in individuals with a particular disease than those without the disease. In that case, those SNPs are said to be associated with the disease. Chi-square analysis is performed to check the probability of the allele likely to be associated with the disease.
GWAS does not require the identification of the target gene involved in...
12.4K

You might also read

Related Articles

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

Sort by
Same author

Multimodal learning on heterogeneous subgraphs and LLMs representation for MHC-peptide binding affinity prediction.

BMC bioinformatics·2026
Same author

S3RL: Enhancing Spatial Single-Cell Transcriptomics With Separable Representation Learning.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same author

Preparation of robust, antibacterial, and ionically conductive hydrogels via hydrogen bonding-annealing synergy for triboelectric nanogenerators.

Journal of colloid and interface science·2025
Same author

Dynamic Graph Attention Meets Pretrained Language Models: Adaptive K-Mer Decomposition for LncRNA-Protein Interaction Prediction.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Rapid screening of glyphosate in environmental water based on Ponceau 4R-Cu<sup>2+</sup> competitive complexation.

Analytical methods : advancing methods and applications·2025
Same author

Compound Interaction Presentation Learning for MHC-Peptide Binding Affinity Prediction.

IEEE transactions on computational biology and bioinformatics·2025

Related Experiment Video

Updated: Apr 27, 2026

Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies
12:08

Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies

Published on: August 20, 2021

7.3K

An effective haplotype assembly algorithm based on hypergraph partitioning.

Xiao Chen1, Qinke Peng1, Libin Han1

  • 1Systems Engineering Institute, School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an 710049, China.

Journal of Theoretical Biology
|June 24, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces HGHap, a novel hypergraph partitioning method for haplotype assembly. HGHap improves accuracy, especially with high error rates in SNP fragments, overcoming limitations of traditional heuristic algorithms.

Keywords:
Computational biologyShared nearest neighborsSingle individual haplotypingSingle nucleotide polymorphism

More Related Videos

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.1K
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

414.5K

Related Experiment Videos

Last Updated: Apr 27, 2026

Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies
12:08

Hybrid De Novo Genome Assembly for the Generation of Complete Genomes of Urinary Bacteria using Short- and Long-read Sequencing Technologies

Published on: August 20, 2021

7.3K
Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

2.1K
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

414.5K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genetics

Background:

  • Haplotype assembly is a complex computational problem.
  • Current heuristic algorithms struggle with increasing error rates in SNP fragments.
  • Fragment errors create complex relationships hindering accurate haplotype assembly.

Purpose of the Study:

  • To model the haplotype assembly problem using hypergraph partitioning.
  • To propose a novel method, HGHap, for accurate haplotype assembly.
  • To address the challenge of complex relationships caused by fragment errors.

Main Methods:

  • Developed HGHap, a two-phase hypergraph-based approach.
  • Phase 1: Constructed a hypergraph with fragments as vertices and hyperedges capturing relationships.
  • Phase 2: Employed hypergraph partitioning to group fragments for haplotype construction.

Main Results:

  • HGHap demonstrates superior performance compared to existing methods.
  • The method shows significant improvements in accuracy, particularly with high error rates.
  • Hyperedges effectively model higher-order fragment relationships, aiding partitioning.

Conclusions:

  • HGHap offers a robust solution for the haplotype assembly problem.
  • Modeling complex fragment relationships via hypergraphs is key to improving accuracy.
  • The proposed method is especially valuable for datasets with substantial error rates.