{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:10Z","timestamp":1759637770564,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"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":[[2008,6,9]]},"DOI":"10.1145\/1376616.1376683","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"661-672","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Improving suffix array locality for fast pattern matching on disk"],"prefix":"10.1145","author":[{"given":"Ranjan","family":"Sinha","sequence":"first","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Puglisi","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Turpin","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00065-0"},{"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","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words, NATO ASI Series F12","author":"Apostolico A.","year":"1985","unstructured":"A. Apostolico . The myriad virtues of subword trees . In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, NATO ASI Series F12 , pages 85 -- 96 . Springer Verlag , Berlin, Germany , 1985 . A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, NATO ASI Series F12, pages 85--96. Springer Verlag, Berlin, Germany, 1985."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(96)00025-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/21.13.2963"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkl986"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.32"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0051-5"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1402296"},{"volume-title":"Ensembl Genome Browser","year":"2006","key":"e_1_3_2_1_12_1","unstructured":"Ensembl. Ensembl Genome Browser , 2006 . http:\/\/www.ensembl.org. Ensembl. Ensembl Genome Browser, 2006. http:\/\/www.ensembl.org."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/262228"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(94)00047-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/647820.736222"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199911)29:13%3C1149::AID-SPE274%3E3.0.CO;2-O"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_1_18_1","first-page":"16","volume-title":"Proc. Australasian Workshop on Combinatorial Algorithms","author":"Maniscalco M. A.","year":"2006","unstructured":"M. A. Maniscalco and S. J. Puglisi . Faster lightweight suffix array construction. In J. Ryan and Dafik, editors , Proc. Australasian Workshop on Combinatorial Algorithms , pages 16 -- 29 , 2006 . M. A. Maniscalco and S. J. Puglisi. Faster lightweight suffix array construction. In J. Ryan and Dafik, editors, Proc. Australasian Workshop on Combinatorial Algorithms, pages 16--29, 2006."},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/978-3-540-27810-8_32","volume-title":"Proceedings of 9th Scandinavian Workshop on Algorithm Theory (SWAT '04)","author":"Manzini G.","year":"2004","unstructured":"G. Manzini . Two space saving tricks for linear time LCP computation. In T. Hagerup and J. Katajainen, editors, Proceedings of 9th Scandinavian Workshop on Algorithm Theory (SWAT '04) , volume 3111 of Lecture Notes in Computer Science , pages 372 -- 383 . Springer Verlag, Berlin , Germany , 2004 . G. Manzini. Two space saving tricks for linear time LCP computation. In T. Hagerup and J. Katajainen, editors, Proceedings of 9th Scandinavian Workshop on Algorithm Theory (SWAT '04), volume 3111 of Lecture Notes in Computer Science, pages 372--383. Springer Verlag, Berlin, Germany, 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1094-1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247572"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242471.1242472"},{"key":"e_1_3_2_1_25_1","first-page":"139","volume-title":"Proc. Australasian Workshop on Combinatorial Algorithms","author":"Sim J. S.","year":"2003","unstructured":"J. S. Sim , D. K. Kim , H. Park , and K. Park . Linear-time search in suffix arrays. In M. Miller and K. Park, editors , Proc. Australasian Workshop on Combinatorial Algorithms , pages 139 -- 146 , Seoul, Korea , 2003 . J. S. Sim, D. K. Kim, H. Park, and K. Park. Linear-time search in suffix arrays. In M. Miller and K. Park, editors, Proc. Australasian Workshop on Combinatorial Algorithms, pages 139--146, Seoul, Korea, 2003."},{"key":"e_1_3_2_1_26_1","volume-title":"Computing Patterns in Strings","author":"Smyth B.","year":"2003","unstructured":"B. Smyth . Computing Patterns in Strings . Addison-Wesley , Reading, Massachusetts, USA , 2003 . B. Smyth. Computing Patterns in Strings. Addison-Wesley, Reading, Massachusetts, USA, 2003."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0154-8"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90031-X"},{"key":"e_1_3_2_1_30_1","first-page":"1","volume-title":"Annual Symposium on Foundations of Computer Science","author":"Weiner P.","year":"1973","unstructured":"P. Weiner . Linear pattern matching algorithms. In Proc . Annual Symposium on Foundations of Computer Science , pages 1 -- 11 , Silver Spring, MD , USA, 1973 . IEEE Computer Society Press . P. Weiner. Linear pattern matching algorithms. In Proc. Annual Symposium on Foundations of Computer Science, pages 1--11, Silver Spring, MD, USA, 1973. IEEE Computer Society Press."}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08"},"container-title":["Proceedings of the 2008 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376683","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376616.1376683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:58:01Z","timestamp":1750255081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376616.1376683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":30,"alternative-id":["10.1145\/1376616.1376683","10.1145\/1376616"],"URL":"https:\/\/doi.org\/10.1145\/1376616.1376683","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}