Tree-Shape Grammars for Random Access

10/16/2019 ∙ by Travis Gagie, et al. ∙ 0

Shape grammars are well known in the graphics and design communities but are not such a common tool for researchers working in bioinformatics, data compression, data structures or formal languages. We are now investigating how to use shape grammars for the parse trees of straight-line programs (SLPs) to reduce the space needed to support random access to the strings those SLPs encode. Currently the smallest data structure supporting random access to a string S using an SLP G takes 2 |G| + |G| |G| + o (|G|) bits for the SLP and |G| (|S| / |G|) + O (|G|) bits so we can compute the lengths of the expansions of non-terminals.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References

  • [1] Aristid Lindenmayer. Mathematical models for cellular interactions in development I. Filaments with one-sided inputs. Journal of Theoretical Biology, 18(3):280–299, 1968.
  • [2] Shirou Maruyama, Yasuo Tabei, Hiroshi Sakamoto, and Kunihiko Sadakane. Fully-online grammar compression. In International Symposium on String Processing and Information Retrieval, pages 218–229. Springer, 2013.
  • [3] George Stiny and James Gips. Shape grammars and the generative specification of painting and sculpture. In IFIP Congress (2), volume 2, 1971.