Pages that link to "Item:Q5222002"
From MaRDI portal
The following pages link to Complete inverted files for efficient text retrieval and analysis (Q5222002):
Displayed 15 items.
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- The subsequence composition of a string (Q732027) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- Compact directed acyclic word graphs for a sliding window (Q876704) (← links)
- On Sturmian graphs (Q881581) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time) (Q1115203) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- Approximate string matching using factor automata (Q1583536) (← links)
- On maximal repeats in strings (Q1603378) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- A speed-up for the commute between subword trees and DAWGs. (Q1853059) (← links)