Words over an ordered alphabet and suffix permutations
From MaRDI portal
Publication:4800257
DOI10.1051/ita:2002012zbMath1013.68153OpenAlexW2084996778MaRDI QIDQ4800257
Arnaud Lefebvre, Jean-Pierre Duval
Publication date: 26 June 2003
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2002__36_3_249_0
Related Items (17)
Lyndon + Christoffel = digitally convex ⋮ Inferring strings from Lyndon factorization ⋮ Recognizing union-find trees is NP-complete ⋮ Suffix array and Lyndon factorization of a text ⋮ Inferring strings from position heaps in linear time ⋮ Indeterminate string inference algorithms ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Reconstructing parameterized strings from parameterized suffix and LCP arrays ⋮ Verifying and enumerating parameterized border arrays ⋮ Counting suffix arrays and strings ⋮ Inferring strings from suffix trees and links on a binary alphabet ⋮ Two Combinatorial Criteria for BWT Images ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ A note on the Burrows-Wheeler transformation ⋮ Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A suffix tree or not a suffix tree?
Cites Work
This page was built for publication: Words over an ordered alphabet and suffix permutations
