A framework for space-efficient string kernels
From MaRDI portal
Publication:1679234
DOI10.1007/s00453-017-0286-4zbMath1380.68463arXiv1502.06370OpenAlexW1795489290MaRDI QIDQ1679234
Djamal Belazzougui, Fabio Cunial
Publication date: 9 November 2017
Published in: Algorithmica, Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06370
Burrows-Wheeler transformprobabilistic suffix treematching statisticsmaximal repeatminimal absent wordsubstring complexitysubstring kernelsuffix-link treevariable-length Markov chain
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)
Related Items (7)
A framework for space-efficient string kernels ⋮ Algorithms to compute the Burrows-Wheeler similarity distribution ⋮ Unnamed Item ⋮ Constructing antidictionaries of long texts in output-sensitive space ⋮ Optimal Computation of Overabundant Words ⋮ Fast Compressed Self-Indexes with Deterministic Linear-Time Construction ⋮ Fast matching statistics in small space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata and forbidden words
- Using minimal absent words to build phylogeny
- The power of amnesia: Learning probabilistic automata with variable memory length
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- A framework for space-efficient string kernels
- Variable length Markov chains
- Improved compressed indexes for full-text document retrieval
- Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
- Alphabet-Independent Compressed Text Indexing
- Suffix Arrays: A New Method for On-Line String Searches
- Indexing compressed text
- Maximal Words in Sequence Comparisons Based on Subword Composition
- A universal data compression system
- A universal finite memory source
- Individual Sequence Prediction Using Memory-Efficient Context Trees
- Shortest Unique Substring Query Revisited
- Linear time construction of compressed text indices in compact space
This page was built for publication: A framework for space-efficient string kernels
