scientific article
From MaRDI portal
Publication:2768305
zbMath1002.68519MaRDI QIDQ2768305
Paolo Ferragina, Giovanni Manzini
Publication date: 14 January 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies and applications (68U99) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (14)
Bloom Filter Trie – A Data Structure for Pan-Genome Storage ⋮ FM-index of alignment: a compressed index for similar strings ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Replacing suffix trees with enhanced suffix arrays ⋮ Indexing text using the Ziv--Lempel trie ⋮ String Indexing with Compressed Patterns ⋮ Time-space trade-offs for Lempel-Ziv compressed indexing ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ FM-index of alignment with gaps ⋮ A comparison of BWT approaches to string pattern matching ⋮ Algorithms for Indexing Highly Similar DNA Sequences ⋮ Space efficient algorithms for the Burrows-Wheeler backtransformation ⋮ Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays ⋮ Time-space trade-offs for compressed suffix arrays.
This page was built for publication:
