A framework for space-efficient string kernels (Q1679234): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Merged Item from Q2942242 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximal Words in Sequence Comparisons Based on Subword Composition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear time construction of compressed text indices in compact space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved compressed indexes for full-text document retrieval / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using minimal absent words to build phylogeny / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automata and forbidden words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest Unique Substring Query Revisited / rank | |||
Normal rank | |||
Revision as of 15:38, 10 July 2024
scientific article; zbMATH DE number 6473964
- A Framework for Space-Efficient String Kernels
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A framework for space-efficient string kernels |
scientific article; zbMATH DE number 6473964 |
|
Statements
A framework for space-efficient string kernels (English)
0 references
A Framework for Space-Efficient String Kernels (English)
0 references
9 November 2017
0 references
20 August 2015
0 references
substring kernel
0 references
substring complexity
0 references
Burrows-Wheeler transform
0 references
maximal repeat
0 references
minimal absent word
0 references
suffix-link tree
0 references
probabilistic suffix tree
0 references
variable-length Markov chain
0 references
matching statistics
0 references
