„Grammar based compression“

Suchergebnisse

1.000+ Treffer

• Fast equality test for straight-line compressed strings
  Schmidt-Schauß, Manfred ; Schnitger, Georg 2011 Univ.-Bibliothek Frankfurt am Main
• Combinatorial Pattern Matching – 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings
  Fischer, Johannes ; Sanders, Peter 2013 Springer Berlin Heidelberg
• Analysis of grammar-based tree compression
  Nöth, Eric 2016 Universitätsbibliothek der Universität Siegen
• Human Readable Compression of GFA Paths Using Grammar-Based Code
  Heringer, Peter ; Dörr, Daniel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Recursive Parsing and Grammar Compression in the Era of Pangenomics (Invited Talk)
  Boucher, Christina 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access
  Cleary, Alan M. ; Winjum, Joseph ; Dood, Jordan ; Shibata, Hiroki ; Inenaga, Shunsuke 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAs
  Zhao, Yang ; Hayashida, Morihiro ; Cao, Yue ; Hwang, Jaewook ; Akutsu, Tatsuya
• Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures
  Zhao, Yang ; Hayashida, Morihiro ; Akutsu, Tatsuya
• On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
  Casel, Katrin ; Fernau, Henning ; Gaspers, Serge ; Gras, Benjamin ; Schmid, Markus 2022 Humboldt-Universität zu Berlin
• On the Complexity of Grammar-Based Compression over Fixed Alphabets
  Casel, Katrin ; Fernau, Henning ; Gaspers, Serge ; Gras, Benjamin ; Schmid, Markus L. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Space-Saving Approximation Algorithm for Grammar-Based Compression
  Sakamoto, Hiroshi
• {RePair} Grammars Are the Smallest Grammars for Fibonacci Words
  Mieno, Takuya ; Inenaga, Shunsuke ; Horiyama, Takashi 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Compression by Contracting Straight-Line Programs
  Ganardi, Moses 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Constructing Small Tree Grammars and Small Circuits for Formulas
  Hucke, Danny ; Lohrey, Markus ; Noeth, Eric 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation of smallest linear tree grammar
  Jez, Artur ; Lohrey, Markus 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Matching of Compressed Patterns with Character-Variables
  Schmidt-Schauß, Manfred 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dictionary-Based Tree Compression (Invited Talk)
  Maneth, Sebastian 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Leaf languages and string compression
  Lohrey, Markus 2008 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Combinatorial and information-theoretic aspects of tree compression
  Seelbach Benkner, Louisa ; Lohrey, Markus 2023 Universitätsbibliothek der Universität Siegen
• Grammar-based compression for strings and trees
  Hucke, Danny ; Lohrey, Markus 2019 Universitätsbibliothek der Universität Siegen