scientific article; zbMATH DE number 2119665
From MaRDI portal
Publication:4828936
zbMath1093.68578MaRDI QIDQ4828936
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item ⋮ Computing suffix links for suffix trees and arrays ⋮ The heaviest induced ancestors problem: better data structures and applications ⋮ A simple optimal representation for balanced parentheses ⋮ Replacing suffix trees with enhanced suffix arrays ⋮ Indexing text using the Ziv--Lempel trie ⋮ Parallel construction of succinct trees ⋮ Longest Common Prefix with Mismatches ⋮ Variations of the parameterized longest previous factor ⋮ Efficient index for retrieving top-\(k\) most frequent documents ⋮ Space-efficient algorithms for computing minimal/shortest unique substrings ⋮ Succinct data structures for flexible text retrieval systems ⋮ Space-efficient construction of compressed suffix trees ⋮ An Online Algorithm for Finding the Longest Previous Factors ⋮ Better External Memory LCP Array Construction ⋮ Practical compressed suffix trees ⋮ Rank and select revisited and extended ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Opportunistic data structures for range queries ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Compressed indexes for approximate string matching ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Permuted Longest-Common-Prefix Array ⋮ Array Range Queries ⋮ Constructing suffix arrays in linear time ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies ⋮ The Heaviest Induced Ancestors Problem Revisited
