Author of the publication

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.

, , , , , and . Stringology, page 135-145. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)

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

Counting and Verifying Maximal Palindromes., , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 135-146. Springer, (2010)NP-Completeness for the Space-Optimality of Double-Array Tries., , , and . CoRR, (2024)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)Generalized pattern matching and periodicity under substring consistent equivalence relations., , , , and . Theor. Comput. Sci., (2016)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)Computing Longest (Common) Lyndon Subsequences., , , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 128-142. Springer, (2022)Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks., , , , , and . ICCSA (3), volume 3482 of Lecture Notes in Computer Science, page 349-356. Springer, (2005)