Complete inverted files for efficient text retrieval and analysis

DOI10.1145/28869.28873zbMATH Open1433.68118DBLPjournals/jacm/BlumerBHME87OpenAlexW2030839740WikidataQ90311855 ScholiaQ90311855MaRDI QIDQ5222002FDOQ5222002

Anselm Blumer, R. M. McConnell, Janet A. Blumer, David Haussler, Andrzej Ehrenfeucht

Publication date: 5 April 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/28869.28873

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Formal languages and automata (68Q45) Data structures (68P05)

Cited In (47)

• Compact directed acyclic word graphs for a sliding window
• Online algorithms for constructing linear-size suffix trie
• A general framework for enumerating equivalence classes of solutions
• On Sensitivity of Compact Directed Acyclic Word Graphs
• Efficient dynamic dictionary matching with DAWGs and AC-automata
• Novel results on the number of runs of the Burrows-Wheeler-transform
• Title not available (Why is that?)
• Block trees
• Title not available (Why is that?)
• General suffix automaton construction algorithm and space bounds
• 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
• The palindromization map
• GLOUDS: representing tree-like graphs
• The subsequence composition of a string
• Position heaps: a simple and dynamic text indexing data structure
• Approximate string matching using factor automata
• Succinct data structures for flexible text retrieval systems
• A speed-up for the commute between subword trees and DAWGs.
• Fast detection of specific fragments against a set of sequences
• Linear time online algorithms for constructing linear-size suffix trie
• Forty Years of Text Indexing
• Title not available (Why is that?)
• Linear-size suffix tries and linear-size CDAWGs simplified and improved
• Title not available (Why is that?)
• Algorithms for Indexing Highly Similar DNA Sequences
• On-line construction of compact directed acyclic word graphs
• Optimal rank and select queries on dictionary-compressed text
• Inferring strings from position heaps in linear time
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Performance evaluation of shared and separate inverted files
• Parallel construction of minimal suffix and factor automata
• Sensitivity of string compressors and repetitiveness measures
• Composite Repetition-Aware Data Structures
• 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
• Title not available (Why is that?)
• Linear-time computation of generalized minimal absent words for multiple strings
• Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
• On maximal repeats in strings

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)