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

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding, , , and . CoRR, (2012)Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries.. CoRR, (2019)Inferring Strings from Lyndon Factorization., , , , , and . MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 565-576. Springer, (2014)Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings., , , , and . ISAAC, volume 92 of LIPIcs, page 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Faster STR-IC-LCS Computation via RLE., , , , and . CPM, volume 78 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations., , , , and . CPM, volume 128 of LIPIcs, page 29:1-29:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)From Run Length Encoding to LZ78 and Back Again., , , , and . DCC, page 143-152. IEEE, (2013)Minimal Unique Substrings and Minimal Absent Words in a Sliding Window., , , , , , , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 148-160. Springer, (2020)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)