Wheeler languages
From MaRDI portal
Publication:2051845
DOI10.1016/J.IC.2021.104820OpenAlexW4205775169MaRDI QIDQ2051845FDOQ2051845
Authors: Jarno Alanko, Giovanna D'Agostino, Nicola Prezza, Alberto Policriti 
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.10303
Recommendations
Cites Work
- Title not available (Why is that?)
- Indexing compressed text
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Suffix Arrays: A New Method for On-Line String Searches
- An extension of the Burrows-Wheeler transform
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Title not available (Why is that?)
- First-order definable languages
- Title not available (Why is that?)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Wheeler graphs: a framework for BWT-based data structures
- Title not available (Why is that?)
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Regular Languages meet Prefix Sorting
- Indexing variation graphs
- Succinct de Bruijn graphs
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Lengths of words accepted by nondeterministic finite automata
Cited In (11)
- Title not available (Why is that?)
- On the complexity of recognizing Wheeler graphs
- Circular languages
- Cascade products and Wheeler automata
- Title not available (Why is that?)
- Ordering regular languages and automata: complexity
- Solving string problems on graphs using the labeled direct product
- Optimal Wheeler language recognition
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Title not available (Why is that?)
- A new class of string transformations for compressed text indexing
Uses Software
This page was built for publication: Wheeler languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051845)
