Validating the Knuth-Morris-Pratt Failure Function, Fast and Online

DOI10.1007/978-3-642-13182-0_13zbMATH Open1285.68226OpenAlexW1564163310MaRDI QIDQ3569737FDOQ3569737

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)

Cited In (3)

• Inferring strings from suffix trees and links on a binary alphabet
• Verifying and enumerating parameterized border arrays
• Reconstructing a string from its Lyndon 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)