{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T07:12:37Z","timestamp":1674198757264},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1007\/bf00292114","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T12:13:40Z","timestamp":1096978420000},"page":"461-474","source":"Crossref","is-referenced-by-count":10,"title":["Time optimal left to right construction of position trees"],"prefix":"10.1007","volume":"24","author":[{"given":"M.","family":"Kempf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Bayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"G\ufffdntzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley Reading 1974"},{"key":"CR2","unstructured":"Bayer, Rudolf: Datenstrukturen. Fernuniversit\u00e4t Hagen, Fachbereich Mathematik und Informatik 1981"},{"key":"CR3","unstructured":"G\u00fcntzer, Ulrich: Datenstrukturen und Datenorganisation. Vorlesung, Technische Universit\u00e4t M\u00fcnchen 1984"},{"key":"CR4","unstructured":"Kempf, Michael: Effiziente Links-Rechts-Konstruktion von Positionsb\u00e4umen. Diplomarbeit, Technische Universit\u00e4t M\u00fcnchen, Institut f\u00fcr Informatik 1984"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1137\/0209061","volume":"9","author":"Mila E. Majster","year":"1980","unstructured":"Majster, Mila E.; Reiser, Angelika: Efficient online construction and correction of position trees. SIAM J. Comput. 9, 785?807 (1980)","journal-title":"SIAM J. Comput."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"Edward M. McCreight","year":"1976","unstructured":"McCreight, Edward M.: A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach. 23, 262?272 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Weiner, Peter: Linear pattern matching algorithms. IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1?11 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292114.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00292114\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00292114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:16:25Z","timestamp":1554743785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00292114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["BF00292114"],"URL":"https:\/\/doi.org\/10.1007\/bf00292114","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}