Filip Pavetic

most cited

L C S k

++: Practical similarity metric for long strings

8 citations · 12 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2017★ 4 cited

Fast and simple algorithms for computing both $L C S_{k}$ and $L C S_{k +}$

Filip Pavetić, Ivan Katanić, Gustav Matula +2

Longest Common Subsequence ( $L C S$ ) deals with the problem of measuring similarity of two strings. While this problem has been analyzed for decades, the recent interest stems from a…

cs.DS2014★ 8 cited

$L C S k$ ++: Practical similarity metric for long strings

Filip Pavetić, Goran Žužić, Mile Šikić

In this paper we present $L C S k$ ++: a new metric for measuring the similarity of long strings, and provide an algorithm for its efficient computation. With ever increasing size of s…

Fast and simple algorithms for computing both LCSk​ and LCSk+​

LCSk++: Practical similarity metric for long strings

Fast and simple algorithms for computing both $L C S_{k}$ and $L C S_{k +}$

$L C S k$ ++: Practical similarity metric for long strings