Validating the Knuth-Morris-Pratt failure function, fast and online

DOI10.1007/978-3-642-13182-0_13MaRDI QIDQ3569737zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Artur Jeż, Łukasz Jeż

Publication date 22 June 2010

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0024-558B-8

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Recommendations

• Validating the Knuth-Morris-Pratt failure function, fast and online
• scientific article; zbMATH DE number 17821
• scientific article; zbMATH DE number 1874382
• Fast Searching in Packed Strings
• Fast searching in packed strings

Cited in

(4)

• Inferring strings from suffix trees and links on a binary alphabet
• Reconstructing a string from its Lyndon arrays
• Validating the Knuth-Morris-Pratt failure function, fast and online
• Verifying and enumerating parameterized border arrays

This page was built for publication: Validating the Knuth-Morris-Pratt failure function, fast and online

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