Counting suffix arrays and strings

DOI10.1016/j.tcs.2008.01.011zbMath1142.68026MaRDI QIDQ932319

Jens Stoye, Klaus-Bernd Schürmann

Publication date: 10 July 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/1970472

zbMATH Keywords

permutations; strings; suffix arrays

Mathematics Subject Classification ID

68P05: Data structures

Related Items

Inferring strings from suffix trees and links on a binary alphabet, A quick tour on suffix arrays and compressed suffix arrays, Verifying and enumerating parameterized border arrays, Inferring strings from Lyndon factorization, On the combinatorics of suffix arrays, Counting Parameterized Border Arrays for a Binary Alphabet

Cites Work

• Replacing suffix trees with enhanced suffix arrays
• String processing and information retrieval. 12th international conference, SPIRE 2005, Buenos Aires, Argentina, November 2--4, 2005. Proceedings
• Counting distinct strings
• Lyndon words, permutations and trees.
• A note on the Burrows-Wheeler transformation
• Constructing suffix arrays in linear time
• Space efficient linear time construction of suffix arrays
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Fast Lightweight Suffix Array Construction and Checking
• A linear lower bound on index size for text retrieval
• Words over an ordered alphabet and suffix permutations
• Mathematical Foundations of Computer Science 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item