Exploiting new properties of string net frequency for efficient computation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1615290 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 871172 (Why is no real title available?)
- A characterization of the squares in a Fibonacci string
- A combinatorial property of the Fibonacci words
- Algorithm Theory - SWAT 2004
- Bi-directional r-indexes
- Colored range queries and document retrieval
- Compressed suffix trees, efficient computation and storage of LCP-values
- Factorizing strings into repetitions
- Fibonacci numbers and words
- Largest repetition factorization of Fibonacci words
- On extensions of maximal repeats in compressed strings
- On maximal repeats in strings
- Optimal-Time Dictionary-Compressed Indexes
- Permuted Longest-Common-Prefix Array
- Replacing suffix trees with enhanced suffix arrays
- Resolution of the Burrows-Wheeler transform conjecture
- Smaller Fully-Functional Bidirectional BWT Indexes
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Sublinear algorithms for approximating string compressibility
- Suffix Arrays: A New Method for On-Line String Searches
- Tighter bounds for the sum of irreducible LCP values
- Toward a Definitive Compressibility Measure for Repetitive Sequences
- Versatile succinct representations of the bidirectional Burrows-Wheeler transform
This page was built for publication: Exploiting new properties of string net frequency for efficient computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891080)
