{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:47:30Z","timestamp":1725518850368},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_16","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T04:07:12Z","timestamp":1363320432000},"page":"165-176","source":"Crossref","is-referenced-by-count":1,"title":["Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Lazarow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Algorithmic Combinatorics on Partial Words","author":"F. Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press, Boca Raton (2008)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science\u00a040, 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the Association for Computing Machinery\u00a047, 987\u20131011 (2000)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013, 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing\u00a022, 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR9","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. Journal of the Association for Computing Machinery\u00a023, 262\u2013272 (1976)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"16_CR10","unstructured":"Smyth, W.F.: Computing Patterns in Strings. Pearson Addison-Wesley (2003)"},{"key":"16_CR11","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, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: 14th Annual IEEE Symposium on Switching and Automata Theory, SWAT 1973, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T15:27:36Z","timestamp":1557588456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}