{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T12:32:52Z","timestamp":1780489972701,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0304-3975(03)00142-7","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"341-364","source":"Crossref","is-referenced-by-count":4,"title":["Text sparsification via local maxima"],"prefix":"10.1016","volume":"304","author":[{"given":"Pilu","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto Del","family":"Lungo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elena","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianluca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00142-7_BIB1","unstructured":"A. Alstrup, G.S. Brodal, T. Rauhe, Pattern matching in dynamic texts, in: Proc. 11th ACM-SIAM Ann. Symp. on Discrete Algorithms, San Francisco, CA, 2000, pp. 819\u2013828."},{"key":"10.1016\/S0304-3975(03)00142-7_BIB2","doi-asserted-by":"crossref","unstructured":"S. Burkhardt, A. Crauser, H.P. Lenhof, P. Ferragina, E. Rivals, M. Vingron, Q-gram based database searching using a suffix array (QUASAR), in: Proc. Ann. Internat. Conf. on Computational Biology (RECOMB), 1999.","DOI":"10.1145\/299432.299460"},{"issue":"1","key":"10.1016\/S0304-3975(03)00142-7_BIB3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with applications to optimal parallel list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Information and Control"},{"key":"10.1016\/S0304-3975(03)00142-7_BIB4","unstructured":"G. Cormode, M. Paterson, S.C. Sahinalp, U. Vishkin, Communication complexity of document exchange, in: Proc. 11th ACM-SIAM Ann. Symp. on Discrete Algorithms, 2000."},{"key":"10.1016\/S0304-3975(03)00142-7_BIB5","doi-asserted-by":"crossref","unstructured":"P. Crescenzi, A. Del Lungo, R. Grossi, E. Lodi, L. Pagli, G. Rossi, Text sparsification via local maxima, in: Proc. 20th Conf. on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Computer Science, Vol. 1974, 2000, pp. 290\u2013301.","DOI":"10.1007\/3-540-44450-5_23"},{"key":"10.1016\/S0304-3975(03)00142-7_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(03)00142-7_BIB7","doi-asserted-by":"crossref","unstructured":"Juha K\u00e4rkk\u00e4inen, Esko Ukkonen, Sparse suffix trees, Lecture Notes in Computer Science, Vol. 1090, 1996, pp. 219\u2013230.","DOI":"10.1007\/3-540-61332-3_155"},{"issue":"5","key":"10.1016\/S0304-3975(03)00142-7_BIB8","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(03)00142-7_BIB9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02522825","article-title":"Maintaining dynamic sequences under equality tests in polylogarithmic time","volume":"17","author":"Mehlhorn","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(03)00142-7_BIB10","unstructured":"M. Nelson, J.-L. Gailly, The Data Compression Book, M&T Books, New York, 1996."},{"key":"10.1016\/S0304-3975(03)00142-7_BIB11","doi-asserted-by":"crossref","unstructured":"S.C. \u1e60ahinalp, U. Vishkin, Symmetry breaking for suffix tree construction (extended abstract), in: Proc. 26th Ann. ACM Symp. on the Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, 23\u201325 May 1994, pp. 300\u2013309.","DOI":"10.1145\/195058.195164"},{"key":"10.1016\/S0304-3975(03)00142-7_BIB12","doi-asserted-by":"crossref","unstructured":"S.C. \u1e60ahinalp, U. Vishkin, Efficient approximate and dynamic matching of patterns using a labeling paradigm (extended abstract). in: 37th Ann. Symp. on Foundations of Computer Science, IEEE, 14\u201316, October 1996, pp. 320\u2013328.","DOI":"10.1109\/SFCS.1996.548491"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001427?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001427?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T15:01:37Z","timestamp":1734015697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503001427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0304397503001427"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00142-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}