A new problem in string searching

DOI10.1007/3-540-58325-4_235MaRDI QIDQ4525763zbMATH OpenFDO

Authors George Havas, Jin Xian Lian

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9406206

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Lower bounds of temporal and spatial complexity of the substring search problem
• scientific article; zbMATH DE number 3943041
• A New String Matching Algorithm
• Complexity of substring search in a set of strings
• scientific article; zbMATH DE number 1615293

Cited in

(2)

• Lower bounds of temporal and spatial complexity of the substring search problem
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM

This page was built for publication: A new problem in string searching

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