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

Introduction to Scalers01:21

Introduction to Scalers

Many familiar physical quantities can be specified completely by giving a single number and the appropriate unit. For example, "a class period lasts 50 min," or "the gas tank in my car holds 65 L," or "the distance between the two posts is 100 m." A physical quantity that can be specified completely in this manner is called a scalar quantity. The word "scalar" is a synonym for "number." Time, mass, distance, length, volume, temperature, and energy are some examples of scalar quantities.
Scalar...
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
Trial and Error and Algorithm01:12

Trial and Error and Algorithm

A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light bulb,...
Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

You might also read

Related Articles

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

Sort by
Same author

Historically Small Population Size Limits Purging of Deleterious Mutations in a Conservation-Reliant Species, the Kirtland's Warbler.

bioRxiv : the preprint server for biology·2026
Same author

A Rarefaction Approach to Identify Local Introgression in a Three Population Tree.

bioRxiv : the preprint server for biology·2026
Same author

Haplotype-Based Models Improve Sweep Detection in Ancient Populations with Complex Demography.

bioRxiv : the preprint server for biology·2026
Same author

EGGS: Empirical Genotype Generalizer for Samples.

Bioinformatics advances·2026
Same author

The Influence of Demographic History and Genetic Architecture on Complex Traits via Runs of Homozygosity.

bioRxiv : the preprint server for biology·2025
Same author

Selection scans and downstream analysis with selscan.

bioRxiv : the preprint server for biology·2025
Same journal

Layered social competition coordinates reproductive hierarchy formation in ants.

bioRxiv : the preprint server for biology·2026
Same journal

Combination epigenetic-targeted therapy increases the immunogenicity of poorly immunogenic sarcomas.

bioRxiv : the preprint server for biology·2026
Same journal

Loss of LanC-like proteins delays post-injury regeneration of aging skeletal muscles.

bioRxiv : the preprint server for biology·2026
Same journal

Integrative Transfer Network: Deep Transfer Learning Across Populations and Prediction Targets.

bioRxiv : the preprint server for biology·2026
Same journal

Confidence-supported label-free metabolic imaging with FPhaS phase autofluorescence microscopy.

bioRxiv : the preprint server for biology·2026
Same journal

Sequence-encoded autoinhibition couples mRNA decapping activity to phase separation.

bioRxiv : the preprint server for biology·2026
See all related articles

Related Experiment Video

Updated: Jun 28, 2026

Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries
12:55

Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries

Published on: January 17, 2015

19.1K

Fast and Memory-Efficient Dynamic Programming Approach for Large-Scale EHH-Based Selection Scans.

Amatur Rahman1, T Quinn Smith1, Zachary A Szpiech1

  • 1Department of Biology, The Pennsylvania State University, University Park, PA 16802, USA.

Biorxiv : the Preprint Server for Biology
|November 24, 2025
PubMed
Summary
This summary is machine-generated.

We developed a dynamic programming algorithm to speed up extended haplotype homozygosity (EHH) calculations for detecting positive selection in large genomic datasets. This method significantly reduces computation time and memory usage, making population genetics analysis more efficient.

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.7K
Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow
08:58

Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow

Published on: October 17, 2025

569

Related Experiment Videos

Last Updated: Jun 28, 2026

Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries
12:55

Scalable High Throughput Selection From Phage-displayed Synthetic Antibody Libraries

Published on: January 17, 2015

19.1K
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
Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow
08:58

Efficient Sampling of Genetically Encoded Biosensor Design Space Enabled with a Design of Experiments and Automation Workflow

Published on: October 17, 2025

569

Area of Science:

  • Population Genetics
  • Genomic Analysis
  • Computational Biology

Background:

  • Haplotype-based statistics are crucial for identifying genomic regions under positive selection.
  • Extended haplotype homozygosity (EHH) is a key statistic, but its computation is computationally intensive.
  • Existing tools struggle to scale with large population datasets like the UK Biobank.

Purpose of the Study:

  • To develop a computationally efficient algorithm for calculating EHH.
  • To improve the scalability of haplotype-based selection scans for large genomic datasets.
  • To optimize runtime and memory usage for analyzing large-scale population data.

Main Methods:

  • A novel dynamic programming algorithm for EHH computation.
  • Implementation and testing on both real phased and simulated genomic data.
  • Evaluation of performance on phased and unphased genotypes with multi-parameter support.

Main Results:

  • Achieved 5-50x speedup and minimal memory footprint on real phased data.
  • Demonstrated up to 15x speedup and 46x memory reduction on large simulated populations.
  • EHH statistics for unphased genotypes ran an order of magnitude faster, with 20x runtime improvement for multi-parameter support.

Conclusions:

  • The proposed dynamic programming algorithm significantly enhances the efficiency of EHH computation.
  • This advancement enables scalable analysis of large population genomic datasets for positive selection detection.
  • The optimized tool (selscan v2.1) provides substantial performance gains for population genetics research.