{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:19:48Z","timestamp":1759133988877},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549468_134","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"1227-1236","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Construction of Large Suffix Trees on a PC Cluster"],"prefix":"10.1007","author":[{"given":"Chunxi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertil","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"134_CR1","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. Software-Practice and Experience\u00a025(2), 129\u2013141 (1995)","journal-title":"Software-Practice and Experience"},{"key":"134_CR2","unstructured":"Brown, A.L.: Constructing Chromosome Scale Suffix Tree. In: The 2nd Asia-Pacific Bioinformatics Conference, New Zealand (2004)"},{"key":"134_CR3","unstructured":"Clifford, R., Sergot, M.: Distributed and Paged Suffix Trees for Large Genetic Databases. Journal of Discrete Algorithms (accepted)"},{"issue":"5","key":"134_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(96)00061-0","volume":"58","author":"L. Colussi","year":"1996","unstructured":"Colussi, L., De Col, A.: A time and space efficient data structure for string searching on large texts. Information Processing Letters\u00a058(5), 217\u2013222 (1996)","journal-title":"Information Processing Letters"},{"issue":"11","key":"134_CR5","doi-asserted-by":"publisher","first-page":"2478","DOI":"10.1093\/nar\/30.11.2478","volume":"30","author":"A.. Delcher","year":"2002","unstructured":"Delcher, A., Phillippy, A., Carlton, J., Salzberg, S.: Fast Algorithms for Large-scale Genome Alignment and Comparision. Nucleic Acids Research\u00a030(11), 2478\u20132483 (2002)","journal-title":"Nucleic Acids Research"},{"key":"134_CR6","unstructured":"Farach, M., Ferragina, P., Muthukrishnan, S.: Overcoming the Memory Bottleneck in Suffix Tree Construction. Proc. of IEEE Annual Symposium on Foundations of Computer Science (1998)"},{"issue":"2","key":"134_CR7","doi-asserted-by":"publisher","first-page":"238","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 application. Journal of the ACM\u00a046(2), 238\u2013280 (1999)","journal-title":"Journal of the ACM"},{"key":"134_CR8","doi-asserted-by":"publisher","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)"},{"issue":"3","key":"134_CR9","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. The VLDB J.\u00a07(3), 139\u2013148 (2001)","journal-title":"The VLDB J."},{"key":"134_CR10","unstructured":"Irving, R.W.: Suffix Binary Search Trees, Research Report, Department of Computer Science, University of Glasgow (1996)"},{"key":"134_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"New Horizons in Information Management","author":"R. Japp","year":"2003","unstructured":"Japp, R.: Persistent Indexes for Data intensive applications. In: James, A., Younas, M., Lings, B. (eds.) BNCOD 2003. LNCS, vol.\u00a02712, Springer, Heidelberg (2003)"},{"key":"134_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-60044-2_43","volume-title":"Combinatorial Pattern Matching","author":"J. K\u00e4rkk\u00e4inen","year":"1995","unstructured":"K\u00e4rkk\u00e4inen, J.: Suffix Cactus: A Cross Between Suffix Tree and Suffix Array. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 191\u2013204. Springer, Heidelberg (1995)"},{"key":"134_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4inen","year":"1996","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Sparse Suffix Tree. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, Springer, Heidelberg (1996)"},{"issue":"13","key":"134_CR14","doi-asserted-by":"publisher","first-page":"1149","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 Space Requirement of Suffix Trees. Software Practice and Experience\u00a029(13), 1149\u20131171 (1999)","journal-title":"Software Practice and Experience"},{"issue":"5","key":"134_CR15","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1093\/bioinformatics\/15.5.426","volume":"15","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S., Schleiermacher, C.: REPuter: Fast Computation of Maximal Repeats in Complete Genomes. Bioinformatics\u00a015(5), 426\u2013427 (1999)","journal-title":"Bioinformatics"},{"issue":"5","key":"134_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Sufix Arrays: A New Method for On-line String Searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"134_CR17","doi-asserted-by":"crossref","unstructured":"Meek, C., Patel, J.M., Kasetty, S.: OASIS: An Online and Accurate Technique for Localalignment Searches on Biological Sequences. In: VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50085-9"},{"issue":"4","key":"134_CR18","first-page":"19","volume":"24","author":"G. Navarro","year":"2001","unstructured":"Navarro, G., Baeza-Yates, R., Tariho, J.: Indexing Methods for Approximate String Matching. IEEE Data Engineering Bulletin\u00a024(4), 19\u201327 (2001)","journal-title":"IEEE Data Engineering Bulletin"},{"key":"134_CR19","doi-asserted-by":"crossref","unstructured":"Tata, S., Hankins, R.A., Patel, J.M.: Practical Sufix Tree Construction. In: proceedings of the 30th VLDB Conference, Toronto (2004)","DOI":"10.1016\/B978-012088469-8.50007-3"},{"key":"134_CR20","unstructured":"The Growth of GenBank, NCBI (2004), \n                    \n                      http:\/\/www.ncbi.nlm.nih.gov\/genbank\/"},{"key":"134_CR21","unstructured":"MPICH project: \n                    \n                      http:\/\/www-unix.mcs.anl.gov\/mpi\/mpich\/"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:14:20Z","timestamp":1587341660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11549468_134","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}