A suffix tree or not a suffix tree?

DOI10.1016/j.jda.2015.01.005zbMath1328.68330arXiv1403.1364OpenAlexW2094777380MaRDI QIDQ2343297

Hjalte Wedel Vildhøj, Tatiana Starikovskaya

Publication date: 4 May 2015

Published in: Lecture Notes in Computer Science, Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1364

zbMATH Keywords

reverse engineeringsuffix treessuffix linkssuffix tour graphs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Data structures (68P05) Algorithms on strings (68W32)

Related Items

Universal Reconstruction of a String, Recognizing union-find trees is NP-complete, Inferring strings from position heaps in linear time, When a dollar makes a BWT, Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info, 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

• Reverse engineering of compact suffix trees and links: a novel algorithm
• Inferring strings from suffix trees and links on a binary alphabet
• Verifying and enumerating parameterized border arrays
• On suffix extensions in suffix trees
• Validating the Knuth-Morris-Pratt failure function, fast and online
• On-line construction of suffix trees
• A suffix tree or not a suffix tree?
• On the combinatorics of suffix arrays
• Verifying a Parameterized Border Array in O(n 1.5) Time
• Cover Array String Reconstruction
• Counting Parameterized Border Arrays for a Binary Alphabet
• Efficient validation and construction of border arrays and validation of string matching automata
• Algorithms on Strings, Trees and Sequences
• Words over an ordered alphabet and suffix permutations
• Forty Years of Text Indexing
• REVERSE ENGINEERING PREFIX TABLES
• Mathematical Foundations of Computer Science 2003
• Unnamed Item
• Unnamed Item