Compressed suffix trees with full functionality
From MaRDI portal
Publication:2464333
DOI10.1007/s00224-006-1198-xzbMath1148.68015WikidataQ56594607 ScholiaQ56594607MaRDI QIDQ2464333
Publication date: 19 December 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-006-1198-x
Related Items
Unnamed Item, Faster Compressed Suffix Trees for Repetitive Collections, Fast Compressed Self-Indexes with Deterministic Linear-Time Construction, Fast matching statistics in small space, Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies, Bidirectional Variable-Order de Bruijn Graphs, Unnamed Item, Unnamed Item, Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets, Algorithms and complexity on indexing founder graphs, Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads, Compressed string dictionary search with edit distance one, Compressed directed acyclic word graph with application in local alignment, Compressed property suffix trees, Multi-pattern matching with bidirectional indexes, Cross-document pattern matching, Ultra-succinct representation of ordered trees with applications, Efficient dynamic range minimum query, Burrows-Wheeler transform and LCP array construction in constant space, Combined data structure for previous- and next-smaller-values, Efficient index for retrieving top-\(k\) most frequent documents, Finding range minima in the middle: approximations and applications, A linear size index for approximate pattern matching, On space efficient two dimensional range minimum data structures, Lempel-Ziv factorization powered by space efficient suffix trees, Encoding 2D range maximum queries, Improved approximate string matching using compressed suffix data structures, Dynamic extended suffix arrays, Wee LCP, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, Faster entropy-bounded compressed suffix trees, Extended suffix array construction using Lyndon factors, The range 1 query (R1Q) problem, Approximate string matching with compressed indexes, Practical compressed suffix trees, Fast compressed self-indexes with deterministic linear-time construction, The exact multiple pattern matching problem solved by a reference tree approach, Range minimum queries in minimal space, Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs, Space-efficient construction of compressed suffix trees, Parallel computation of the Burrows Wheeler transform in compact space, Sliding suffix tree, Improved and extended locating functionality on compressed suffix arrays, Geometric BWT: compressed text indexing via sparse suffixes and range searching, Compressing dictionary matching index via sparsification technique, On succinct representations of binary trees, Improved range minimum queries, Parallel construction of succinct trees, Space-time trade-offs for finding shortest unique substrings and maximal unique matches, Fast relative Lempel-Ziv self-index for similar sequences, Lightweight LCP construction for very large collections of strings, An improved algorithm for the all-pairs suffix-prefix problem, GLOUDS: representing tree-like graphs, Faster repetition-aware compressed suffix trees based on block trees, Fully Functional Static and Dynamic Succinct Trees, Locally Compressed Suffix Arrays, Compact Indexes for Flexible Top-$$k$$ Retrieval, Longest Common Prefix with Mismatches, Time-Optimal Top-$k$ Document Retrieval, The longest common substring problem, Space-Efficient Frameworks for Top- k String Retrieval, Arithmetics on Suffix Arrays of Fibonacci Words, Kings, Name Days, Lazy Servants and Magic, An Online Algorithm for Finding the Longest Previous Factors
