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

Extended Versions of Green’s Theorem01:27

Extended Versions of Green’s Theorem

Green’s Theorem connects the circulation of a vector field around a closed curve with the behavior of the field across the region enclosed by that curve. It provides a way to replace a line integral around a boundary with a double integral over the interior region, making it especially useful in plane geometry, fluid flow, and vector calculus.Although Green’s Theorem is often introduced using simple regions without gaps, it can also be applied to regions made from several simple parts. This...
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...
Application of Linearization and Approximation01:29

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
Accuracy, limits, and approximation01:28

Accuracy, limits, and approximation

Accuracy, limits, and approximations are common in many fields, especially in engineering calculations. These concepts are imperative for ensuring that a given value is as close as possible to its true value.
Accuracy is defined as the closeness of the measured value to the true or actual value. In engineering mechanics, repeated measurements are taken during theoretical or experimental analyses to ensure that the result is precise and accurate.
The accuracy of any solution is based on the...

You might also read

Related Articles

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

Sort by
Same author

Competing Theories on Global and Regional Vaccine Inequities: A Scoping Literature Review Within the Context of the COVID-19 Pandemic.

Vaccines·2025
Same author

Perceptions and Experiences of Primary Care Providers on Their Role in Tobacco Treatment Delivery Based on Their Smoking Status: A Qualitative Study.

Healthcare (Basel, Switzerland)·2025
Same author

Leishmaniasis in Greece: Prospects of transitioning to a One Health surveillance system.

One health (Amsterdam, Netherlands)·2024
Same author

Synthesis cost-optimal targeted mutant protein libraries.

Computational biology and chemistry·2024
Same author

Parental Hesitancy towards the Established Childhood Vaccination Programmes in the COVID-19 Era: Assessing the Drivers of a Challenging Public Health Concern.

Vaccines·2022
Same author

Trichinosis Imitating an Inflammatory Systematic Disease.

The Korean journal of parasitology·2021

Related Experiment Video

Updated: Jun 25, 2026

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

Improved algorithms for approximate string matching (extended abstract).

Dimitris Papamichail1, Georgios Papamichail

  • 1Department of Computer Science, University of Miami, Coral Gables, Miami, USA. dimitris@cs.miami.edu

BMC Bioinformatics
|February 12, 2009
PubMed
Summary
This summary is machine-generated.

We developed a novel algorithm for calculating edit distance between two strings. This output-sensitive approach offers improved theoretical time bounds and practical efficiency, particularly for strings of differing lengths.

More Related Videos

The Application of Open Searching-based Approaches for the Identification of Acinetobacter baumannii O-linked Glycopeptides
08:37

The Application of Open Searching-based Approaches for the Identification of Acinetobacter baumannii O-linked Glycopeptides

Published on: November 2, 2021

Related Experiment Videos

Last Updated: Jun 25, 2026

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

The Application of Open Searching-based Approaches for the Identification of Acinetobacter baumannii O-linked Glycopeptides
08:37

The Application of Open Searching-based Approaches for the Identification of Acinetobacter baumannii O-linked Glycopeptides

Published on: November 2, 2021

Area of Science:

  • Computational biology
  • Text processing
  • Pattern recognition

Background:

  • Approximate string matching is a fundamental problem with broad applications.
  • Existing algorithms address variants like sequence comparison and longest common subsequence calculation.

Purpose of the Study:

  • To design and analyze a new algorithm for solving the edit distance problem.
  • To improve upon existing theoretical time bounds for edit distance calculation.

Main Methods:

  • Developed an output-sensitive algorithm for edit distance computation.
  • Analyzed the algorithm's time complexity and space requirements.

Main Results:

  • The algorithm solves the edit distance problem in O((s - |n - m|).min(m, n, s) + m + n) time and linear space, where s is the edit distance.
  • Achieved a worst-case time bound independent of the longest string length, improving theoretical limits.
  • Demonstrated practical efficiency, especially when comparing strings of significantly different lengths.

Conclusions:

  • A novel algorithm for edit distance calculation has been designed, analyzed, and implemented.
  • The algorithm presents both theoretical advancements and practical utility.
  • Source code is publicly available online.