Author of the publication

Tight Bounds on the Maximum Number of Shortest Unique Substrings.

, , , and . CPM, volume 78 of LIPIcs, page 24:1-24:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Inferring Strings from Lyndon Factorization., , , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 565-576. Springer, (2014)Practical Grammar Compression Based on Maximal Repeats., , , , , and . Algorithms, 13 (4): 103 (2020)Extensive feature detection of N-terminal protein sorting signals., , , , and . Bioinform., 18 (2): 298-305 (2002)Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models., , , , , and . J. Bioinform. Comput. Biol., 3 (6): 1295-1314 (2005)Lyndon Words, the Three Squares Lemma, and Primitive Squares., , and . SPIRE, volume 12303 of Lecture Notes in Computer Science, page 265-273. Springer, (2020)On Repetitiveness Measures of Thue-Morse Words., , , , , and . SPIRE, volume 12303 of Lecture Notes in Computer Science, page 213-220. Springer, (2020)Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality., , , and . Discovery Science, volume 5808 of Lecture Notes in Computer Science, page 465-472. Springer, (2009)Constructing the Bijective BWT., , , and . CoRR, (2019)From Run Length Encoding to LZ78 and Back Again., , , , and . DCC, page 143-152. IEEE, (2013)An Improved Data Structure for Left-Right Maximal Generic Words Problem., , , , and . ISAAC, volume 149 of LIPIcs, page 40:1-40:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)