104 citations · 318 across the 19 of their papers we have counts for
3 papers · 1 filter
Fast and simple algorithms for computing both and
Filip Pavetić, Ivan Katanić, Gustav Matula +2
Longest Common Subsequence () deals with the problem of measuring similarity of two strings. While this problem has been analyzed for decades, the recent interest stems from a…
++: Practical similarity metric for long strings
Filip Pavetić, Goran Žužić, Mile Šikić
In this paper we present ++: a new metric for measuring the similarity of long strings, and provide an algorithm for its efficient computation. With ever increasing size of s…
FastSIR Algorithm: A Fast Algorithm for simulation of epidemic spread in large networks by using SIR compartment model
Nino Antulov-Fantulin, Alen Lancic, Hrvoje Stefancic +1
The epidemic spreading on arbitrary complex networks is studied in SIR (Susceptible Infected Recovered) compartment model. We propose our implementation of a Naive SIR algorithm fo…