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

DOI10.1016/J.JDA.2014.07.002zbMATH Open1305.68379OpenAlexW2032064937MaRDI QIDQ405568FDOQ405568

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

Recommendations

• Inferring strings from suffix trees and links on a binary alphabet
• A suffix tree or not a suffix tree?
• A suffix tree or not a suffix tree?
• Suffix trees on words
• Computing suffix links for suffix trees and arrays

zbMATH Keywords

graphpermutationconnectivityrecognitionsuffix treetext indexingcharacterisationEulerian tour

Mathematics Subject Classification ID

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

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• A Space-Economical Suffix Tree Construction Algorithm
• On-line construction of suffix trees
• Inferring strings from suffix trees and links on a binary alphabet

Cited In (11)

• Universal reconstruction of a string
• 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
• String inference from longest-common-prefix array
• When a dollar makes a BWT
• Inferring strings from suffix trees and links on a binary alphabet
• On suffix tree detection
• Inferring strings from position heaps in linear time
• A suffix tree or not a suffix tree?
• On suffix tree detection

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)