Simple Optimal String Matching Algorithm

DOI10.1006/JAGM.2000.1087zbMATH Open0959.68132OpenAlexW2008390274MaRDI QIDQ4500860FDOQ4500860

Cyril Allauzen, Mathieu Raffinot

Publication date: 27 August 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1087

Recommendations

• scientific article; zbMATH DE number 1615293
• scientific article; zbMATH DE number 2247683
• Average-optimal string matching
• scientific article; zbMATH DE number 1303588
• Approximate String Matching: A Simpler Faster Algorithm
• An approximate string-matching algorithm
• Simple and efficient string matching with k mismatches
• An 0(1) time algorithm for string matching

zbMATH Keywords

string matching algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (12)

• A New String Matching Algorithm
• String-matching on ordered alphabets
• Irredundant intervals
• Simple deterministic wildcard matching
• The wide window string matching algorithm
• String matching with simple devices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An artificial neural network based approach for online string matching/filtering of large databases
• THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY
• Title not available (Why is that?)

This page was built for publication: Simple Optimal String Matching Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500860)