Reverse-Safe Text Indexing
From MaRDI portal
Publication:5102053
DOI10.1145/3461698zbMath1499.68074OpenAlexW3178506142MaRDI QIDQ5102053
Solon P. Pissis, Grigorios Loukides, Huiping Chen, Giulia Bernardini, Gabriele Fici
Publication date: 6 September 2022
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3461698
Cites Work
- Automata and forbidden words
- On a generalization of abelian equivalence and complexity of infinite words
- Using minimal absent words to build phylogeny
- On cardinalities of \(k\)-abelian equivalence classes
- Construction of Aho Corasick automaton in linear time for integer alphabets
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
- Comparison of phylogenetic trees
- Truncated suffix trees and their application to data compression.
- Words and forbidden factors
- Encoding nearest larger values
- Computing the longest previous factor
- Alignment-free sequence comparison using absent words
- Absent words in a sliding window with applications
- Linking indexing data structures to de Bruijn graphs: construction and update
- Word assembly through minimal forbidden words
- From statistical knowledge bases to degrees of belief
- Access Control for Databases: Concepts and Systems
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
- Powers of tensors and fast matrix multiplication
- Introduction to Information Retrieval
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Efficient string matching
- Algorithms on Strings, Trees and Sequences
- A Supernodal Approach to Sparse Partial Pivoting
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Two Algorithms for Unranking Arborescences
- Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries
- Compressed Multiple Pattern Matching
- String Inference from Longest-Common-Prefix Array
- Reverse-Safe Data Structures for Text Indexing
- Multiplying matrices faster than coppersmith-winograd
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Minimal forbidden factors of circular words
- Words and special factors
- Property Suffix Array with Applications in Indexing Weighted Sequences
- On extended special factors of a word
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reverse-Safe Text Indexing
