Reverse engineering of compact suffix trees and links: a novel algorithm

DOI10.1016/J.JDA.2014.07.002MaRDI QIDQ405568zbMATH OpenOpenAlexFDO

Authors Bastien Cazaux, Eric Rivals

Publication date 5 September 2014

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2014.07.002

zbMATH Keywords

characterisationconnectivityEulerian tourgraphpermutationrecognitionsuffix treetext indexing

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Inferring strings from suffix trees and links on a binary alphabet
• Suffix trees on words
• Computing suffix links for suffix trees and arrays

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• Inferring strings from suffix trees and links on a binary alphabet
• On-line construction of suffix trees

Cited in

(11)

• String inference from longest-common-prefix array
• When a dollar makes a BWT
• Universal reconstruction of a string
• On the size of the smallest alphabet for Lyndon trees
• A linear time algorithm for shortest cyclic cover of strings
• Universal reconstruction of a string
• Inferring strings from suffix trees and links on a binary alphabet
• Inferring strings from position heaps in linear time
• On suffix tree detection
• On suffix tree detection
• Inverting parameterized Burrows-Wheeler transform

This page was built for publication: Reverse engineering of compact suffix trees and links: a novel algorithm

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