Pages that link to "Item:Q5222002"

The following pages link to Complete inverted files for efficient text retrieval and analysis (Q5222002):

Displaying 43 items.

• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
• Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
• Ternary directed acyclic word graphs (Q703500) (← links)
• On suffix extensions in suffix trees (Q714837) (← links)
• The subsequence composition of a string (Q732027) (← links)
• Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← 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)
• Performance evaluation of shared and separate inverted files (Q911252) (← 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)
• Organization of the inverted files in a distributed information retrieval system based on Thesauri (Q1072719) (← 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)
• Universal compressed text indexing (Q1729689) (← 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)
• Block trees (Q2221797) (← links)
• Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
• Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
• GLOUDS: representing tree-like graphs (Q2634715) (← links)
• Sensitivity of string compressors and repetitiveness measures (Q2687989) (← links)
• The parameterized suffix tray (Q2692728) (← links)
• Composite Repetition-Aware Data Structures (Q2942243) (← links)
• Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
• (Q3690265) (← links)
• Forty Years of Text Indexing (Q4928554) (← links)
• (Q5009616) (← links)
• Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
• (Q5088898) (← links)
• (Q5088908) (← links)
• Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
• A general framework for enumerating equivalence classes of solutions (Q6046942) (← links)
• The palindromization map (Q6048431) (← links)
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
• Optimally computing compressed indexing arrays based on the compact directed acyclic word graph (Q6545409) (← links)
• Linear-time computation of generalized minimal absent words for multiple strings (Q6545442) (← links)
• Linear time online algorithms for constructing linear-size suffix trie (Q6614010) (← links)
• Linear-size suffix tries and linear-size CDAWGs simplified and improved (Q6634511) (← links)