{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:10Z","timestamp":1725490210783},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745525"},{"type":"electronic","value":"9783540745532"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74553-2_25","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T03:07:48Z","timestamp":1187838468000},"page":"272-282","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Identifying the Most Contributory Substring"],"prefix":"10.1007","author":[{"given":"Ben","family":"Stephenson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/0196-6774(92)90049-I","volume":"13","author":"A. Apostolico","year":"1992","unstructured":"Apostolico, A., Szpankowski, W.: Self-alignments in words and their applications. J. Algorithms\u00a013(3), 446\u2013467 (1992)","journal-title":"J. Algorithms"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/0221005","volume":"21","author":"L. Devroye","year":"1992","unstructured":"Devroye, L., Szpankowski, W., Rais, B.: A note on the height of suffix trees. SIAM J. Comput.\u00a021(1), 48\u201353 (1992)","journal-title":"SIAM J. Comput."},{"key":"25_CR3","first-page":"137","volume-title":"FOCS 1997","author":"M. Farach","year":"1997","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS 1997. Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, 1997, p. 137. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"25_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York, NY, USA (1997)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Jacquet, P., Szpankowski, W.: Autocorrelation on words and its applications: Analysis of suffix trees by string-ruler approach. JCTA: Journal of Combinatorial Theory, Series A, 66 (1994)","DOI":"10.1016\/0097-3165(94)90065-5"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"25_CR7","first-page":"484","volume-title":"Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing 1992","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Constructing suffix trees on-line in linear time. In: Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing 1992, vol.\u00a01, pp. 484\u2013492. North-Holland, Amsterdam (1992)"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SWAT.1973.13","volume-title":"Proceedings of the 14th IEEE Symp on Switching and Automata Theory","author":"P. Weiner","year":"1973","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th IEEE Symp on Switching and Automata Theory, pp. 1\u201311. IEEE Computer Society Press, Los Alamitos (1973)"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74553-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:05Z","timestamp":1619519045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74553-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745525","9783540745532"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74553-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}