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 Experiment Videos

Approximate matching of regular expressions.

E W Myers, W Miller

    Bulletin of Mathematical Biology
    |January 1, 1989
    PubMed
    Summary
    This summary is machine-generated.

    This study presents an efficient O(MN) time algorithm for approximate regular expression matching, significantly improving upon existing methods. The new algorithm handles real-valued costs and offers practical speedups for sequence alignment in bioinformatics.

    Related Concept Videos

    You might also read

    Related Articles

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

    Sort by
    Same author

    Achievement of Target Gain Larger than Unity in an Inertial Fusion Experiment.

    Physical review letters·2024
    Same author

    Lawson Criterion for Ignition Exceeded in an Inertial Fusion Experiment.

    Physical review letters·2022
    Same author

    Letter from New York-Yellow Fever Prevented by Innoculation.

    The Southern medical record·2022
    Same author

    Scintillation light detection in the 6-m drift-length ProtoDUNE Dual Phase liquid argon TPC.

    The European physical journal. C, Particles and fields·2022
    Same author

    Prospects for beyond the Standard Model physics searches at the Deep Underground Neutrino Experiment: DUNE Collaboration.

    The European physical journal. C, Particles and fields·2021
    Same author

    STAGdb: a 30K SNP genotyping array and Science Gateway for Acropora corals and their dinoflagellate symbionts.

    Scientific reports·2020
    Same journal

    Mathematical Modeling Shows that Overall Infection Burden is Reduced More by Vaccines that Decrease Spread or Accelerate Recovery than those that Lower Severe Infections or Death.

    Bulletin of mathematical biology·2026
    Same journal

    Effects of Seasonal Births and Predation on Disease Spread.

    Bulletin of mathematical biology·2026
    Same journal

    Identifiability, Sensitivity, and Genetic Algorithms in Bacterial Biofilm Selection Models.

    Bulletin of mathematical biology·2026
    Same journal

    Slow Evolution Towards Generalism in a Model of Variable Dietary Range.

    Bulletin of mathematical biology·2026
    Same journal

    CBINN: Cancer Biology-Informed Neural Network for Unknown Parameter Estimation and Missing Physics Identification.

    Bulletin of mathematical biology·2026
    Same journal

    A Cost-Sensitive Behavioral Modeling Analysis of the Early Identification and Control of Infectious Diseases.

    Bulletin of mathematical biology·2026
    See all related articles

    Area of Science:

    • Computational Biology
    • Bioinformatics
    • Algorithm Design

    Background:

    • Approximate regular expression matching is crucial for sequence analysis.
    • Existing algorithms have limitations in efficiency and flexibility.

    Purpose of the Study:

    • To develop a more efficient and versatile algorithm for approximate regular expression matching.
    • To improve upon the performance and capabilities of existing methods.

    Main Methods:

    • Developed an O(MN) time algorithm for approximate regular expression matching.
    • Extended the method to handle real-valued costs and gap penalties.
    • Incorporated techniques for substring searching and optimal alignment retrieval.

    Main Results:

    Related Experiment Videos

    • Achieved O(MN) time complexity, matching the efficiency of fixed sequence alignment.
    • Demonstrated practical speedups and enhanced flexibility with real-valued costs.
    • Provided methods for substring alignment retrieval with reduced space complexity.

    Conclusions:

    • The new algorithm offers a significant advancement in approximate regular expression matching.
    • It provides a practical and efficient solution for bioinformatics and database search applications.
    • Further refinements address complex gap penalty schemes and optimal alignment reconstruction.