Compressed suffix trees with full functionality
From MaRDI portal
Publication:2464333
DOI10.1007/s00224-006-1198-xzbMath1148.68015OpenAlexW2073921136WikidataQ56594607 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 (64)
Extended suffix array construction using Lyndon factors ⋮ Compressed string dictionary search with edit distance one ⋮ On succinct representations of binary trees ⋮ Arithmetics on Suffix Arrays of Fibonacci Words ⋮ Lightweight LCP construction for very large collections of strings ⋮ An improved algorithm for the all-pairs suffix-prefix problem ⋮ GLOUDS: representing tree-like graphs ⋮ Bidirectional Variable-Order de Bruijn Graphs ⋮ Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs ⋮ Space-Efficient Frameworks for Top- k String Retrieval ⋮ Improved range minimum queries ⋮ The range 1 query (R1Q) problem ⋮ Approximate string matching with compressed indexes ⋮ Compressed directed acyclic word graph with application in local alignment ⋮ Parallel construction of succinct trees ⋮ Space-time trade-offs for finding shortest unique substrings and maximal unique matches ⋮ Kings, Name Days, Lazy Servants and Magic ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Compressed property suffix trees ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ Multi-pattern matching with bidirectional indexes ⋮ Cross-document pattern matching ⋮ Longest Common Prefix with Mismatches ⋮ Efficient index for retrieving top-\(k\) most frequent documents ⋮ 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 ⋮ Encoding 2D range maximum queries ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Finding range minima in the middle: approximations and applications ⋮ Time-Optimal Top-$k$ Document Retrieval ⋮ The longest common substring problem ⋮ Unnamed Item ⋮ Fast relative Lempel-Ziv self-index for similar sequences ⋮ Space-efficient construction of compressed suffix trees ⋮ A linear size index for approximate pattern matching ⋮ An Online Algorithm for Finding the Longest Previous Factors ⋮ Improved approximate string matching using compressed suffix data structures ⋮ Practical compressed suffix trees ⋮ Efficient dynamic range minimum query ⋮ Fast compressed self-indexes with deterministic linear-time construction ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ On space efficient two dimensional range minimum data structures ⋮ Combined data structure for previous- and next-smaller-values ⋮ Dynamic extended suffix arrays ⋮ Wee LCP ⋮ Lempel-Ziv factorization powered by space efficient suffix trees ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays ⋮ The exact multiple pattern matching problem solved by a reference tree approach ⋮ Parallel computation of the Burrows Wheeler transform in compact space ⋮ Locally Compressed Suffix Arrays ⋮ Unnamed Item ⋮ Faster entropy-bounded compressed suffix trees ⋮ Range minimum queries in minimal space ⋮ Sliding suffix tree ⋮ Unnamed Item ⋮ Improved and extended locating functionality on compressed suffix arrays ⋮ Geometric BWT: compressed text indexing via sparse suffixes and range searching ⋮ 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 ⋮ Compressing dictionary matching index via sparsification technique
This page was built for publication: Compressed suffix trees with full functionality
