scientific article; zbMATH DE number 3982538

zbMATH Open0607.68054MaRDI QIDQ3746902FDOQ3746902

Zvi Galil

Publication date: 1985

Title of this publication is not available (Why is that?)

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

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)

Cited In (15)

• Efficient detection of quasiperiodicities in strings
• Three one-way heads cannot do string matching
• Fast string matching with k differences
• String theory and the Velo-Zwanziger problem
• On the size of Boyer-Moore automata
• String-matching with OBDDs
• Repetitive perhaps, but certainly not boring
• Data structures and algorithms for approximate string matching
• Parsing with a finite dictionary
• Parallel construction of a suffix tree with applications
• Discovering characteristic expressions in literary works.
• On Boyer-Moore automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays

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)