On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
type: Item
instance of: scholarly article
title: On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
zbMATH Open document ID: 1260.68142
author: Takashi Saso
author: Kojiro Kobayashi
author: Atsuyoshi Nakamura
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6149232
zbMATH Keywords: Burrows-Wheeler transformation
zbMATH Keywords: block sorting
zbMATH Keywords: suffix arrays
zbMATH Keywords: data compression
zbMATH Keywords: analysis of algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.03.010
OpenAlex ID: W2001155813
cites work: Q5501814
cites work: Fast Lightweight Suffix Array Construction and Checking
cites work: Universal lossless source coding with the Burrows Wheeler transform
cites work: A categorization theorem on suffix arrays with applications to space efficient text indexes
cites work: Q4349924
cites work: Faster suffix sorting
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Engineering a lightweight suffix array construction algorithm
cites work: Linear Time Suffix Array Construction Using D-Critical Substrings
cites work: New text indexing functionalities of the compressed suffix arrays
DOI: 10.1016/J.IPL.2011.03.010
description: scientific article; zbMATH DE number 6149232