Linear-Time Computation of Similarity Measures for Sequential Data

117 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Security analysis of online centroid anomaly detection (2010, methodology): “To enable fast comparison of large byte sequences (a typical sequence length 500-1000 bytes), efficient algorithms using sorted arrays (Rieck and Laskov, 2008) have been implemented.”
Static detection of malicious JavaScript-bearing PDF documents (2011, methodology): “A solution to this problem involves a well-established technique of embedding sequences in metric spaces [20].”
Automatic analysis of malware behavior using machine learning (2011, unknown): “A detailed discussion of linear-time methods for analysis of embedded sequences is provided by [53].”
A framework for quantitative security analysis of machine learning (2009, unknown): “Technical details can be found in [9].”
Toward Supervised Anomaly Detection (2014, background): “Instead of operating with full vectors, only non-zero dimensions are considered, where the extracted strings associated with each dimension can be maintained in efﬁcient data structures (Rieck & Laskov, 2008).”