{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:12Z","timestamp":1725516252698},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693833"},{"type":"electronic","value":"9783540693840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69384-0_55","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:39:15Z","timestamp":1217471955000},"page":"499-508","source":"Crossref","is-referenced-by-count":2,"title":["Network Traffic Classification by Common Subsequence Finding"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Fabja\u0144ski","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"Kruk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","volume-title":"Defense and Detection Strategies against Internet Worms","author":"J. Nazario","year":"2004","unstructured":"Nazario, J.: Defense and Detection Strategies against Internet Worms. Artech House, Boston & London (2004)"},{"key":"55_CR2","unstructured":"Kreibich, C., Crowcroft, J.: Automated NIDS Signature Creation using Honeypots. University of Cambridge Computer Laborator (2003)"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Kreibich, C., Crowcroft, J.: Honeycomb - Creating Intrusion Detection Signatures Using Honeypots. In: Proceedings of the Second Workshop on Hot Topics in Networks (Hotnets II). Cambridge Massachusetts: ACM SIGCOMM, Boston (2003)","DOI":"10.1145\/972374.972384"},{"key":"55_CR4","unstructured":"Rzewuski, C.: Bachelor\u2019s Thesis: SigSearch - automated signature generation system (in Polish). Warsaw University of Technology, The Faculty of Electronics and Information Technology (2005)"},{"key":"55_CR5","unstructured":"Kijewski, P., Kruk, T.: Arakis - a network early warning system (in Polish) (2006)"},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/1177080.1177121","volume-title":"IMC 2006: Proceedings of the 6th ACM SIGCOMM on Internet measurement, isbn 1-59593-561-4","author":"C. Kreibich","year":"2006","unstructured":"Kreibich, C., Crowcroft, J.: Efficient sequence alignment of network traffic. In: IMC 2006: Proceedings of the 6th ACM SIGCOMM on Internet measurement, isbn 1-59593-561-4, pp. 307\u2013312. ACM Press, Brazil (2006)"},{"key":"55_CR7","unstructured":"Bakos, G., Beale, J.: Honeypot Advantages & Disadvantages, LasVegas, pp. 7\u20138 (November 2002)"},{"key":"55_CR8","unstructured":"Kreibich, C.: libstree \u2013 A generic suffix tree library, http:\/\/www.icir.org\/christian\/libstree\/"},{"key":"55_CR9","unstructured":"Gusfield, D.: Efficient method for multiple sequence alignment with guaranteed error bound. Report CSE-91-4, Computer Science Division, University of California, Davis (1991)"},{"key":"55_CR10","first-page":"1","volume":"03","author":"K. Reinert","year":"2005","unstructured":"Reinert, K.: Introduction to Multiple Sequence Alignment. Algorithmische Bioinformatik WS\u00a003, 1\u201330 (2005)","journal-title":"Algorithmische Bioinformatik WS"},{"key":"55_CR11","unstructured":"Bioinformatics Multiple sequence alignment, http:\/\/homepages.inf.ed.ac.uk\/fgeerts\/course\/msa.pdf"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Kharrazi, M., Shanmugasundaram, K., Memon, N.: Network Abuse Detection via Flow Content Characterization. In: IEEE Workshop on Information Assurance and Security United States Military Academy (2004)","DOI":"10.1109\/IAW.2004.1437829"},{"key":"55_CR13","first-page":"406","volume":"2","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol.\u00a02, 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"key":"55_CR14","unstructured":"Tajima, F.: A Simple Graphic Method for Reconstructing Phylogenetic Trees from Molecular Data. In: Reconstruction of Phylogenetic Trees, Department of Population Genetics, National Institute of Genetics, Japan, pp. 578\u2013589 (1990)"},{"key":"55_CR15","unstructured":"The Neighbor-Joining Method, http:\/\/www.icp.ucl.ac.be\/~opperd\/private\/neighbor.html"},{"key":"55_CR16","unstructured":"Weng, Z.: Protein and DNA Sequence Analysis BE561. Boston University (2005)"},{"key":"55_CR17","unstructured":"Multiple alignment: heuristics, http:\/\/www.bscbioinformatics.com\/Stu\/Dbq\/clustalW.pdf"},{"key":"55_CR18","unstructured":"Levenshtein, V.: Binary codes capable of correcting insertions and reversals. Soviet Physics Doklady, 707\u2013710 (1966)"},{"key":"55_CR19","unstructured":"Ester, M., Kriegel, H., Sander, J., Xiaowei, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD 1996), Institute for Computer Science, University of Munich (1996)"},{"key":"55_CR20","unstructured":"Fabja\u00f1ski, K.: Master\u2019s Thesis: Network Traffic Classification by Common Subsequence Finding. Warsaw University of Technology, The Faculty of Electronics and Information Technology, Warsaw (2007)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69384-0_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:03:25Z","timestamp":1557698605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69384-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693833","9783540693840"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69384-0_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}