{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:28:52Z","timestamp":1725586132950},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219337"},{"type":"electronic","value":"9783642219344"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21934-4_32","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T14:12:27Z","timestamp":1308319947000},"page":"398-409","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithm for Detecting Parameterized Multiple Clones in a Large Software System"],"prefix":"10.1007","author":[{"given":"Rajesh","family":"Prasad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suneeta","family":"Agarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anuj Kumar","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Roy, C.K., Cordy, J.R.: A survey on clone detection research. Technical Report No. 2007-541, School of Computing, Queen\u2019s University at Kingston, Ontario, Canada (2007)","key":"32_CR1"},{"issue":"10","key":"32_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communication of ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communication of ACM"},{"issue":"5","key":"32_CR3","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1137\/S0097539793246707","volume":"26","author":"B.S. Baker","year":"1997","unstructured":"Baker, B.S.: Parameterized duplication in string: algorithm and application in software maintenance. SIAM J. Computing\u00a026(5), 1343\u20131362 (1997)","journal-title":"SIAM J. Computing"},{"unstructured":"Baker, B.S.: Parameterized diff. In: 10th Symposium on Discrete Algorithm (SODA), pp. 854\u2013855 (1999)","key":"32_CR4"},{"issue":"10","key":"32_CR5","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string-searching algorithm. Communication of ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Communication of ACM"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ipl.2006.06.009","volume":"100","author":"K. Fredriksson","year":"2006","unstructured":"Fredriksson, K., Mozgovoy, M.: Efficient parameterized string matching. Information Processing Letters (IPL)\u00a0100(3), 91\u201396 (2006)","journal-title":"Information Processing Letters (IPL)"},{"issue":"6","key":"32_CR7","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings, Software. Practice & Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Practice & Experience"},{"key":"32_CR8","first-page":"778","volume-title":"8th IEEE International Conference on Computer and Information Technology","author":"R. Prasad","year":"2008","unstructured":"Prasad, R., Agarwal, S.: A new parameterized string matching algorithm by combining bit-parallelism and suffix automata. In: 8th IEEE International Conference on Computer and Information Technology, Sydney, Australia, pp. 778\u2013783. IEEE Press, Los Alamitos (2008)"},{"issue":"10","key":"32_CR9","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1002\/spe.4380221006","volume":"22","author":"T. Raita","year":"1992","unstructured":"Raita, T.: Tuning the Boyer-Moore-Horspool string searching algorithm. Software - Practice & Experience\u00a022(10), 879\u2013884 (1992)","journal-title":"Software - Practice & Experience"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.jda.2007.11.001","volume":"6","author":"L. Salmela","year":"2008","unstructured":"Salmela, L., Tarhio, J.: Fast Parameterized Matching with q-grams. Journal of Discrete Algorithm\u00a06(3), 408\u2013419 (2008)","journal-title":"Journal of Discrete Algorithm"},{"issue":"10","key":"32_CR11","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1002\/spe.4380211006","volume":"21","author":"P.D. Smith","year":"1991","unstructured":"Smith, P.D.: Experiments with a very fast substring search algorithm. Software - Practice & Experience\u00a021(10), 1065\u20131074 (1991)","journal-title":"Software - Practice & Experience"},{"issue":"8","key":"32_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"D.M. Sunday","year":"1990","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Communications of the ACM\u00a033(8), 132\u2013142 (1990)","journal-title":"Communications of the ACM"},{"issue":"10","key":"32_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching allowing errors. Communication of the ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Communication of the ACM"},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11786-010-0035-4","volume":"3","author":"M.O. Kulekci","year":"2010","unstructured":"Kulekci, M.O.: BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation. Mathematics in Computer Science\u00a03(4), 407\u2013420 (2010)","journal-title":"Mathematics in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and Flexible String Matching by Combining Bit-parallelism and Suffix automata. ACM Journal of Experimental Algorithms\u00a05(4) (2000)","key":"32_CR15","DOI":"10.1145\/351827.384246"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21934-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T17:00:57Z","timestamp":1560272457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21934-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219337","9783642219344"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21934-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}