{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:32:51Z","timestamp":1773192771473,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1145\/1081706.1081733","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T12:34:39Z","timestamp":1131366879000},"page":"156-165","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Detecting higher-level similarity patterns in programs"],"prefix":"10.1145","author":[{"given":"Hamid Abdul","family":"Basit","sequence":"first","affiliation":[{"name":"National University of Singapore"}]},{"given":"Stan","family":"Jarzabek","sequence":"additional","affiliation":[{"name":"National University of Singapore"}]}],"member":"320","published-online":{"date-parts":[[2005,9]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"449","volume-title":"Proc. Workshop on Algorithms in Bioinformatics, in Lecture Notes in Computer Science","author":"Abouelhoda M.I.","year":"2002","unstructured":"Abouelhoda , M.I. , Kurtz , S. , and Ohlebusch , E . The enhanced suffix array and its applications to genome analysis . In Proc. Workshop on Algorithms in Bioinformatics, in Lecture Notes in Computer Science , vol. 2452 , Springer-Verlag , Berlin , 2002 , pp. 449 -- 463 .]] Abouelhoda, M.I., Kurtz, S., and Ohlebusch, E. The enhanced suffix array and its applications to genome analysis. In Proc. Workshop on Algorithms in Bioinformatics, in Lecture Notes in Computer Science, vol. 2452, Springer-Verlag, Berlin, 2002, pp. 449--463.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646491.694966"},{"key":"e_1_3_2_1_3_1","unstructured":"ANTLR website at http:\/\/www.antlr.org]] ANTLR website at http:\/\/www.antlr.org]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062537"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/832303.836911"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793246707"},{"key":"e_1_3_2_1_7_1","first-page":"368","volume-title":"Proc. Intl. Conference on Software Maintenance (ICSM '98)","author":"Baxter I.","unstructured":"Baxter , I. , Yahin , A. , Moura , L. , and Anna , M. S . Clone detection using abstract syntax trees . In Proc. Intl. Conference on Software Maintenance (ICSM '98) , pp. 368 -- 377 .]] Baxter, I., Yahin, A., Moura, L., and Anna, M. S. Clone detection using abstract syntax trees. In Proc. Intl. Conference on Software Maintenance (ICSM '98), pp. 368--377.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.30731"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.333.0477"},{"key":"e_1_3_2_1_10_1","unstructured":"Case Study: eliminating redundant codes in the Buffer library. At XVCL Website http:\/\/xvcl.comp.nus.edu.sg\/xvcl\/buffer\/index.htm]] Case Study: eliminating redundant codes in the Buffer library. At XVCL Website http:\/\/xvcl.comp.nus.edu.sg\/xvcl\/buffer\/index.htm]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1080\/10618600.1993.10474605","article-title":"Dotplot: A program for exploring self-similarity in million of lines of text and code","author":"Church K. W.","year":"1993","unstructured":"Church , K. W. and Helfman , J. I . Dotplot: A program for exploring self-similarity in million of lines of text and code . Journal of Computational and Graphical Statistics , June 1993 , 2(2): 153 -- 174 .]] Church, K. W. and Helfman, J. I. Dotplot: A program for exploring self-similarity in million of lines of text and code. Journal of Computational and Graphical Statistics, June 1993, 2(2):153--174.]]","journal-title":"Journal of Computational and Graphical Statistics"},{"issue":"3","key":"e_1_3_2_1_12_1","first-page":"219","article-title":"The development of a software clone detector","volume":"1","author":"Davey N.","year":"1995","unstructured":"Davey , N. , Barson , P. , Field , S. , Frank , R. , and Tansley , D . The development of a software clone detector . International Journal of Applied Software Technology , 1 ( 3-4 ): 219 -- 236 , 1995 .]] Davey, N., Barson, P., Field, S., Frank, R., and Tansley, D. The development of a software clone detector. International Journal of Applied Software Technology, 1(3-4): 219--236, 1995.]]","journal-title":"International Journal of Applied Software Technology"},{"key":"e_1_3_2_1_13_1","first-page":"109","volume-title":"Proc. Intl. Conference on Software Maintenance (ICSM '99)","author":"Ducasse S","unstructured":"Ducasse , S , Rieger , M. , and Demeyer , S . A language independent approach for detecting duplicated code . In Proc. Intl. Conference on Software Maintenance (ICSM '99) , pp. 109 -- 118 .]] Ducasse, S, Rieger, M., and Demeyer, S. A language independent approach for detecting duplicated code. In Proc. Intl. Conference on Software Maintenance (ICSM '99), pp. 109--118.]]"},{"key":"e_1_3_2_1_14_1","volume-title":"Analysis patterns: reusable object models","author":"Fowler M.","year":"1997","unstructured":"Fowler , M. Analysis patterns: reusable object models . Addison-Wesley , 1997 .]] Fowler, M. Analysis patterns: reusable object models. Addison-Wesley, 1997.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"Design Patterns: Elements of Reusable Object-Oriented Software. Reading Mass","author":"Gamma E.","year":"1995","unstructured":"Gamma , E. , Helm , R. , Johnson , R. and Vlissides , J . Design Patterns: Elements of Reusable Object-Oriented Software. Reading Mass ., Addison Wesley , 1995 .]] Gamma, E., Helm, R., Johnson, R. and Vlissides, J. Design Patterns: Elements of Reusable Object-Oriented Software. Reading Mass., Addison Wesley, 1995.]]"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceeding of the First IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03)","author":"Grahne G.","year":"2003","unstructured":"Grahne , G. , and Zhu , J ., Efficiently Using Prefix-trees in Mining Frequent Itemsets . In Proceeding of the First IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03) , Melbourne, FL , Nov 2003 .]] Grahne, G., and Zhu, J., Efficiently Using Prefix-trees in Mining Frequent Itemsets. In Proceeding of the First IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Melbourne, FL, Nov 2003.]]"},{"key":"e_1_3_2_1_17_1","volume-title":"Data Mining: Concepts and Techniques","author":"Han J.","year":"2001","unstructured":"Han , J. , and Kamber , M . Data Mining: Concepts and Techniques . Morgan Kaufmann Publishers , San Francisco ( 2001 ).]] Han, J., and Kamber, M. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2001).]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/940071.940104"},{"key":"e_1_3_2_1_19_1","unstructured":"Java Technology at http:\/\/java.sun.com\/]] Java Technology at http:\/\/java.sun.com\/]]"},{"key":"e_1_3_2_1_20_1","first-page":"171","volume-title":"of the 1993 Conf. of the Centre for Advanced Studies on Collaborative research: software engineering (CASCON '93)","author":"Johnson J. H.","unstructured":"Johnson , J. H. , \" Identifying redundancy in source code using fingerprints,\" Proc . of the 1993 Conf. of the Centre for Advanced Studies on Collaborative research: software engineering (CASCON '93) , pp 171 -- 183 .]] Johnson, J. H., \"Identifying redundancy in source code using fingerprints,\" Proc. of the 1993 Conf. of the Centre for Advanced Studies on Collaborative research: software engineering (CASCON '93), pp 171--183.]]"},{"key":"e_1_3_2_1_21_1","first-page":"120","volume-title":"J. H. Substring Matching for Clone Detection and Change Tracking. In Proc. Intl. Conference on Software Maintenance (ICSM '94)","author":"Johnson","unstructured":"Johnson , J. H. Substring Matching for Clone Detection and Change Tracking. In Proc. Intl. Conference on Software Maintenance (ICSM '94) , pages 120 -- 126 .]] Johnson, J. H. Substring Matching for Clone Detection and Change Tracking. In Proc. Intl. Conference on Software Maintenance (ICSM '94), pages 120--126.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1019480"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. 30th Internat. Colloq. Automata, Languages & Programming (2003)","author":"Karkkainen J.","unstructured":"Karkkainen , J. , and Sanders , P . Simple linear work suffix array construction . In Proc. 30th Internat. Colloq. Automata, Languages & Programming (2003) 943--955.]] Karkkainen, J., and Sanders, P. Simple linear work suffix array construction. In Proc. 30th Internat. Colloq. Automata, Languages & Programming (2003) 943--955.]]"},{"key":"e_1_3_2_1_24_1","volume-title":"CPM 2001, LNCS 2089.]]","author":"Kasai T.","unstructured":"Kasai , T. , Lee , G. , Arimura , H. , Arikawa , S. , and Park , K . Linear time longest common prefix computation in suffix arrays and its applications . CPM 2001, LNCS 2089.]] Kasai, T., Lee, G., Arimura, H., Arikawa, S., and Park, K. Linear time longest common prefix computation in suffix arrays and its applications. CPM 2001, LNCS 2089.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378797"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. Fourteenth Annual Symp. Combinatorial Pattern Matching (2003)","author":"Kim D.K.","unstructured":"Kim , D.K. , Sim , J.S. , Park , H. , and Park , K . Linear-time construction of suffix arrays . In Proc. Fourteenth Annual Symp. Combinatorial Pattern Matching (2003) 186--199.]] Kim, D.K., Sim, J.S., Park, H., and Park, K. Linear-time construction of suffix arrays. In Proc. Fourteenth Annual Symp. Combinatorial Pattern Matching (2003) 186--199.]]"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. Fourteenth Annual Symp. Combinatorial Pattern Matching (2003)","author":"Ko P.","unstructured":"Ko , P. , and Aluru , S . Space efficient linear time construction of suffix arrays . In Proc. Fourteenth Annual Symp. Combinatorial Pattern Matching (2003) 200--210.]] Ko, P., and Aluru, S. Space efficient linear time construction of suffix arrays. In Proc. Fourteenth Annual Symp. Combinatorial Pattern Matching (2003) 200--210.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00126960"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/647170.718283"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/832308.837142"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_1_33_1","first-page":"244","volume-title":"Proc. Intl. Conference on Software Maintenance (ICSM '96)","author":"Mayrand J.","unstructured":"Mayrand J. , Leblanc C. , and Merlo E . Experiment on the automatic detection of function clones in a software system using metrics . In Proc. Intl. Conference on Software Maintenance (ICSM '96) , pp. 244 -- 254 .]] Mayrand J., Leblanc C., and Merlo E. Experiment on the automatic detection of function clones in a software system using metrics. In Proc. Intl. Conference on Software Maintenance (ICSM '96), pp. 244--254.]]"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings Third East European Conference, ADBIS'99","author":"Morzy T.","year":"1999","unstructured":"Morzy , T. , Wojciechowski , M. , and Zakrzewicz , M . Pattern-Oriented Hierarchical Clustering. Advances in Databases and Information Systems , Proceedings Third East European Conference, ADBIS'99 , Maribor, Slovenia , 1999 . Lecture Notes in Computer Science 1691, Springer Verlag, 1999.]] Morzy, T., Wojciechowski, M., and Zakrzewicz, M. Pattern-Oriented Hierarchical Clustering. Advances in Databases and Information Systems, Proceedings Third East European Conference, ADBIS'99, Maribor, Slovenia, 1999. Lecture Notes in Computer Science 1691, Springer Verlag, 1999.]]"},{"key":"e_1_3_2_1_35_1","first-page":"374","volume-title":"Proc. of the 15th International Symposium on Computer and Information Sciences","author":"Morzy T.","year":"2000","unstructured":"Morzy , T. , Wojciechowski , M. , and Zakrzewicz , M . Web Users Clustering . In Proc. of the 15th International Symposium on Computer and Information Sciences , Istanbul, Turkey , 2000 , pages 374 -- 382 .]] Morzy, T., Wojciechowski, M., and Zakrzewicz, M. Web Users Clustering. In Proc. of the 15th International Symposium on Computer and Information Sciences, Istanbul, Turkey, 2000, pages 374--382.]]"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings 5th Pacific-Asia Conference","author":"Morzy T.","year":"2001","unstructured":"Morzy , T. , Wojciechowski , M. , and Zakrzewicz , M . Scalable Hierarchical Clustering Method for Sequences of Categorical Values. In Knowledge Discovery and Data Mining - PAKDD 2001 . In Proceedings 5th Pacific-Asia Conference , Hong Kong, China. April 16-18, 2001 . Lecture Notes in Artificial Intelligence 2035, Springer Verlag, 2001.]] Morzy, T., Wojciechowski, M., and Zakrzewicz, M. Scalable Hierarchical Clustering Method for Sequences of Categorical Values. In Knowledge Discovery and Data Mining - PAKDD 2001. In Proceedings 5th Pacific-Asia Conference, Hong Kong, China. April 16-18, 2001. Lecture Notes in Artificial Intelligence 2035, Springer Verlag, 2001.]]"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/257734.257788"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2005.87"},{"key":"e_1_3_2_1_39_1","volume-title":"Proc. 15th Australasian Workshop on Combinatorial Algorithms, Seok-Hee Hong (ed.) (2004)","author":"Ryan A. P. J.","unstructured":"Ryan , A. P. J. , Smyth , W. F. , Turpin , A. , and Xiaoyang Y . New suffix array algorithms -- linear but not fast? In Proc. 15th Australasian Workshop on Combinatorial Algorithms, Seok-Hee Hong (ed.) (2004) 148--156.]] Ryan, A. P. J., Smyth, W. F., Turpin, A., and Xiaoyang Y. New suffix array algorithms -- linear but not fast? In Proc. 15th Australasian Workshop on Combinatorial Algorithms, Seok-Hee Hong (ed.) (2004) 148--156.]]"},{"key":"e_1_3_2_1_40_1","volume-title":"Proc. IEEE Data Compression Conference (1998)","author":"Sadakane K.","unstructured":"Sadakane , K. A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation . In Proc. IEEE Data Compression Conference (1998) 129--138.]] Sadakane, K. A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation. In Proc. IEEE Data Compression Conference (1998) 129--138.]]"},{"key":"e_1_3_2_1_41_1","volume-title":"Software Engineering","author":"Somerville I.","year":"1998","unstructured":"Somerville , I. Software Engineering , Addison-Wesley Publishing Co. , New York ( 1998 ).]] Somerville, I. Software Engineering, Addison-Wesley Publishing Co., New York (1998).]]"},{"key":"e_1_3_2_1_42_1","unstructured":"XVCL website at : http:\/\/xvcl.comp.nus.edu.sg\/overview_brochure.php]] XVCL website at : http:\/\/xvcl.comp.nus.edu.sg\/overview_brochure.php]]"}],"event":{"name":"ESEC\/FSE05: Joint 10th European Software Engineering Conference 2005","location":"Lisbon Portugal","acronym":"ESEC\/FSE05","sponsor":["ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081706.1081733","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1081706.1081733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:34Z","timestamp":1750248514000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081706.1081733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":41,"alternative-id":["10.1145\/1081706.1081733","10.1145\/1081706"],"URL":"https:\/\/doi.org\/10.1145\/1081706.1081733","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1095430.1081733","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2005,9]]},"assertion":[{"value":"2005-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}