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

Linear time-invariant Systems01:23

Linear time-invariant Systems

890
A system is linear if it displays the characteristics of homogeneity and additivity, together termed the superposition property. This principle is fundamental in all linear systems. Linear time-invariant (LTI) systems include systems with linear elements and constant parameters.
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
890
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

359
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
359
Voltammetric Techniques: Linear-Scan (E vs Time)01:12

Voltammetric Techniques: Linear-Scan (E vs Time)

1.1K
Polarography is a classical voltammetric technique used to analyze electrochemical reactions. This method applies a linear potential sweep to a dropping mercury electrode (DME), and the resulting current is measured. A dropping mercury electrode is commonly used as the working electrode in polarography. It consists of a capillary tube filled with mercury, where the tiny droplet forms at the tip. This droplet continuously drops from the capillary, creating a new electrode surface for each...
1.1K
Linear Circuits01:17

Linear Circuits

842
A linear circuit is characterized by its output having a direct proportionality to its input, adhering to the linearity property, which encompasses the principles of homogeneity (scaling) and additivity. Homogeneity dictates that when the input, also referred to as the excitation, is multiplied by a constant factor, the output, known as the response, is correspondingly scaled by the same constant factor. For instance, if the current is multiplied by a constant 'k,' the voltage likewise...
842
Linear Momentum00:55

Linear Momentum

17.6K
The term momentum is used in various ways in everyday language, most of which are consistent with the precise scientific definition. Generally, momentum implies a tendency to continue on course—to move in the same direction; we tend to speak of sports teams or politicians gaining and maintaining the momentum to win.  Momentum is also associated with great mass and speed and is often considered when talking about collisions. For example, when rugby players collide and fall to the...
17.6K
Linearization and Approximation01:26

Linearization and Approximation

51
Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
51

You might also read

Related Articles

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

Sort by
Same author

Nanopore sequencing reveals hidden landscape of short L1 transductions in colorectal cancer.

Communications biology·2026
Same author

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

Bioinformatics advances·2025
Same author

Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs.

Bioinformatics (Oxford, England)·2025
Same author

OReO: optimizing read order for practical compression.

Bioinformatics advances·2025
Same author

Structural features of somatic and germline retrotransposition events in humans.

Mobile DNA·2025
Same author

Conway-Bromage-Lyndon (CBL): an exact, dynamic representation of k-mer sets.

Bioinformatics (Oxford, England)·2024
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: Jan 24, 2026

Segmentation and Linear Measurement for Body Composition Analysis using Slice-O-Matic and Horos
13:35

Segmentation and Linear Measurement for Body Composition Analysis using Slice-O-Matic and Horos

Published on: March 21, 2021

11.7K

Linear time minimum segmentation enables scalable founder reconstruction.

Tuukka Norri1, Bastien Cazaux1, Dmitry Kosolobov2

  • 11Department of Computer Science, University of Helsinki, Pietari Kalmin katu 5, 00014 Helsinki, Finland.

Algorithms for Molecular Biology : AMB
|May 28, 2019
PubMed
Summary
This summary is machine-generated.

This study introduces a faster algorithm for the minimum segmentation problem in pan-genomic analyses. The new method efficiently reconstructs founder sequences from large human chromosome datasets, improving scalability for downstream applications.

Keywords:
Dynamic programmingFounder reconstructionPan-genome indexingPositional Burrows–Wheeler transformRange minimum query

More Related Videos

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection
08:01

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection

Published on: December 15, 2015

7.9K
Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach
08:01

Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach

Published on: August 24, 2018

9.4K

Related Experiment Videos

Last Updated: Jan 24, 2026

Segmentation and Linear Measurement for Body Composition Analysis using Slice-O-Matic and Horos
13:35

Segmentation and Linear Measurement for Body Composition Analysis using Slice-O-Matic and Horos

Published on: March 21, 2021

11.7K
Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection
08:01

Tuning a Parallel Segmented Flow Column and Enabling Multiplexed Detection

Published on: December 15, 2015

7.9K
Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach
08:01

Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach

Published on: August 24, 2018

9.4K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Pan-genomic analyses require efficient representation of large human chromosome datasets.
  • Representing sequence data with fewer founder sequences aids scalability in analyses like read alignment and variant calling.
  • The minimum segmentation problem for founder reconstruction is crucial but computationally challenging.

Purpose of the Study:

  • To develop a more efficient algorithm for the minimum segmentation problem in founder reconstruction.
  • To improve the scalability of pan-genomic data preprocessing.
  • To enable the application of founder sequence reconstruction to larger datasets.

Main Methods:

  • The study focuses on a segmentation formulation of the minimum segmentation problem.
  • An algorithm with O(mn) time complexity was developed, improving upon previous methods.
  • The algorithm partitions sequences into segments of a minimum length L to minimize distinct substrings.

Main Results:

  • A novel O(mn) time algorithm for the minimum segmentation problem was presented.
  • This represents a significant improvement in time complexity over prior algorithms.
  • The algorithm's efficiency allows for processing of thousands of complete human chromosomes.

Conclusions:

  • The developed algorithm enhances the practicality of founder sequence reconstruction for large-scale genomic data.
  • Experimental validation demonstrates the algorithm's effectiveness and efficiency.
  • The implementation is publicly available, facilitating further research and application.