Wheeler languages
type: Item
instance of: scholarly article
title: Wheeler languages
author: Jarno Alanko
author: Giovanna D'Agostino
author: Nicola Prezza
author: Alberto Policriti
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2002.10303
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433330
zbMATH Keywords: regular languages
zbMATH Keywords: finite automata
zbMATH Keywords: Burrows-Wheeler transform
zbMATH Keywords: Wheeler languages
zbMATH Keywords: graph indexing
describes a project that uses: BWA
describes a project that uses: vg
describes a project that uses: r-index
MaRDI profile type: Publication
OpenAlex ID: W4205775169
cites work: The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words
cites work: Indexing compressed text
cites work: Q4607985
cites work: Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: An extension of the Burrows-Wheeler transform
cites work: Lightweight algorithms for constructing and inverting the BWT of string collections
cites work: Succinct de Bruijn Graphs
cites work: Indexing Variation Graphs
cites work: Wheeler graphs: a framework for BWT-based data structures
cites work: Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
cites work: Q5091210
cites work: Lengths of words accepted by nondeterministic finite automata
cites work: Regular Languages meet Prefix Sorting
cites work: Q5240597
cites work: Q4057601
cites work: Q3086925
cites work: The equation \(a_ M=b^ Nc^ P\) in a free group
DOI: 10.1016/J.IC.2021.104820
description: scientific article; zbMATH DE number 7433330