Author of the publication

Longest Common Subsequence in k Length Substrings.

, , and . SISAP, volume 8199 of Lecture Notes in Computer Science, page 257-265. 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

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap., , , , , and . ISAAC, volume 64 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Quasi-distinct Parsing and Optimal Compression Methods., , , and . CPM, volume 5577 of Lecture Notes in Computer Science, page 12-25. Springer, (2009)Longest Common Subsequence in k Length Substrings., , and . SISAP, volume 8199 of Lecture Notes in Computer Science, page 257-265. Springer, (2013)On the Cost of Interchange Rearrangement in Strings., , , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 99-110. Springer, (2007)A Guide to Similarity Measures., , and . CoRR, (2024)Interchange Rearrangement: The Element-Cost Model., , , and . SPIRE, volume 5280 of Lecture Notes in Computer Science, page 224-235. Springer, (2008)Student Poster Session., , , and . WG, volume 7551 of Lecture Notes in Computer Science, page 4-6. Springer, (2012)Approximate Cover of Strings., , , and . CPM, volume 78 of LIPIcs, page 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The Practical Efficiency of Convolutions in Pattern Matching Algorithms., , and . Fundam. Informaticae, 84 (1): 1-15 (2008)Online Parameterized Dictionary Matching with One Gap., and . Stringology, page 41-55. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2019)