Complete inverted files for efficient text retrieval and analysis
From MaRDI portal
Recommendations
Cited in
(58)- Organization of the inverted files in a distributed information retrieval system based on Thesauri
- 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)
- Matching a set of strings with variable length don't cares
- Approximate string matching using factor automata
- On maximal repeats in strings
- Towards efficient positional inverted index
- Universal compressed text indexing
- On-line construction of compact directed acyclic word graphs
- A speed-up for the commute between subword trees and DAWGs.
- Block trees
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Comparing inverted files and signature files for searching a large lexicon
- GLOUDS: representing tree-like graphs
- Sensitivity of string compressors and repetitiveness measures
- The parameterized suffix tray
- Composite repetition-aware data structures
- Approximate word sequence matching on an inverted file index
- Algorithms for indexing highly similar DNA sequences
- scientific article; zbMATH DE number 3913732 (Why is no real title available?)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
- scientific article; zbMATH DE number 1979483 (Why is no real title available?)
- scientific article; zbMATH DE number 1792104 (Why is no real title available?)
- Forty Years of Text Indexing
- String attractors: verification and optimization
- Optimal rank and select queries on dictionary-compressed text
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- On maximal repeats in compressed strings
- Online algorithms for constructing linear-size suffix trie
- Reverse-safe data structures for text indexing
- Position heaps: a simple and dynamic text indexing data structure
- The palindromization map
- Fast detection of specific fragments against a set of sequences
- Inferring strings from position heaps in linear time
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
- On Sensitivity of Compact Directed Acyclic Word Graphs
- Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
- Linear-time computation of generalized minimal absent words for multiple strings
- Linear time online algorithms for constructing linear-size suffix trie
- Linear-size suffix tries and linear-size CDAWGs simplified and improved
- Computing NP-hard repetitiveness measures via MAX-SAT
- Computing minimal absent words and extended bispecial factors with CDAWG space
- Tight bounds for the sensitivity of CDAWGs with left-end edits
- Ternary directed acyclic word graphs
- On suffix extensions in suffix trees
- Faster and simpler online computation of string net frequency
- Edit and alphabet-ordering sensitivity of lex-parse
- On the conjugates of Christoffel words
- Space-efficient online computation of string net occurrences
- The subsequence composition of a string
- Novel results on the number of runs of the Burrows-Wheeler-transform
- General suffix automaton construction algorithm and space bounds
- Compact directed acyclic word graphs for a sliding window
- On Sturmian graphs
- Performance evaluation of shared and separate inverted files
- Parallel construction of minimal suffix and factor automata
- Succinct data structures for flexible text retrieval systems
- A faster algorithm for matching a set of patterns with variable length don't cares
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)
