{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:10:10Z","timestamp":1750227010721,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T00:00:00Z","timestamp":1444348800000},"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":[[2015,10,9]]},"DOI":"10.1145\/2811411.2811474","type":"proceedings-article","created":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T04:22:54Z","timestamp":1446006174000},"page":"21-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A new approach to the edit distance with block swaps using DAWG"],"prefix":"10.1145","author":[{"given":"Phuoc-Hoang-Tuong-Lan","family":"Do","sequence":"first","affiliation":[{"name":"Konkuk University, Seoul, Korea"}]},{"given":"Sung-Ryul","family":"Kim","sequence":"additional","affiliation":[{"name":"Konkuk University, Seoul, Korea"}]}],"member":"320","published-online":{"date-parts":[[2015,10,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1041"},{"key":"e_1_3_2_1_2_1","first-page":"406","volume-title":"Edit Distance,\" in Introduction to Algorithm","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest and C. Stein , \" Edit Distance,\" in Introduction to Algorithm , 3 rd ed., Massachusetss, The MIT Press , 2009 , pp. 406 -- 408 . T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, \"Edit Distance,\" in Introduction to Algorithm, 3rd ed., Massachusetss, The MIT Press, 2009, pp. 406--408.","edition":"3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513228.2513282"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICYCS.2008.14"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90157-4"},{"key":"e_1_3_2_1_6_1","volume-title":"Seatle","author":"Roesch M.","year":"1999","unstructured":"M. Roesch , \"Snort - Lightweight Intrusion Detection for Networks,\" in Proceeding of the 13th on Systems Administration , Seatle , 1999 . M. Roesch, \"Snort - Lightweight Intrusion Detection for Networks,\" in Proceeding of the 13th on Systems Administration, Seatle, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_8_1","first-page":"192","volume-title":"On compact directed acyclic word graphs,\" in Structures in Logic and Computer Science","author":"Crochemore M.","year":"1997","unstructured":"M. Crochemore and R. V\u00e9rin , \" On compact directed acyclic word graphs,\" in Structures in Logic and Computer Science , vol. 1261 , J. Mycielski, G. Rozenberg and A. Salomaa, Eds., Springer Berlin Heidelberg , 1997 , pp. 192 -- 211 . M. Crochemore and R. V\u00e9rin, \"On compact directed acyclic word graphs,\" in Structures in Logic and Computer Science, vol. 1261, J. Mycielski, G. Rozenberg and A. Salomaa, Eds., Springer Berlin Heidelberg, 1997, pp. 192--211."},{"key":"e_1_3_2_1_9_1","volume-title":"Maximal repetitions and application to DNA sequences","author":"Giraud M.","year":"2000","unstructured":"M. Giraud and G. Kucherov , \" Maximal repetitions and application to DNA sequences ,\" 2000 . M. Giraud and G. Kucherov, \"Maximal repetitions and application to DNA sequences,\" 2000."},{"key":"e_1_3_2_1_10_1","unstructured":"M. Farach \"Optimal suffix tree construction with large alphabets \" in 38th Annual Symposium on Foundations of Computer Science Miami FL 1997.   M. Farach \"Optimal suffix tree construction with large alphabets \" in 38th Annual Symposium on Foundations of Computer Science Miami FL 1997."},{"key":"e_1_3_2_1_11_1","first-page":"112","volume-title":"Carleton University Press","author":"Navarro G.","year":"1997","unstructured":"G. Navarro , \"A partial deterministic automaton for approximate string matching,\" in Fourth South American Workshop on String Processing , Carleton University Press , 1997 , pp. 112 -- 124 . G. Navarro, \"A partial deterministic automaton for approximate string matching,\" in Fourth South American Workshop on String Processing, Carleton University Press, 1997, pp. 112--124."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-642-14165-2_21","volume-title":"Interval Sorting,\" in Automata, Languages and Programming","author":"Jim\u00e9nez R. M.","year":"2010","unstructured":"R. M. Jim\u00e9nez and C. Mart\u00ednez , \" Interval Sorting,\" in Automata, Languages and Programming , vol. 6198 , Springer Berlin Heidelberg , 2010 , pp. 238 -- 249 . R. M. Jim\u00e9nez and C. Mart\u00ednez, \"Interval Sorting,\" in Automata, Languages and Programming, vol. 6198, Springer Berlin Heidelberg, 2010, pp. 238--249."},{"key":"e_1_3_2_1_13_1","first-page":"348","volume-title":"Interval Tree,\" in Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest and C. Stein , \" Interval Tree,\" in Introduction to Algorithms , 3 rd ed., Cambridge, Massachusetts : The MIT Press , 2009 , pp. 348 -- 354 . T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, \"Interval Tree,\" in Introduction to Algorithms, 3rd ed., Cambridge, Massachusetts: The MIT Press, 2009, pp. 348--354.","edition":"3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_18"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.04.001"},{"key":"e_1_3_2_1_16_1","unstructured":"H. N. Gabow \"Data structures for weighted matching and nearest common ancestors with linking \" in Proceeding of the first annual ACM-SIAM symposium on Discrete algorithms Philadelphia PA 1990.   H. N. Gabow \"Data structures for weighted matching and nearest common ancestors with linking \" in Proceeding of the first annual ACM-SIAM symposium on Discrete algorithms Philadelphia PA 1990."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212444"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2004.10.012"}],"event":{"name":"RACS '15: International Conference on Research in Adaptive and Convergent Systems","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing","ACCT Association of Convergent Computing Technology"],"location":"Prague Czech Republic","acronym":"RACS '15"},"container-title":["Proceedings of the 2015 Conference on research in adaptive and convergent systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2811411.2811474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2811411.2811474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:49Z","timestamp":1750225729000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2811411.2811474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,9]]},"references-count":18,"alternative-id":["10.1145\/2811411.2811474","10.1145\/2811411"],"URL":"https:\/\/doi.org\/10.1145\/2811411.2811474","relation":{},"subject":[],"published":{"date-parts":[[2015,10,9]]},"assertion":[{"value":"2015-10-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}