Author of the publication

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.

, , , , , , , , and . SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 363-374. Springer, (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

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree., , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 355-366. Springer, (2015)Generalized pattern matching and periodicity under substring consistent equivalence relations., , , , and . Theor. Comput. Sci., (2016)Factorizing a String into Squares in Linear Time., , , , and . CPM, volume 54 of LIPIcs, page 27:1-27:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)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)Longest Common Subsequence in at Least k Length Order-isomorphic Substrings., , , , , , , , and . CoRR, (2016)Factorizing Strings into Repetitions., , , , , and . Theory Comput. Syst., 66 (2): 484-501 (2022)Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings., , , , , , , , and . SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 363-374. Springer, (2017)