{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:39:28Z","timestamp":1773653968831,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T00:00:00Z","timestamp":1414108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s11416-014-0227-6","type":"journal-article","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T16:35:34Z","timestamp":1414082134000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Malware clustering using suffix trees"],"prefix":"10.1007","volume":"12","author":[{"given":"Ciprian","family":"Opri\u015fa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Cab\u0103u","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gheorghe","family":"Sebestyen Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,24]]},"reference":[{"issue":"1","key":"227_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BF01459088","volume":"99","author":"W Ackermann","year":"1928","unstructured":"Ackermann, W.: Zum hilbertschen aufbau der reellen zahlen. Mathematische Annalen 99(1), 118\u2013133 (1928)","journal-title":"Mathematische Annalen"},{"key":"227_CR2","unstructured":"AV-Test: Malware statistics (2014). http:\/\/www.av-test.org\/en\/statistics\/malware\/"},{"key":"227_CR3","unstructured":"Bayer, U., Comparetti, P.M., Hlauschek, C., Kruegel, C., Kirda, E.: Scalable, behavior-based malware clustering. In: NDSS 9, 8\u201311 (2009). Citeseer"},{"issue":"2","key":"227_CR4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1504\/IJESDF.2007.016865","volume":"1","author":"D Bilar","year":"2007","unstructured":"Bilar, D.: Opcodes as predictor for malware. Int. J. Electr. Secur. Digit. Forensics 1(2), 156\u2013168 (2007)","journal-title":"Int. J. Electr. Secur. Digit. Forensics"},{"key":"227_CR5","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., et al.: Introduction to algorithms, vol. 2. MIT press, Cambridge (2001)"},{"key":"227_CR6","doi-asserted-by":"crossref","unstructured":"Gower, J.C., Ross, G.: Minimum spanning trees and single linkage cluster analysis. Applied statistics pp. 54\u201364 (1969)","DOI":"10.2307\/2346439"},{"key":"227_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"227_CR8","unstructured":"Hu, X., Shin, K.G., Bhatkar, S., Griffin, K.: Mutantx-s: Scalable malware clustering based on static features. In: USENIX Annual Technical Conference, pp. 187\u2013198 (2013)"},{"key":"227_CR9","doi-asserted-by":"crossref","unstructured":"Jana, P., Naik, A.: An efficient minimum spanning tree based clustering algorithm. In: ICM2CS 2009. Proceeding of International Conference on Methods and Models in Computer Science. pp. 1\u20135. IEEE Press, New York (2009)","DOI":"10.1109\/ICM2CS.2009.5397966"},{"key":"227_CR10","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. In: Soviet physics doklady, vol. 10, p. 707 (1966)"},{"key":"227_CR11","first-page":"1","volume":"94","author":"U Manber","year":"1994","unstructured":"Manber, U., et al.: Finding similar files in a large file system. Usenix Winter 94, 1\u201310 (1994)","journal-title":"Usenix Winter"},{"issue":"1","key":"227_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"227_CR13","doi-asserted-by":"crossref","unstructured":"Oprisa, C., Checiches, M., Nandrean, A.: Locality-sensitive hashing optimizations for fast malware clustering. In: IEEE International Conference on Intelligent Computer Communication and Processing (ICCP). IEEE Press, New York (2014)","DOI":"10.1109\/ICCP.2014.6936960"},{"key":"227_CR14","unstructured":"Perdisci, R., Lee, W., Feamster, N.: Behavioral clustering of http-based malware and signature generation using malicious network traces. In: NSDI, pp. 391\u2013404 (2010)"},{"issue":"1","key":"227_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2190-8532-1-1","volume":"1","author":"A Shabtai","year":"2012","unstructured":"Shabtai, A., Moskovitch, R., Feher, C., Dolev, S., Elovici, Y.: Detecting unknown malicious code by applying classification techniques on opcode patterns. Secur. Inf. 1(1), 1\u201322 (2012)","journal-title":"Secur. Inf."},{"issue":"1","key":"227_CR16","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R.: Slink: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973)","journal-title":"Comput. J."},{"key":"227_CR17","doi-asserted-by":"crossref","unstructured":"Skiena, S.S.: The algorithm design manual (2008)","DOI":"10.1007\/978-1-84800-070-4"},{"key":"227_CR18","unstructured":"Sz\u00f6r, P., Ferrie, P.: Hunting for metamorphic. In: Virus Bulletin Conference (2001)"},{"issue":"2","key":"227_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215\u2013225 (1975)","journal-title":"J. ACM"},{"issue":"3","key":"227_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"227_CR21","doi-asserted-by":"crossref","unstructured":"Vatamanu, C., Gavrilu\u0163, D., Benchea, R.: A practical approach on clustering malicious pdf documents. J. Comput. Virol. 8(4), 151\u2013163 (2012)","DOI":"10.1007\/s11416-012-0166-z"},{"key":"227_CR22","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: SWAT\u201908. IEEE Conference Record of 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311. IEEE Press, New York (1973)","DOI":"10.1109\/SWAT.1973.13"},{"issue":"4","key":"227_CR23","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1093\/bioinformatics\/18.4.536","volume":"18","author":"Y Xu","year":"2002","unstructured":"Xu, Y., Olman, V., Xu, D.: Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics 18(4), 536\u2013545 (2002)","journal-title":"Bioinformatics"},{"key":"227_CR24","first-page":"025","volume":"12","author":"YC Zhang","year":"2007","unstructured":"Zhang, Y.C., Che, M., Ma, J.: Analysis of the longest common substring algorithm. Comput. Simul. 12, 025 (2007)","journal-title":"Comput. Simul."}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-014-0227-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11416-014-0227-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-014-0227-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T11:19:04Z","timestamp":1565954344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11416-014-0227-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,24]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s11416-014-0227-6","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,24]]}}}