scientific article; zbMATH DE number 3982538

MaRDI QIDQ3746902zbMATH OpenFDO

Authors Zvi Galil

Publication date 1985

zbMATH Keywords

surveypattern matchingstring matchingindex constructioncombinatorics of strings

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 826050
• The exact online string matching problem: a review of the most recent results
• 125 problems in text algorithms. With solutions
• Repetitive perhaps, but certainly not boring
• Non-standard stringology: algorithms and complexity

Cited in

(16)

• Efficient detection of quasiperiodicities in strings
• The finite automata approaches in stringology
• Parallel construction of a suffix tree with applications
• On the size of Boyer-Moore automata
• scientific article; zbMATH DE number 5939002 (Why is no real title available?)
• Three one-way heads cannot do string matching
• Fast string matching with k differences
• String theory and the Velo-Zwanziger problem
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Data structures and algorithms for approximate string matching
• Repetitive perhaps, but certainly not boring
• Discovering characteristic expressions in literary works.
• 125 problems in text algorithms. With solutions
• Parsing with a finite dictionary
• String-matching with OBDDs
• On Boyer-Moore automata

This page was built for publication:

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