TreeRePair is a prototype implementation of the Re-pair for Trees algorithm which compresses the tree structure of XML documents. For more information see: Markus Lohrey, Sebastian Maneth, Roy Mennicke: Tree Structure Compression with RePair. DCC 2011:353-362

References in zbMATH (referenced in 12 articles )

Showing results 1 to 12 of 12.
Sorted by year (citations)

  1. Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L.: On the complexity of the smallest grammar problem over fixed alphabets (2021)
  2. Diekert, Volker; Fernau, Henning; Wolf, Petra: Properties of graphs specified by a regular language (2021)
  3. Gascón, Adrià; Lohrey, Markus; Maneth, Sebastian; Reh, Carl Philipp; Sieber, Kurt: Grammar-based compression of unranked trees (2020)
  4. Maneth, Sebastian; Peternek, Fabian: Constant delay traversal of grammar-compressed graphs with bounded rank (2020)
  5. Ganardi, Moses; Hucke, Danny; Lohrey, Markus; Noeth, Eric: Tree compression using string grammars (2018)
  6. Lohrey, Markus; Maneth, Sebastian; Reh, Carl Philipp: Constant-time tree traversal and subtree equality check for grammar-compressed trees (2018)
  7. Ganardi, Moses; Hucke, Danny; Jeż, Artur; Lohrey, Markus; Noeth, Eric: Constructing small tree grammars and small circuits for formulas (2017)
  8. Jeż, Artur; Lohrey, Markus: Approximation of smallest linear tree grammar (2016)
  9. Navarro, Gonzalo; Ordóñez Pereira, Alberto: Faster compressed suffix trees for repetitive collections (2016)
  10. Bille, Philip; Gørtz, Inge Li; Landau, Gad M.; Weimann, Oren: Tree compression with top trees (2015)
  11. Bousquet-Mélou, Mireille; Lohrey, Markus; Maneth, Sebastian; Noeth, Eric: XML compression via directed acyclic graphs (2015)
  12. Lohrey, Markus; Maneth, Sebastian; Schmidt-Schauß, Manfred: Parameter reduction and automata evaluation for grammar-compressed trees (2012)