On-line string matching with feedback

DOI10.1016/0304-3975(94)00184-7MaRDI QIDQ673776zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

string pattern matcher

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

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

Cites work

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

Cited in

(3)

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

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)