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-wide Association Studies-GWAS01:11

Genome-wide Association Studies-GWAS

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...
Hardy-Weinberg Principle01:49

Hardy-Weinberg Principle

Diploid organisms have two alleles of each gene, one from each parent, in their somatic cells. Therefore, each individual contributes two alleles to the gene pool of the population. The gene pool of a population is the sum of every allele of all genes within that population and has some degree of variation. Genetic variation is typically expressed as a relative frequency, which is the percentage of the total population that has a given allele, genotype or phenotype.In the early 20th century,...
Single Nucleotide Polymorphisms-SNPs01:05

Single Nucleotide Polymorphisms-SNPs

A single nucleotide polymorphism or SNP is a single nucleotide variation at a specific genomic position in a large population. It is the most prevalent type of sequence variation found in the human genome. Point mutations that occur in more than 1% of the population qualify as SNPs. These are present once every 1000 nucleotides on an average in the human genome. Replacement of a purine with another purine (A/G) or a pyrimidine with another pyrimidine (C/T) is known as a transition. In contrast,...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.The length of the branches can depict time or the relative amount of change among organisms. For instance, the branch length might indicate the number of amino acid changes in the sequence that underlies the...
DNA Isolation01:24

DNA Isolation

DNA isolation protocols can be fast and straightforward or complex and time-consuming depending on the type and quality of DNA required for further processing. For example, plasmid DNA extraction is a bit more complicated than genomic DNA extraction because of the need for an appropriate lysis method to separate plasmid DNA from gDNA during isolation. However, for specific applications, such as long-range DNA sequencing that require a good yield of high- quality DNA samples, we need to follow...

You might also read

Related Articles

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

Sort by
Same author

Safe Fairness Guarantees Without Demographics in Classification: Spectral Uncertainty Set Perspective.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Multimodal fusion strategies for survival prediction in breast cancer: A comparative deep learning study.

Computational and structural biotechnology journal·2025
Same author

P-NP Instance Decomposition Based on the Fourier Transform for Solving the Linear Ordering Problem.

Evolutionary computation·2025
Same author

A probabilistic generative model to discover the treatments of coexisting diseases with missing data.

Computer methods and programs in biomedicine·2023
Same author

Learning the progression patterns of treatments using a probabilistic generative model.

Journal of biomedical informatics·2022
Same author

Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier Space.

Evolutionary computation·2022
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: Jun 6, 2026

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

A preprocessing procedure for haplotype inference by pure parsimony.

Ekhine Irurozki1, Borja Calvo, Jose A Lozano

  • 1Department of Computer Science and Artificial Intelligence, University of the Basque Country, Manuel de Lardizabal, 1 - 20018 Donostia, Gipuzkoa, Spain. ekhine.irurozqui@ehu.es

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|December 1, 2010
PubMed
Summary
This summary is machine-generated.

This study introduces a new preprocessing method for haplotype inference by pure parsimony (HIPP), significantly reducing computational time and memory. This advance enables efficient solving of complex disease genetic problems previously considered intractable.

More Related Videos

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

Related Experiment Videos

Last Updated: Jun 6, 2026

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

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

Area of Science:

  • Genetics and Bioinformatics
  • Computational Biology
  • Complex Disease Research

Background:

  • Haplotype data is crucial for understanding complex diseases, offering more information than genotype data.
  • Acquiring haplotype data is technically challenging and expensive.
  • Computational methods, like haplotype inference by pure parsimony (HIPP), are effective for inferring haplotypes from genotypes but HIPP is NP-hard.

Purpose of the Study:

  • To develop a novel preprocessing algorithm for the haplotype inference by pure parsimony (HIPP) problem.
  • To improve the efficiency and feasibility of haplotype data inference.
  • To enable the solving of previously computationally intractable HIPP instances.

Main Methods:

  • Designed a new preprocessing procedure that operates on groups of haplotypes.
  • Implemented an iterative search and deletion strategy to identify optimal solutions.
  • Integrated the preprocessing algorithm with existing state-of-the-art HIPP solvers (RTIP and GAHAP).

Main Results:

  • The proposed preprocessing algorithm significantly reduces computational time and memory requirements.
  • Previously unaffordable HIPP problem instances can now be solved efficiently.
  • Demonstrated effectiveness using simulated and real HapMap genotype data.

Conclusions:

  • The new preprocessing method enhances the efficiency of haplotype inference by pure parsimony.
  • This approach makes complex genetic analyses more accessible and computationally feasible.
  • Facilitates deeper insights into the genetic underpinnings of complex diseases.