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.

No persons found for author name Narisawa, Kazuyuki
add a person with the name Narisawa, Kazuyuki
 

Other publications of authors with the same name

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)A Simple Classification Method for Class Imbalanced Data using the Kernel Mean., , and . KDIR, page 327-334. SciTePress, (2014)Detecting Regularities on Grammar-Compressed Strings., , , , , , , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 571-582. Springer, (2013)Unsupervised Spam Detection Based on String Alienness Measures., , , and . Discovery Science, volume 4755 of Lecture Notes in Computer Science, page 161-172. Springer, (2007)Permuted Pattern Matching on Multi-track Strings., , , , and . SOFSEM, volume 7741 of Lecture Notes in Computer Science, page 280-291. Springer, (2013)Efficient Computation of Substring Equivalence Classes with Suffix Arrays., , , and . CPM, volume 4580 of Lecture Notes in Computer Science, page 340-351. Springer, (2007)Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints., , , and . SOFSEM, volume 8327 of Lecture Notes in Computer Science, page 363-374. Springer, (2014)Efficient Computation of Substring Equivalence Classes with Suffix Arrays., , , , and . Algorithmica, 79 (2): 291-318 (2017)Position Heaps for Permuted Pattern Matching on Multi-Track String., , , and . SOFSEM (Student Research Forum Papers / Posters), volume 1326 of CEUR Workshop Proceedings, page 41-53. CEUR-WS.org, (2015)On Morphisms Generating Run-Rich Strings., , and . Stringology, page 35-47. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)