Author of the publication

Efficient Lyndon Factorization of Grammar Compressed Text.

, , , , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 153-164. Springer, (2013)

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

Efficient Computation of Substring Equivalence Classes with Suffix Arrays., , , , and . Algorithmica, 79 (2): 291-318 (2017)General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations., , , and . ECML/PKDD (2), volume 7524 of Lecture Notes in Computer Science, page 435-450. Springer, (2012)Converting SLP to LZ78 in almost Linear Time., , , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 38-49. Springer, (2013)NP-Completeness for the Space-Optimality of Double-Array Tries., , , and . CoRR, (2024)Generalized pattern matching and periodicity under substring consistent equivalence relations., , , , and . Theor. Comput. Sci., (2016)Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection., , , , , , and . ECCB, page 227-236. (2003)Faster Compact On-Line Lempel-Ziv Factorization, , , , and . CoRR, (2013)Computing All Distinct Squares in Linear Time for Integer Alphabets., , and . CPM, volume 78 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Counting and Verifying Maximal Palindromes., , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 135-146. Springer, (2010)Finding Characteristic Substrings from Compressed Texts., and . Stringology, page 40-54. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)