scientific article; zbMATH DE number 2038722
From MaRDI portal
Publication:4449187
zbMath1039.68546MaRDI QIDQ4449187
Venkatesh Raman, S. Srinivasa Rao, J. Ian Munro, Rajeev Raman
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190345.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
GLOUDS: representing tree-like graphs ⋮ Self-indexed Text Compression Using Straight-Line Programs ⋮ A simple optimal representation for balanced parentheses ⋮ On compressing and indexing repetitive sequences ⋮ Succinct encoding of arbitrary graphs ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ Succinct representation of labeled graphs ⋮ Succinct representations of permutations and functions ⋮ Self-indexing Based on LZ77 ⋮ LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Minimal indices for predecessor search ⋮ Improved and extended locating functionality on compressed suffix arrays ⋮ Faster Compressed Suffix Trees for Repetitive Collections
This page was built for publication:
