Compressed subsequence matching and packed tree coloring

DOI10.1007/978-3-319-07566-2_5MaRDI QIDQ6826721zbMATH OpenFDO

Authors Philip Bille, Patrick Hagge Cording, Inge Li Gørtz

Publication date 30 June 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07566-2_5

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

This page was built for publication: Compressed subsequence matching and packed tree coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826721)