String matching under a general matching relation

DOI10.1006/INCO.1995.1144MaRDI QIDQ1900318zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 March 1996

Published in Information and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1006/inco.1995.1144

zbMATH Keywords

standard string matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Generalized String Matching
• Non-standard stringology: algorithms and complexity
• scientific article; zbMATH DE number 3949728
• Efficient comparison based string matching
• scientific article; zbMATH DE number 2119723

Cited in

(18)

• Space lower bounds for online pattern matching
• Modulated string searching
• Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
• Generalized String Matching
• Pattern matching with address errors: rearrangement distances
• String range matching
• Efficient special cases of pattern matching with swaps
• scientific article; zbMATH DE number 1045407 (Why is no real title available?)
• Streaming pattern matching with \(d\) wildcards
• String matching with simple devices
• Overlap matching.
• Two-way string-matching
• Towards optimal packed string matching
• Space Lower Bounds for Online Pattern Matching
• Approximate swapped matching.
• scientific article; zbMATH DE number 4126695 (Why is no real title available?)
• Generalized pattern matching and periodicity under substring consistent equivalence relations
• Ternary square-free partial words with many wildcards

This page was built for publication: String matching under a general matching relation

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