Computing Covers Under Substring Consistent Equivalence Relations

DOI10.1007/978-3-030-59212-7_10MaRDI QIDQ6485931zbMATH OpenFDO

Authors Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara

Publication date 22 December 2022

Published in 1511.68351 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59212-7_10

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Generalized pattern matching and periodicity under substring consistent equivalence relations
• Computing the cover array in linear time
• Shortest covers of all cyclic shifts of a string
• Computing covers using prefix tables
• scientific article; zbMATH DE number 1003283

Cited in

(8)

• Computing covers using prefix tables
• Similarity relations and cover automata
• Solving Not-Substring Constraint withFlat Abstraction
• Computing maximal palindromes in non-standard matching models
• Computing maximal palindromes in non-standard matching models
• The ceBWT index: an index for circular Cartesian tree matching on multiple texts
• Approximate Cartesian tree matching with one difference
• Extending the Burrows-Wheeler transform for Cartesian tree matching and constructing it

This page was built for publication: Computing Covers Under Substring Consistent Equivalence Relations

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