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

Improving Translational Accuracy02:07

Improving Translational Accuracy

Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
Improving Translational Accuracy02:07

Improving Translational Accuracy

Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

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, the...
Adjusting a Traverse01:12

Adjusting a Traverse

In the site survey of a four-sided traverse, internal angles are essential to ensure geometric accuracy. The survey revealed that the sum of the measured internal angles was 359 degrees and 48 minutes, which is 12 minutes less than the expected 360 degrees. This discrepancy signals an error likely arising from measurement inaccuracies during the fieldwork.To rectify this error, the adjustment process involved distributing the 12-minute shortfall equally across the four internal angles. By...
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...

You might also read

Related Articles

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

Sort by
Same author

DipSkmer: Reference-free population genomics with diploid genome skims.

bioRxiv : the preprint server for biology·2026
Same author

Min-frame transformation enables more sensitive viral genome alignment.

bioRxiv : the preprint server for biology·2026
Same author

TIPP-SD: A new method for species detection in microbiomes.

PLoS computational biology·2026
Same author

Phylogenomics beyond the 'bag-of-genes' model.

Trends in genetics : TIG·2026
Same author

ReSkmer: modeling repeats allows k-mer-based alignment-free methods to calculate population genomic distances.

Genome biology·2026
Same author

Coalescent-based branch length estimation improves dating of species trees.

Systematic biology·2026
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

Related Experiment Video

Updated: May 28, 2026

Large-area Scanning Probe Nanolithography Facilitated by Automated Alignment and Its Application to Substrate Fabrication for Cell Culture Studies
09:45

Large-area Scanning Probe Nanolithography Facilitated by Automated Alignment and Its Application to Substrate Fabrication for Cell Culture Studies

Published on: June 12, 2018

FastSP: linear time calculation of alignment accuracy.

Siavash Mirarab1, Tandy Warnow

  • 1Department of Computer Science, The University of Texas at Austin, Austin, TX 78701, USA.

Bioinformatics (Oxford, England)
|October 11, 2011
PubMed
Summary
This summary is machine-generated.

This study introduces FastSP, a linear-time algorithm for computing multiple sequence alignment comparison scores. FastSP significantly improves efficiency for large datasets, outperforming existing methods in speed and memory usage.

More Related Videos

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons
07:59

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons

Published on: June 9, 2023

Optimization of Performance Parameters of the TAGGG Telomere Length Assay
08:23

Optimization of Performance Parameters of the TAGGG Telomere Length Assay

Published on: April 21, 2023

Related Experiment Videos

Last Updated: May 28, 2026

Large-area Scanning Probe Nanolithography Facilitated by Automated Alignment and Its Application to Substrate Fabrication for Cell Culture Studies
09:45

Large-area Scanning Probe Nanolithography Facilitated by Automated Alignment and Its Application to Substrate Fabrication for Cell Culture Studies

Published on: June 12, 2018

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons
07:59

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons

Published on: June 9, 2023

Optimization of Performance Parameters of the TAGGG Telomere Length Assay
08:23

Optimization of Performance Parameters of the TAGGG Telomere Length Assay

Published on: April 21, 2023

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Multiple sequence alignment is crucial for biological research, including phylogenetics and protein analysis.
  • Comparing different alignments is essential for assessing accuracy and inferring consensus alignments.
  • Existing methods for calculating alignment comparison scores (Developer, Modeler, Total Column, Cline Shift Score) have quadratic time complexity.

Purpose of the Study:

  • To develop a computationally efficient algorithm for calculating multiple sequence alignment comparison scores.
  • To demonstrate that standard alignment comparison scores can be computed in linear time.
  • To present FastSP, a novel linear-time algorithm for these calculations.

Main Methods:

  • Development of the FastSP algorithm.
  • Theoretical analysis of time complexity.
  • Empirical evaluation on large-scale biological datasets.

Main Results:

  • FastSP computes alignment comparison scores in linear time.
  • The algorithm processed alignments with 50,000 sequences in under 2 minutes using 2 GB of memory.
  • FastSP outperformed the qscore method, especially under memory-constrained conditions, which required more time and failed on large datasets.

Conclusions:

  • FastSP offers a significant advancement in the efficiency of comparing multiple sequence alignments.
  • The algorithm provides a scalable and memory-efficient solution for large biological datasets.
  • FastSP is available as open-source software.