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

15.2K
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...
15.2K
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

12.4K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
12.4K

You might also read

Related Articles

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

Sort by
Same author

Kaminari: a frugal colored index for approximate <i>k</i>-mer queries.

Bioinformatics advances·2026
Same author

Acceleration of FM-index Queries Through Prefix-free Parsing.

Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop)·2025
Same author

Logan: Planetary-Scale Genome Assembly Surveys Life's Diversity.

bioRxiv : the preprint server for biology·2025
Same author

K2R: Tinted de Bruijn graphs implementation for efficient read extraction from sequencing datasets.

Bioinformatics advances·2025
Same author

OReO: optimizing read order for practical compression.

Bioinformatics advances·2025
Same author

Kaminari: a resource-frugal index for approximate colored <i>k</i>-mer queries.

bioRxiv : the preprint server for biology·2025
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Dec 28, 2025

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

Finding all maximal perfect haplotype blocks in linear time.

Jarno Alanko1, Hideo Bannai2, Bastien Cazaux1

  • 11Department of Computer Science, University of Helsinki, Helsinki, Finland.

Algorithms for Molecular Biology : AMB
|February 15, 2020
PubMed
Summary
This summary is machine-generated.

Scientists developed new algorithms to rapidly identify natural selection signatures in genomes. These methods improve upon previous approaches, enabling faster and more efficient analysis of large-scale genomic data.

Keywords:
Haplotype blockPopulation genomicsPositional Burrows–Wheeler TransformSelection coefficient

More Related Videos

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.6K
Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing
10:18

Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing

Published on: October 16, 2018

12.6K

Related Experiment Videos

Last Updated: Dec 28, 2025

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.7K
A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.6K
Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing
10:18

Amplification of Near Full-length HIV-1 Proviruses for Next-Generation Sequencing

Published on: October 16, 2018

12.6K

Area of Science:

  • Genomics and Bioinformatics
  • Computational Biology
  • Evolutionary Genetics

Background:

  • Large-scale sequencing projects enable detailed identification of genomic regions under natural selection.
  • Traditional methods for detecting selection signatures from haplotype data are computationally intensive and not scalable for current datasets.
  • Maximal perfect haplotype blocks were proposed as a pattern for rapid genome-wide selection scans.

Purpose of the Study:

  • To address the open problem of whether a linear-time algorithm exists for identifying maximal perfect haplotype blocks.
  • To develop efficient algorithms for genome-wide selection scans applicable to large-scale sequencing data.

Main Methods:

  • Development of two novel algorithms for identifying maximal perfect haplotype blocks.
  • One algorithm utilizes suffix trees for a conceptually simple approach.
  • The second algorithm employs the positional Burrows-Wheeler Transform for practical efficiency.

Main Results:

  • Both developed algorithms achieve the optimal linear-time bound for identifying maximal perfect haplotype blocks.
  • The algorithms provide a significant improvement over the quadratic-time algorithm previously proposed.
  • The positional Burrows-Wheeler Transform-based method demonstrates practical efficiency.

Conclusions:

  • Linear-time algorithms for identifying maximal perfect haplotype blocks have been successfully developed.
  • These new algorithms enable rapid and efficient genome-wide selection scans, overcoming computational limitations of previous methods.
  • The findings facilitate the analysis of natural selection signatures in large-scale genomic datasets.