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

DOI10.1016/j.jda.2014.07.002zbMath1305.68379OpenAlexW2032064937MaRDI QIDQ405568

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

graphcharacterisationpermutationconnectivityrecognitionsuffix treetext indexingEulerian tour

Mathematics Subject Classification ID

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

Related Items (8)

Universal Reconstruction of a String ⋮ A linear time algorithm for shortest cyclic cover of strings ⋮ Inferring strings from position heaps in linear time ⋮ When a dollar makes a BWT ⋮ Universal reconstruction of a string ⋮ On the size of the smallest alphabet for Lyndon trees ⋮ A suffix tree or not a suffix tree? ⋮ String inference from longest-common-prefix array

Cites Work

• Inferring strings from suffix trees and links on a binary alphabet
• On-line construction of suffix trees
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Unnamed Item

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