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

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Parallel Processing01:20

Parallel Processing

The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
Assembly of Cytoskeletal Filaments01:18

Assembly of Cytoskeletal Filaments

Cytoskeletal filaments are polymeric forms of smaller protein subunits. However, individual cytoskeletal filaments may easily disassemble or associate with other similar filaments to form rigid structures. Microfilaments, made of actin monomers, rely on actin-binding proteins to form bundles and create networks of individual actin filaments. Microtubules rely on microtubule-associated proteins (MAPs) to form sturdy cylindrical structures. However, the proteins involved in forming complex...
Instantaneous Center of Zero Velocity01:20

Instantaneous Center of Zero Velocity

General plane motion, often observed in a rolling wheel, refers to a type of movement where the wheel is simultaneously rotating and translating. This complex motion can be understood by breaking it down into individual components.
To analyze this, consider two points on the wheel: point A and point B. The absolute velocity of point B can be expressed as the vector sum of the absolute velocity of point A and the relative velocity of point B with respect to point A. To simplify this analysis,...
Numerical Calculations01:24

Numerical Calculations

In engineering applications, the representation of the numerical value is critical. Presenting or reporting the answer is one of the essential parts of engineering practices. Numerical calculations are performed using handheld calculators or computers since numerically accurate answers are always preferred.
The solution to a problem is obtained using different methods. While manually solving algebraic symbols is one of the most common methods, the graphical method is often preferred. Computers...
Singularity Functions for Shear01:26

Singularity Functions for Shear

In structural analysis, singularity functions are crucial in simplifying the representation of shear forces in beams under discontinuous loading. These functions describe discontinuous variations in shear force across a beam with varying loads by using a single mathematical expression, regardless of the complexity of the loading conditions. The singularity functions are derived from creating a free-body diagram of the beam and then making conceptual cuts at specific points to examine the shear...

You might also read

Related Articles

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

Sort by
Same author

Integration of palladium-catalyzed C-N coupling into self-encoded libraries for accelerated hit discovery.

RSC chemical biology·2026
Same author

Semantic alignment of the German Human Genome-Phenome Archive metadata model in Europe's genomics field.

Scientific data·2026
Same author

Enhancing Chimeric Fragmentation Spectra Deconvolution Using Direct Infusion-Tandem Mass Spectrometry Across High-Resolution Mass Spectrometric Platforms.

Rapid communications in mass spectrometry : RCM·2025
Same author

Barcode-free hit discovery from massive libraries enabled by automated small molecule structure annotation.

Nature communications·2025
Same author

Closing the Complexity Gap of the Double Distance Problem.

IEEE transactions on computational biology and bioinformatics·2025
Same author

Enhancing tandem mass spectrometry-based metabolite annotation with online chemical labeling.

Nature communications·2025
Same journal

Covariance decomposition for distance based species tree estimation.

BMC bioinformatics·2026
Same journal

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026
Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jun 2, 2026

A Femtoliter Droplet Array for Massively Parallel Protein Synthesis from Single DNA Molecules
10:45

A Femtoliter Droplet Array for Massively Parallel Protein Synthesis from Single DNA Molecules

Published on: June 20, 2020

Swiftly computing center strings.

Franziska Hufsky1, Léon Kuchenbecker, Katharina Jahn

  • 1Lehrstuhl für Bioinformatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, Jena, Germany. franziska.hufsky@uni-jena.de.

BMC Bioinformatics
|April 21, 2011
PubMed
Summary
This summary is machine-generated.

This study introduces efficient exact methods for the center string problem in computational biology. Data reduction techniques significantly speed up computations by identifying unsolvable instances or simplifying conditions for the center string.

More Related Videos

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

Related Experiment Videos

Last Updated: Jun 2, 2026

A Femtoliter Droplet Array for Massively Parallel Protein Synthesis from Single DNA Molecules
10:45

A Femtoliter Droplet Array for Massively Parallel Protein Synthesis from Single DNA Molecules

Published on: June 20, 2020

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

Area of Science:

  • Computer Science
  • Computational Biology
  • Bioinformatics

Background:

  • The center string problem seeks a string within a specified Hamming distance to multiple input strings.
  • This NP-complete problem has significant applications in computational biology.

Purpose of the Study:

  • To develop and evaluate swift, exact methods for the center string problem.
  • To improve the efficiency of existing algorithms using data reduction techniques.

Main Methods:

  • Introduction of data reduction techniques to prune search space and identify constraints.
  • Enhancement of two existing search tree algorithms with data reduction.
  • Development of a novel iterative search strategy incorporating reduction techniques.

Main Results:

  • Data reduction effectively identifies unsolvable instances or trivial solutions.
  • The running time is dominated by subroutine calls near the optimal distance.
  • Evaluation on biological datasets demonstrates considerable speedup in computations.

Conclusions:

  • Data reduction techniques are highly effective for the center string problem.
  • These methods significantly accelerate the computation of optimal center strings.
  • The developed strategies offer practical improvements for biological applications.