scientific article; zbMATH DE number 2080264
From MaRDI portal
Publication:4472515
zbMath1044.68587MaRDI QIDQ4472515
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690410.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (11)
Extended suffix array construction using Lyndon factors ⋮ Indexing text using the Ziv--Lempel trie ⋮ Cross-document pattern matching ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Counting suffix arrays and strings ⋮ On-line construction of compact directed acyclic word graphs ⋮ An experimental study of a compressed index ⋮ Locally Compressed Suffix Arrays ⋮ Top tree compression of tries ⋮ Time-space trade-offs for compressed suffix arrays. ⋮ Improved and extended locating functionality on compressed suffix arrays
This page was built for publication:
