Block graphs in practice (Q2363994)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Block graphs in practice	scientific article

Statements

scholarly article

0 references

Block graphs in practice (English)

0 references

zbMATH Open document ID

0 references

10.1007/s11786-016-0286-9

0 references

0 references

Christopher Hoobin

0 references

Simon J. Puglisi

0 references

Mathematics in Computer Science

0 references

publication date

17 July 2017

0 references

full work available at URL

http://hdl.handle.net/10138/308354

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

The Smallest Grammar Problem

0 references

Faster Approximate Pattern Matching in Compressed Repetitive Texts

0 references

Random Access to High-Order Entropy Compressed Text

0 references

On compressing and indexing repetitive sequences

0 references

Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval

0 references

Application of Lempel-Ziv factorization to the approximation of grammar-based compression.

0 references

Practical Entropy-Compressed Rank/Select Dictionary

0 references

Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets

0 references

Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2363994

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2363994&oldid=36334320"