scientific article; zbMATH DE number 7651096

DOI10.4230/LIPICS.CPM.2020.5MaRDI QIDQ5874430zbMATH OpenFDO

Authors Stav Ben-Nun, Shay Golan, Tomasz Kociumaka, Matan Kraus

Publication date 7 February 2023

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

zbMATH Keywords

local consistencylongest common substringperiodicitytime-space tradeoff

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(11)

• Complexity of substring search in a set of strings
• Longest property-preserved common factor: a new string-processing framework
• Algorithms – ESA 2005
• Near-optimal quantum algorithms for string problems
• Sparse suffix and LCP array: simple, direct, small, and fast
• Internal pattern matching in small space and applications
• Locally consistent parsing for text indexing in small space
• Substring complexity in sublinear space
• Quantum speed-ups for string synchronizing sets, longest common substring, and k-mismatch matching
• Sparse suffix and LCP array: simple, direct, small, and fast
• Covers in optimal space

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 Q5874430)