{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:48:04Z","timestamp":1725475684273},"publisher-location":"Boston, MA","reference-count":11,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387346335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-34735-6_11","type":"book-chapter","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T13:32:32Z","timestamp":1166103152000},"page":"91-102","source":"Crossref","is-referenced-by-count":0,"title":["BuST-Bundled Suffix Trees"],"prefix":"10.1007","author":[{"given":"Luca","family":"Bortolussi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Fabris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3\u20134","key":"11_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1089\/10665270360688020","volume":"7","author":"A. Apostolico","year":"2003","unstructured":"A. Apostolico, M. E. Block, and Lonardi. Monotony of surprise and large-scale quest for unusual words. Journal of Computational Biology, 7(3\u20134):283\u2013313, 2003.","journal-title":"Journal of Computational Biology"},{"issue":"1\u20132","key":"11_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1089\/10665270050081397","volume":"7","author":"A. Apostolico","year":"2000","unstructured":"A. Apostolico, M. E. Block, S. Lonardi, and X. Xu. Efficient detection of unusual words. Journal of Computational Biology, 7(1\u20132):71\u201394, 2000.","journal-title":"Journal of Computational Biology"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"A. Apostolico and C. Pizzi. Monotone scoring of patterns with mismatches. In Proceedings of WABI 2004, 2004.","DOI":"10.1007\/978-3-540-30219-3_8"},{"key":"11_CR4","unstructured":"L. Bortolussi, F. Fabris, and A. Policriti. Bundled suffix trees. Technical report, Dept. of Maths and Informatics, University of Udine, 2006. http:\/\/www. dimi. uniud, it\/bortolus\/techrep, htm."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"R. Cole, L. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don\u2019t cares. In Proceedings of STOC 2004, pages 91\u2013100, 2004.","DOI":"10.1145\/1007352.1007374"},{"key":"11_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Trees, Strings and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Trees, Strings and Sequences: Computer Science and Computational Biology. Cambridge University Press, London, 1997."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"L. Marsan and M. F. Sagot. Extracting structured motifs using a suffix tree-algorithms and application to promoter consensus identification. In Proceedings of RECOMB 2000, pages 210\u2013219, 2000.","DOI":"10.1145\/332306.332553"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31\u201388, 2001.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"11_CR9","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4):19\u201327, 2001.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1137\/0222070","volume":"22","author":"W. Szpankowski","year":"1993","unstructured":"W. Szpankowski. A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM J. Computing, 22:1176\u20131198, 1993.","journal-title":"SIAM J. Computing"},{"key":"11_CR11","first-page":"139","volume":"3","author":"W. Szpankowski","year":"2004","unstructured":"W. Szpankowski, P. Jacquet, and B. McVey. Compact suffix trees resemble patricia tries: Limiting distribution of depth. Journal of the Iranian Statistical Society, 3:139\u2013148, 2004.","journal-title":"Journal of the Iranian Statistical Society"}],"container-title":["IFIP International Federation for Information Processing","Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-34735-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:50:24Z","timestamp":1619560224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-34735-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387346335"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-34735-6_11","relation":{},"subject":[]}}