Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Long-patch Base Excision Repair

Long-patch Base Excision Repair

Since the discovery of the two BER pathways, there has been a debate about how a cell chooses one pathway over the other and the factors determining this selection. Numerous in vitro experiments have pointed out multiple determinants for the sub-pathway selection. These are:

Evolutionary Relationships through Genome Comparisons

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

You might also read

Related Articles

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

Sort by

Same author

A new phased assembly of the Antarctic spiny plunderfish provides novel insights into the evolution of the notothenioid radiation.

bioRxiv : the preprint server for biology·2026

Same author

Cryptic Diversity and Impacts of Domestication in the Black Soldier Fly (Hermetia illucens) Genome.

Genome biology and evolution·2026

Same author

Pangenome-guided sequence assembly via binary optimization.

Briefings in bioinformatics·2026

Same author

The Genomics of Convergent Adaptation to Intertidal Gravel Beaches in Mediterranean Clingfishes.

Genome biology and evolution·2026

Same author

The Earth BioGenome Project Phase II: illuminating the eukaryotic tree of life.

Frontiers in science·2026

Same author

FastGA: fast genome alignment.

Bioinformatics advances·2025

Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026

Same journal

SpaMFG: a Spatial Multi-omics Integration Method based on Feature Grouping.

Bioinformatics (Oxford, England)·2026

Same journal

CSCN: Inference of Cell-Specific Causal Networks Using Single-Cell RNA-Seq Data.

Bioinformatics (Oxford, England)·2026

Same journal

Sparse CCA-Based Mediation Analysis with High-Dimensional Exposures and Mediators.

Bioinformatics (Oxford, England)·2026

Same journal

Enhancing Cross-Context Generalization in Drug Perturbation Prediction with a Multimodal Conditional Diffusion Framework.

Bioinformatics (Oxford, England)·2026

Same journal

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026

See all related articles

Search research articles

Related Experiment Video

Updated: May 4, 2026

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

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

Published on: December 10, 2012

Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT).

Richard Durbin¹

¹Wellcome Trust Sanger Institute, Wellcome Trust Genome Campus, Cambridge CB10 1SA, UK.

Bioinformatics (Oxford, England)

|January 14, 2014

Summary

This summary is machine-generated.

A new positional Burrows-Wheeler transform (PBWT) enables efficient haplotype matching in large genomic datasets. This method significantly speeds up genotype analysis, offering a scalable alternative to current computational approaches.

More Related Videos

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

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

Published on: December 7, 2021

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Published on: June 28, 2018

Related Experiment Videos

Last Updated: May 4, 2026

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

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

Published on: December 10, 2012

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

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

Published on: December 7, 2021

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Published on: June 28, 2018

Area of Science:

Genomics
Bioinformatics
Computational Biology

Background:

Suffix array and Burrows-Wheeler Transform (BWT) methods are efficient for DNA sequence matching.
Current genotype data analysis relies on computationally intensive statistical methods like hidden Markov models for phasing and imputation.
There is a need for scalable algorithms for large-scale genotype data analysis.

Purpose of the Study:

To develop a theory and method for haplotype matching using suffix array concepts.
To create a computationally efficient algorithm for analyzing large genotype datasets.
To explore applications in genotype imputation and phasing.

Main Methods:

Developed a positional Burrows-Wheeler transform (PBWT) algorithm with O(NM) time complexity.
Utilized positional prefix arrays for data representation.
Applied run-length encoding for significant data compression.

Main Results:

The PBWT representation achieves over 100x compression compared to gzip.
Identified all maximal haplotype matches within a dataset in O(NM) time.
Developed a fast algorithm for matching new sequences against the dataset, independent of dataset size with sufficient memory.

Conclusions:

The PBWT offers a computationally efficient and scalable approach for haplotype matching.
This method has the potential to significantly improve genotype imputation and phasing.
The PBWT is well-suited for analyzing large-scale genomic datasets.