{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:52:15Z","timestamp":1725511935811},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712329"},{"type":"electronic","value":"9783540712336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71233-6_36","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T00:31:34Z","timestamp":1179707494000},"page":"464-479","source":"Crossref","is-referenced-by-count":3,"title":["Efficient and Scalable Indexing Techniques for Biological Sequence Data"],"prefix":"10.1007","author":[{"given":"Mihail","family":"Halachev","sequence":"first","affiliation":[]},{"given":"Nematollaah","family":"Shiri","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Thamildurai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing Suffix Trees with Enhanced Suffix Arrays. Journal of Discrete Algorithms\u00a02, 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic Local Alignment Search Tool. J. Mol. Biol.\u00a0215, 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S.F. Altschul","year":"1997","unstructured":"Altschul, S.F., Madden, T.L., Schaffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research\u00a025, 3389\u20133402 (1997)","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"36_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/spe.4380250203","volume":"25","author":"A. Andersson","year":"1995","unstructured":"Andersson, A., Nilsson, S.: Efficient Implementation of Suffix Trees. Softw. Pract. Exp.\u00a025(2), 129\u2013141 (1995)","journal-title":"Softw. Pract. Exp."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/299432.299460","volume-title":"RECOMB","author":"S. Burkhardt","year":"1999","unstructured":"Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.P., Rivals, E., Vingron, M.: q-gram Based Database Searching Using a Suffix Array. In: RECOMB, pp. 77\u201383. ACM Press, New York (1999)"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-001-0051-5","volume":"32","author":"A. Crauser","year":"2002","unstructured":"Crauser, A., Ferragina, P.: A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. Algorithmica\u00a032(1), 1\u201335 (2002)","journal-title":"Algorithmica"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A.L. Delcher","year":"1999","unstructured":"Delcher, A.L., Kasif, S., Fleischmann, R.D., Peterson, J., White, O., Salzberg, S.L.: Alignment of Whole Genomes. Nucleic Acids Research\u00a027, 2369\u20132376 (1999)","journal-title":"Nucleic Acids Research"},{"unstructured":"Dementiev, R., K\u00e4rkk\u00e4inen, J., Mehnert, J., Sanders, P.: Better External Memory Suffix Array Construction. In: Proc. 7th Workshop Algorithm Engineering and Experiments, (2005)","key":"36_CR8"},{"unstructured":"ExPASy Server, http:\/\/us.expasy.org\/","key":"36_CR9"},{"issue":"2","key":"36_CR10","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 Searching in External Memory and its Applications. Journal of the ACM\u00a046(2), 236\u2013280 (1999)","journal-title":"Journal of the ACM"},{"unstructured":"GenBank, http:\/\/www.ncbi.nlm.nih.gov\/Genbank\/index.html","key":"36_CR11"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1002\/spe.535","volume":"33","author":"R. Giegerich","year":"2003","unstructured":"Giegerich, R., Kurtz, S., Stoye, J.: Efficient Implementation of Lazy Suffix Trees. Softw. Pract. Exper.\u00a033, 1035\u20131049 (2003)","journal-title":"Softw. Pract. Exper."},{"key":"36_CR13","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, Cambridge (1997)"},{"key":"36_CR14","volume-title":"Proc. of 14th ACM Conference on Information and Knowledge Management (CIKM), Bremen, Germany","author":"M. Halachev","year":"2005","unstructured":"Halachev, M., Shiri, N., Thamildurai, A.: Exact Match Search in Sequence Data using Suffix Trees. In: Proc. of 14th ACM Conference on Information and Knowledge Management (CIKM), Bremen, Germany, ACM Press, New York (2005)"},{"issue":"3","key":"36_CR15","first-page":"139","volume":"7","author":"E. Hunt","year":"2001","unstructured":"Hunt, E., Atkinson, M.P., Irving, R.W.: A Database Index to Large Biological Sequences. VLDB J.\u00a07(3), 139\u2013148 (2001)","journal-title":"VLDB J."},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/342009.335434","volume-title":"ACM SIGMOD Conference on Management of Data","author":"H.V. Jagadish","year":"2000","unstructured":"Jagadish, H.V., Koudas, N., Srivastava, D.: On Effective Multi-dimensional Indexing for Strings. In: ACM SIGMOD Conference on Management of Data, pp. 403\u2013414. ACM Press, New York (2000)"},{"issue":"13","key":"36_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the Space Requirement of Suffix Trees. Software-Practice and Experience\u00a029(13), 49\u20131171 (1999)","journal-title":"Software-Practice and Experience"},{"unstructured":"Kurtz, S.: Vmatch: large scale sequence analysis software. http:\/\/www.vmatch.de\/","key":"36_CR18"},{"doi-asserted-by":"crossref","unstructured":"Kurtz, S., Schleiermacher, C.: REPuter: Fast Computation of Maximal Repeats in Complete Genomes. Bioinformatics, 426\u2013427 (1999)","key":"36_CR19","DOI":"10.1093\/bioinformatics\/15.5.426"},{"issue":"5","key":"36_CR20","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 J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"36_CR21","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(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Morgante, M., Policriti, A., Vitacolonna, N., Zuccolo, A.: Structured Motifs Search. In: Proc. of RECOMB\u00a0\u201904 (2004)","key":"36_CR22","DOI":"10.1145\/974614.974632"},{"issue":"4","key":"36_CR23","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric. Journal of the ACM\u00a015(4), 514\u2013534 (1968)","journal-title":"Journal of the ACM"},{"issue":"1","key":"36_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"31","author":"G. Navarro","year":"2000","unstructured":"Navarro, G.: A Guided Tour to Approximate String Matching. ACM Computing Surveys\u00a031(1), 31\u201388 (2000)","journal-title":"ACM Computing Surveys"},{"doi-asserted-by":"crossref","unstructured":"Navarro, G., Baeza-Yates, R.: A Practical q-gram Index for Text Retrieval Allowing Errors. CLEI Electronic Journal\u00a01(2) (1998)","key":"36_CR25","DOI":"10.19153\/cleiej.1.2.3"},{"key":"36_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45123-4_29","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Sutinen, E., Tanninen, J., Tarhio, J.: Indexing Text with Approximate q-grams. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 350\u2013365. Springer, Heidelberg (2000)"},{"unstructured":"NCBI: National Center for Biotechnology Information, http:\/\/www.ncbi.nlm.nih.gov\/","key":"36_CR27"},{"unstructured":"Project Gutenberg, http:\/\/www.gutenberg.org","key":"36_CR28"},{"issue":"Issue 3","key":"36_CR29","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00778-005-0154-8","volume":"14","author":"Y. Tian","year":"2005","unstructured":"Tian, Y., Tata, S., Hankins, R.A., Patel, J.: Practical Methods for Constructing Suffix Trees. VLDB Journal\u00a014(Issue 3), 281\u2013299 (2005)","journal-title":"VLDB Journal"},{"key":"36_CR30","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"},{"doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithms. In: Proc. 14th Annual Symp. on Switching and Automata Theory (1973)","key":"36_CR31","DOI":"10.1109\/SWAT.1973.13"},{"key":"36_CR32","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, San Francisco (1999)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71233-6_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:17:28Z","timestamp":1605763048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71233-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712329","9783540712336"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71233-6_36","relation":{},"subject":[]}}