scientific article; zbMATH DE number 3982538

MaRDI QIDQ3746902zbMATH OpenFDO

Authors Zvi Galil

Publication date 1985

zbMATH Keywords

combinatorics of stringsindex constructionpattern matchingstring matchingsurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) 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

(17)

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