An output-sensitive algorithm for the minimization of 2-dimensional string covers

DOI10.1007/978-3-030-14812-6_33MaRDI QIDQ2327504zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 15 October 2019

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

Mathematics Subject Classification ID

Recommendations

• String Covering: A Survey
• scientific article; zbMATH DE number 1003283
• An optimal algorithm to compute all the covers of a string
• A work-time optimal algorithm for computing all string covers
• Enhanced string covering

Cited in

(5)

• String covers of a tree
• Experimental evaluation of algorithms for computing quasiperiods
• Efficient Computation of 2-Covers of a String.
• String Covering: A Survey
• String 2-covers with no length restrictions

This page was built for publication: An output-sensitive algorithm for the minimization of 2-dimensional string covers

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