Internal shortest absent word queries in constant time and linear space (Q2672592): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3171998682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-space data structure for range-LCP queries in poly-logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic and internal longest common substring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing antidictionaries of long texts in output-sensitive space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimal and maximal suffixes of a substring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelet Trees Meet Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Star-Tree Parallel Data Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Common Extensions in Sublinear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs for longest common extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Consistent Parsing for Text Indexing in Small Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using minimal absent words to build phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching on the RAM, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alignment-free sequence comparison using absent words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended special factors of a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal dictionary matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absent words in a sliding window with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Performance of Space Efficient Data Structures for Longest Common Extensions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences and dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word assembly through minimal forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal forbidden factors of circular words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Space Data Structure for Range LCP Queries* / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized substring compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Suffix and Rotation of a Substring in Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal Pattern Matching Queries in a Text and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for the longest common extension problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast string matching with k differences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Unique Substrings and Minimal Absent Words in a Sliding Window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words and forbidden factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear algorithms for approximating string compressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Palindromes in Substrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A substring-substring LCS data structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for substring-substring LCS length queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-space LCE data structure with constant-time queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-local string comparison: algorithmic techniques and applications / rank
 
Normal rank

Latest revision as of 07:45, 29 July 2024

scientific article
Language Label Description Also known as
English
Internal shortest absent word queries in constant time and linear space
scientific article

    Statements

    Internal shortest absent word queries in constant time and linear space (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    0 references
    string algorithms
    0 references
    internal queries
    0 references
    shortest absent word
    0 references
    bit parallelism
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references