Reversing longest previous factor tables is hard

DOI10.1007/978-3-642-22300-6_41MaRDI QIDQ5199267zbMATH OpenOpenAlexFDO

Authors Hongyu Liang, Guang Yang, Jing (Selena) He

Publication date 12 August 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_41

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Recommendations

• Efficient algorithms for three variants of the LPF table
• Computing longest previous non-overlapping factors
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Longest previous non-overlapping factors table computation
• Computing longest previous factor in linear time and applications

Cited in

(6)

• Longest previous non-overlapping factors table computation
• String inference from longest-common-prefix array
• Universal reconstruction of a string
• Inferring strings from Lyndon factorization
• Universal reconstruction of a string
• Verifying and enumerating parameterized border arrays

This page was built for publication: Reversing longest previous factor tables is hard

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