On-line string matching with feedback

DOI10.1016/0304-3975(94)00184-7zbMATH Open0873.68210OpenAlexW2007974473MaRDI QIDQ673776FDOQ673776

Authors: Peter Johansen 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00184-7

Recommendations

• scientific article; zbMATH DE number 1045407
• Optimal pattern matching algorithms
• scientific article; zbMATH DE number 3870652
• scientific article; zbMATH DE number 4078846
• scientific article; zbMATH DE number 1740051

zbMATH Keywords

string pattern matcher

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Cites Work

• On the Complexity of Finite Sequences
• A Space-Economical Suffix Tree Construction Algorithm
• Linear Algorithm for Data Compression via String Matching
• Inductive inference of ultimately periodic sequences

Cited In (3)

• On-line approximate string matching with bounded errors
• Efficient on-line repetition detection
• An artificial neural network based approach for online string matching/filtering of large databases

This page was built for publication: On-line string matching with feedback

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