Reverse-safe text indexing
From MaRDI portal
Recommendations
- Reverse-safe data structures for text indexing
- New text indexing functionalities of the compressed suffix arrays
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
Cites work
- A Supernodal Approach to Sparse Partial Pivoting
- Absent words in a sliding window with applications
- Access control for databases: concepts and systems
- Algorithms on Strings, Trees and Sequences
- Alignment-free sequence comparison using absent words
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
- Asymptotically optimal encodings of range data structures for selection and top-k queries
- Automata and forbidden words
- Comparison of phylogenetic trees
- Compressed Multiple Pattern Matching
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Computing DAWGs and minimal absent words in linear time for integer alphabets
- Computing the longest previous factor
- Construction of Aho Corasick automaton in linear time for integer alphabets
- Efficient string matching
- Encoding nearest larger values
- From statistical knowledge bases to degrees of belief
- scientific article; zbMATH DE number 3478914 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 6403512 (Why is no real title available?)
- scientific article; zbMATH DE number 7651098 (Why is no real title available?)
- Introduction to Information Retrieval
- Linking indexing data structures to de Bruijn graphs: construction and update
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Multiplying matrices faster than coppersmith-winograd
- On a generalization of abelian equivalence and complexity of infinite words
- On cardinalities of \(k\)-abelian equivalence classes
- On extended special factors of a word
- Powers of tensors and fast matrix multiplication
- Property Suffix Array with Applications in Indexing Weighted Sequences
- Reverse-safe data structures for text indexing
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- String inference from longest-common-prefix array
- Table of integrals, series, and products. Translated from the Russian. Translation edited and with a preface by Alan Jeffrey and Daniel Zwillinger. With one CD-ROM (Windows, Macintosh and UNIX)
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Truncated suffix trees and their application to data compression.
- Two Algorithms for Unranking Arborescences
- Using minimal absent words to build phylogeny
- Word assembly through minimal forbidden words
- Words and forbidden factors
- Words and special factors
Cited in
(5)
This page was built for publication: Reverse-safe text indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102053)
