{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T23:48:24Z","timestamp":1672616904311},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,12]],"date-time":"2007-10-12T00:00:00Z","timestamp":1192147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10115-007-0108-0","type":"journal-article","created":{"date-parts":[[2007,10,11]],"date-time":"2007-10-11T09:14:03Z","timestamp":1192094043000},"page":"303-329","source":"Crossref","is-referenced-by-count":9,"title":["S2S: structural-to-syntactic matching similar documents"],"prefix":"10.1007","volume":"16","author":[{"given":"Ramazan S.","family":"Ayg\u00fcn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,12]]},"reference":[{"issue":"1","key":"108_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"AV Aho","year":"1976","unstructured":"Aho AV, Hirschberg DS and Ullman JD (1976). Bounds on the complexity of the longest common subsequence problem. J ACM 23(1): 1\u201312","journal-title":"J ACM"},{"key":"108_CR2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0196-6774(03)00097-X","volume":"50","author":"AM Lewenstein","year":"2004","unstructured":"Lewenstein AM and Porat E (2004). Faster algorithms for string matching with k mismatches. J Algorithms 50: 257\u2013275","journal-title":"J Algorithms"},{"key":"108_CR3","doi-asserted-by":"crossref","unstructured":"Apostolico (1996) String editing and longest common subsequences. In: Rozenberg G, Salomaa A (eds). Vol II of Handbook of Formal Languages. Springer, Heidelberg","DOI":"10.1007\/978-3-662-07675-0_8"},{"issue":"5","key":"108_CR4","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/2.841784","volume":"33","author":"B Brewington","year":"2000","unstructured":"Brewington B and Cybenko G (2000). Keeping up with the changing web. IEEE Comput 33(5): 52\u201358","journal-title":"IEEE Comput"},{"issue":"4","key":"108_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10115-006-0016-8","volume":"10","author":"G Chen","year":"2006","unstructured":"Chen G, Wu X, Zhu X, Arslan AN and He Y (2006). Efficient string matching with wildcards and length constraints. Knowl Inf Syst 10(4): 399\u2013419","journal-title":"Knowl Inf Syst"},{"key":"108_CR6","unstructured":"Cho J, Garcia-Molina H (2000) The evolution of the web and implications for an incremental crawler. In Proceedings of 26th international conference on very large data bases, pp 117\u2013178"},{"key":"108_CR7","unstructured":"Broder (1997) On the resemblance and containment of documents. Compression and complexity of sequences(SEQUENCES\u201997), IEEE Computer Society pp 21\u201329"},{"key":"108_CR8","unstructured":"DBWORLD (2007) DBWorld, http:\/\/www.cs.wisc.edu\/dbworld\/ [Online; accessed 04-30-2007]"},{"key":"108_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S Deerwester","year":"1990","unstructured":"Deerwester S, Dumais ST, Furnas GW, Landauer TK and Harshman R (1990). Indexing by Latent Semantic Analysis. J Am Soc Inf Sci 41: 391\u2013407","journal-title":"J Am Soc Inf Sci"},{"key":"108_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.3758\/BF03203370","volume":"23","author":"ST Dumais","year":"1991","unstructured":"Dumais ST (1991). Improving the retrieval of information from external resources. Behav Res Methods Instr Comput 23: 229\u2013236","journal-title":"Behav Res Methods Instr Comput"},{"issue":"6","key":"108_CR11","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1007\/s10115-003-0118-5","volume":"6","author":"KM Hammouda","year":"2004","unstructured":"Hammouda KM and Kamel MS (2004). Document similarity using a phrase indexing graph model. Knowl Inf Syst 6(6): 710\u2013727","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"108_CR12","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"DS Hirschberg","year":"1977","unstructured":"Hirschberg DS (1977). Algorithms for the longest common subsequence problem. J ACM 24(4): 664\u2013675","journal-title":"J ACM"},{"key":"108_CR13","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/279310.279321","volume":"7","author":"J Hunt","year":"1998","unstructured":"Hunt J, Vo KP and Tichy W (1998). Delta algorithms: an empirical analysis. ACM Trans Softw Eng Methodol 7: 192\u2013214","journal-title":"ACM Trans Softw Eng Methodol"},{"issue":"4","key":"108_CR14","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/s10115-004-0188-z","volume":"8","author":"Z Li","year":"2005","unstructured":"Li Z, Ng WK and Sun A (2005). Web data extraction based on structural similarity. Knowl Inf Syst 8(4): 438\u2013461","journal-title":"Knowl Inf Syst"},{"key":"108_CR15","unstructured":"Korn D, Vo K-P (2002) Engineering a differencing and compression data format. In: Proceedings of the usenix annual technical conference, pp 219\u2013228"},{"key":"108_CR16","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1002\/spe.4380151102","volume":"15","author":"W Miller","year":"1985","unstructured":"Miller W and Myers EW (1985). A file comparison program. Softw Pract Exper 15: 1025\u20131040","journal-title":"Softw Pract Exper"},{"key":"108_CR17","unstructured":"Milojicic DS, Kalogeraki V, Lukose R, Nagarajal K, Pruyne J, Richard B, Rollis S, Xu Z (2002) Peer-to-peer computing. HP technical report, HPL-2002-57"},{"key":"108_CR18","first-page":"171","volume":"18","author":"N Nakatsu","year":"1982","unstructured":"Nakatsu N, Kambayashi Y and Yajima S (1982). A longest common subsequence algorithm suitable for similar text strings. Acta Info 18: 171\u2013179","journal-title":"Acta Info"},{"issue":"1","key":"108_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro G (2001). A guided tour to approximate string matching. ACM Comput Surv 33(1): 31\u201388","journal-title":"ACM Comput Surv"},{"key":"108_CR20","doi-asserted-by":"crossref","unstructured":"Rivest R (1992) The MD5 message-digest algorithm. RFC1321","DOI":"10.17487\/rfc1321"},{"key":"108_CR21","volume-title":"Time warps, string edits, and macromolecules: the theory and practice of sequence comparison","author":"D Sankoff","year":"1983","unstructured":"Sankoff D and Kruskal JB (1983). Time warps, string edits and macromolecules: the theory and practice of sequence comparison. Addison Wesley, Reading"},{"key":"108_CR22","unstructured":"Savant A, Suel T (2003) Server-friendly delta compression for efficient Web Access. In: 8th international workshop on web content caching and distribution (WCW)"},{"key":"108_CR23","unstructured":"Schubert E, Schaffert S, Bry F (2005) Structure-preserving difference search for XML documents. In: Proceedings of the extreme markup languages conference, Montreal, QC Canada"},{"key":"108_CR24","unstructured":"Trigdell A (2000) Efficient algorithms for sorting and synchronization. PhD Thesis, Australian National University"},{"key":"108_CR25","unstructured":"Trigdell A, Mackerras P (1996) The rsync algorithm. Technical Report TR-CS-96-05, Australian National University"},{"key":"108_CR26","unstructured":"Wang H, Liu C (2006) Neighbourhood counting metric for sequences. In: Advances in intelligent IT active media 2006, IOS Press, pp 243\u2013260"},{"key":"108_CR27","unstructured":"Wikimedia Diff (2007) Wikimedia, Meta-Wiki. http:\/\/meta.wikimedia.org\/wiki\/Diff , [Online; accessed 04-30-2007]"},{"key":"108_CR28","unstructured":"Wikipedia (2007) The Free Encyclopedia. http:\/\/en.wikipedia.org [Online; accessed 04-30-2007]"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0108-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-007-0108-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0108-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:17Z","timestamp":1559110217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-007-0108-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,12]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["108"],"URL":"https:\/\/doi.org\/10.1007\/s10115-007-0108-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,12]]}}}