A New Algorithm for Finding Trees with Many Leaves
- 作者Joachim Kneis; Alexander Langer; Peter Rossmanith
- 卷第61卷
- 期第4期
- 印刷ISSN0178-4617
- 电子ISSN1432-0541
- 文件大小560.91KB
- 发表时间2011-12
- DOI10.1007/s00453-010-9454-5
- 页码882-897
Fingerprints in compressed stringsBille, Philip; Gørtz, Inge Li; Cording, Patrick Hagge; Sach, Benjamin; Vildhøj, Hjalte Wedel; Vind, Søren · Journal of Computer and System Sciences · 2017
String Indexing for Patterns with WildcardsBille, Philip; Gørtz, Inge Li; Vildhøj, Hjalte Wedel; Vind, Søren · Theory of Computing Systems · 2014
String matching with variable length gapsPhilip Bille; Inge Li Gørtz; Hjalte Wedel Vildhøj; David Kofoed Wind · 2012
Matching subsequences in treesPhilip Bille; Inge Li Gørtz · 2009
Substring Range ReportingPhilip Bille, Inge Li Gørtz · 2014
Sparse Text Indexing in Small SpaceBille, Philip; Fischer, Johannes; Gørtz, Inge Li; Kopelowitz, Tsvi; Sach, Benjamin; Vildhøj, Hjalte Wedel · ACM Transactions on Algorithms · 2016
Subsequence automata with default transitionsBille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye · Journal of Discrete Algorithms · 2017
Tree compression with top treesBille, Philip; Gørtz, Inge Li; Landau, Gad M.; Weimann, Oren · Information and Computation · 2015