Inferring strings from suffix trees and links on a binary alphabet

DOI10.1016/J.DAM.2013.02.033zbMATH Open1329.68314OpenAlexW1971831237MaRDI QIDQ496548FDOQ496548

Authors: Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomohiro I 

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.033

Recommendations

• Reverse engineering of compact suffix trees and links: a novel algorithm
• A suffix tree or not a suffix tree?
• A suffix tree or not a suffix tree?
• scientific article; zbMATH DE number 2052919
• Space efficient suffix trees

zbMATH Keywords

suffix treesenumeration problemreverse engineering problem

Mathematics Subject Classification ID

Data structures (68P05) 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
• Reverse engineering prefix tables
• Verifying a parameterized border array in \(O(n ^{1.5})\) time
• Counting Parameterized Border Arrays for a Binary Alphabet
• Words over an ordered alphabet and suffix permutations
• Border array on bounded alphabet
• Cover array string reconstruction
• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2003
• Counting suffix arrays and strings
• Counting distinct strings
• Validating the Knuth-Morris-Pratt failure function, fast and online
• Efficient validation and construction of border arrays and validation of string matching automata
• Title not available (Why is that?)

Cited In (15)

• Universal reconstruction of a string
• Universal reconstruction of a string
• On the size of the smallest alphabet for Lyndon trees
• Reverse engineering of compact suffix trees and links: a novel algorithm
• String inference from longest-common-prefix array
• When a dollar makes a BWT
• Inferring strings from Lyndon factorization
• On suffix tree detection
• From Suffix Trees to Suffix Vectors
• Recognizing union-find trees is NP-complete
• Inferring strings from position heaps in linear time
• Verifying and enumerating parameterized border arrays
• Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info
• A suffix tree or not a suffix tree?
• On suffix tree detection

This page was built for publication: Inferring strings from suffix trees and links on a binary alphabet

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