Complete inverted files for efficient text retrieval and analysis
From MaRDI portal
Publication:5222002
Recommendations
Cited in
(51)- Compact directed acyclic word graphs for a sliding window
- Online algorithms for constructing linear-size suffix trie
- Approximate word sequence matching on an inverted file index
- On Sensitivity of Compact Directed Acyclic Word Graphs
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Block trees
- General suffix automaton construction algorithm and space bounds
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- scientific article; zbMATH DE number 1792104 (Why is no real title available?)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
- Ternary directed acyclic word graphs
- On Sturmian graphs
- On suffix extensions in suffix trees
- 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)
- A faster algorithm for matching a set of patterns with variable length don't cares
- Matching a set of strings with variable length don't cares
- Algorithms for indexing highly similar DNA sequences
- The palindromization map
- GLOUDS: representing tree-like graphs
- Reverse-safe data structures for text indexing
- The subsequence composition of a string
- Position heaps: a simple and dynamic text indexing data structure
- Succinct data structures for flexible text retrieval systems
- Approximate string matching using factor automata
- A speed-up for the commute between subword trees and DAWGs.
- scientific article; zbMATH DE number 1979483 (Why is no real title available?)
- Comparing inverted files and signature files for searching a large lexicon
- Fast detection of specific fragments against a set of sequences
- Linear time online algorithms for constructing linear-size suffix trie
- Towards efficient positional inverted index
- Forty Years of Text Indexing
- scientific article; zbMATH DE number 3913732 (Why is no real title available?)
- Composite repetition-aware data structures
- Linear-size suffix tries and linear-size CDAWGs simplified and improved
- scientific article; zbMATH DE number 7378722 (Why is no real title available?)
- On-line construction of compact directed acyclic word graphs
- Optimal rank and select queries on dictionary-compressed text
- Performance evaluation of shared and separate inverted files
- Parallel construction of minimal suffix and factor automata
- Inferring strings from position heaps in linear time
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
- Sensitivity of string compressors and repetitiveness measures
- The parameterized suffix tray
- Universal compressed text indexing
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts
- Organization of the inverted files in a distributed information retrieval system based on Thesauri
- scientific article; zbMATH DE number 7559186 (Why is no real title available?)
- On maximal repeats in strings
- Linear-time computation of generalized minimal absent words for multiple strings
- Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
This page was built for publication: Complete inverted files for efficient text retrieval and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222002)
