{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:27Z","timestamp":1725544047502},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_8","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"72-83","source":"Crossref","is-referenced-by-count":6,"title":["Obtaining Provably Good Performance from Suffix Trees in Secondary Storage"],"prefix":"10.1007","author":[{"given":"Pang","family":"Ko","sequence":"first","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bedathur, S.J., Haritsa, J.R.: Engineering a fast online persistent suffix tree construction. In: Proc. 20th International Conference on Data Engineering, pp. 720\u2013731 (2004)","DOI":"10.1109\/ICDE.2004.1320040"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11602569_8","volume-title":"High Performance Computing \u2013 HiPC 2005","author":"S.J. Bedathur","year":"2005","unstructured":"Bedathur, S.J., Haritsa, J.R.: Search-optimized suffix-tree storage for biological applications. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds.) HiPC 2005. LNCS, vol.\u00a03769, pp. 29\u201339. Springer, Heidelberg (2005)"},{"key":"8_CR3","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 383\u2013391 (1996)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th Annual Symposium on Foundations of Computer Science, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"6","key":"8_CR5","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 ACM\u00a047(6), 987\u20131011 (2000)","journal-title":"Journal of the ACM"},{"key":"8_CR6","unstructured":"Ferragina, P., Grossi, R.: Fast string searching in secondary storage: theoretical developments and experimental results. In: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 373\u2013382 (1996)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The string B-tree: A new data structure for string search in external memory and its applications. Journal of the ACM\u00a046(2), 236\u2013280 (1999)","journal-title":"Journal of the ACM"},{"key":"8_CR8","unstructured":"Gonnet, G.H., Baeza-Yates, R.A., Snider, T.: Information Retrieval: Data Structures & Algorithms. In: New indices for text: PAT trees and PAT arrays, ch. 5, pp. 66\u201382 (1992)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s007780200064","volume":"11","author":"E. Hunt","year":"2002","unstructured":"Hunt, E., Atkinson, M.P., Irving, R.W.: Database indexing for large DNA and protein sequence collections. The VLDB Journal\u00a011(3), 256\u2013271 (2002)","journal-title":"The VLDB Journal"},{"key":"8_CR11","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 ACM\u00a023, 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Tata, S., Hankins, R.A., Patel, J.M.: Practical suffix tree construction. In: Proc. 13th International Conference on Very Large Data Bases, pp. 36\u201347 (2004)","DOI":"10.1016\/B978-012088469-8.50007-3"},{"key":"8_CR13","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"},{"issue":"2\/3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory I: Two-level memories. Algorithmica\u00a012(2\/3), 110\u2013147 (1994)","journal-title":"Algorithmica"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:23Z","timestamp":1619507783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11780441_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}