On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation

DOI10.1016/j.ipl.2011.03.010zbMath1260.68142OpenAlexW2001155813MaRDI QIDQ1944955

Kojiro Kobayashi, Atsuyoshi Nakamura, Takashi Saso

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.010

zbMATH Keywords

data compressionanalysis of algorithmsBurrows-Wheeler transformationsuffix arraysblock sorting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Engineering a lightweight suffix array construction algorithm
• Faster suffix sorting
• Suffix Arrays: A New Method for On-Line String Searches
• Fast Lightweight Suffix Array Construction and Checking
• Linear Time Suffix Array Construction Using D-Critical Substrings
• New text indexing functionalities of the compressed suffix arrays
• Universal lossless source coding with the Burrows Wheeler transform
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation