{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:35:11Z","timestamp":1765960511089,"version":"3.32.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s00778-005-0154-8","type":"journal-article","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T01:03:31Z","timestamp":1127783011000},"page":"281-299","source":"Crossref","is-referenced-by-count":60,"title":["Practical methods for constructing suffix trees"],"prefix":"10.1007","volume":"14","author":[{"given":"Yuanyuan","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Tata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard A.","family":"Hankins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jignesh M.","family":"Patel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"154_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2, 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"154_CR2","doi-asserted-by":"crossref","unstructured":"Aluru, S.: Suffix Trees and Suffix Arrays, Handbook of Data Structures and Applications. CRC Press (2004)","DOI":"10.1201\/9781420035179.ch29"},{"issue":"2","key":"154_CR3","first-page":"129","volume":"25","author":"A. Andersson","year":"1995","unstructured":"Andersson, A., Nilsson, S.: Efficient implementation of suffix trees. Software: Pract Exp. 25(2), 129\u2013141 (1995)","journal-title":"Software: Pract Exp."},{"issue":"3","key":"154_CR4","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/0196-6774(92)90049-I","volume":"13","author":"A. Apostolico","year":"1992","unstructured":"Apostolico, A., Szpankowski, W.: Self-alignments in words and their applications. J. Algorithms 13(3), 446\u2013467 (1992)","journal-title":"J. Algorithms"},{"issue":"D","key":"154_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1093\/nar\/gkh131","volume":"32","author":"R. Apweiler","year":"2004","unstructured":"Apweiler, R., Bairoch, A., Wu, C.H., Barker, W., Boeckmann, B., Ferro, S., Gasteiger, E., Huang, H., Lopez, R., Magrane, M., Martin, M.J., Natale, D., O'Donovan, A.C., Redaschi, N., Yeh, L.L.: Uniprot: The universal protein knowledgebase. Nucl. Acids Res. 32(D), 115\u2013119 (2004)","journal-title":"Nucl. Acids Res."},{"key":"154_CR6","doi-asserted-by":"crossref","unstructured":"Atkinson, M., Jordan, M.: Providing orthogonal persistence for java. In Proceedings of the 12th European Conference on Object-Oriented Programming, pp. 383\u2013395 (1998)","DOI":"10.1007\/BFb0054100"},{"key":"154_CR7","doi-asserted-by":"crossref","unstructured":"Bedathur, S.J., Haritsa, J.R.: Engineering a fast online persistent suffix tree construction. In: Proceedings of the 20th International Conference on Data Engineering, pp. 720\u2013731 (2004)","DOI":"10.1109\/ICDE.2004.1320040"},{"key":"154_CR8","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 360\u2013369 (1997)"},{"issue":"1","key":"154_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(92)90270-K","volume":"24","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D.: Average sizes of suffix trees and DAWGs. Discrete Applied Mathematics 24(1), 37\u201345 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"154_CR10","doi-asserted-by":"crossref","unstructured":"Carvalho, A., Freitas, A., Oliveira, A., Sagot, M.-F.: A parallel algorithm for the extraction of structured motifs. In Proceedings of the 2004 ACM Symposium on Applied Computing, pp. 147\u2013153 (2004)","DOI":"10.1145\/967900.967932"},{"key":"154_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, L.-L., Cheung, D., Yiu, S.-M.: Approximate string matching in DNA sequences. In: Proceeings of the 8th International Conference on Database Systems for Advanced Applications, pp. 303\u2013310 (2003)","DOI":"10.1109\/DASFAA.2003.1192395"},{"issue":"1","key":"154_CR12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TKDE.2005.3","volume":"17","author":"C.-F. Cheung","year":"2005","unstructured":"Cheung, C.-F., Yu, J.X., Lu, H.: Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering 17(1), 90\u2013105 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"154_CR13","doi-asserted-by":"crossref","unstructured":"Clifford, R., Sergot, M.J.: Distributed and paged suffix trees for large genetic databases. In: Proceedings of 14th Annual Symposium on Combinatorial Pattern Matching, pp. 70\u201382, 2003.","DOI":"10.1007\/3-540-44888-8_6"},{"issue":"1","key":"154_CR14","doi-asserted-by":"crossref","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 and its applications. Algorithmica 32(1), 1\u201335 (2002)","journal-title":"Algorithmica"},{"key":"154_CR15","unstructured":"Deep-Shallow Suffix Array and BWT Construction Algorithms. http:\/\/www.mfn.unipmn.it\/~manzini\/lightweight\/."},{"issue":"11","key":"154_CR16","doi-asserted-by":"crossref","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A. Delcher","year":"1999","unstructured":"Delcher, A., Kasif, S., Fleischmann, R., Peterson, J., White, O., Salzberg, S.: Alignment of whole genomes. Nucleic Acids Res. 27(11), 2369\u20132376 (1999)","journal-title":"Nucleic Acids Res."},{"issue":"11","key":"154_CR17","doi-asserted-by":"crossref","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 Res. 30(11), 2478\u20132483 (2002)","journal-title":"Nucleic Acids Res."},{"key":"154_CR18","unstructured":"Dementiev, R., K\u00e4rkk\u00e4inen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. In: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (2005)"},{"issue":"1","key":"154_CR19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/0221005","volume":"21","author":"L. Devroye","year":"1992","unstructured":"Devroye, L., Szpankowski, W., Rais, B.: A note on the height of suffix trees. SIAM J. Comput. 21(1), 48\u201353 (1992)","journal-title":"SIAM J. Comput."},{"key":"154_CR20","unstructured":"External Memory Suffix Array Construction Project. http:\/\/i10www.ira.uka.de\/dementiev\/esuffix\/docu\/index.html."},{"key":"154_CR21","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 137\u2013143. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"6","key":"154_CR22","doi-asserted-by":"crossref","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 47(6), 987\u20131011 (2000)","journal-title":"Journal of The ACM"},{"key":"154_CR23","unstructured":"GenBank, NCBI, 2004. http:\/\/www.ncbi.nlm.nih.gov\/GenBank."},{"issue":"3","key":"154_CR24","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/PL00009177","volume":"19","author":"R. Giegerich","year":"1997","unstructured":"Giegerich, R., Kurtz, S.: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica 19(3), 331\u2013353 (1997)","journal-title":"Algorithmica"},{"issue":"11","key":"154_CR25","doi-asserted-by":"crossref","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. Soft. Pract. Exp. 33(11), 1035\u20131049 (2003)","journal-title":"Soft. Pract. Exp."},{"key":"154_CR26","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"154_CR27","unstructured":"Heumann, K., Mewes, H.-W.: The hashed position tree (HPT): A suffix tree variant for large data sets stored on slow mass storage devices. In: Proceedings of the 3rd South American Workshop on String Processing, pp. 101\u2013115 (1996)"},{"issue":"3","key":"154_CR28","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. 7(3), 139\u2013148 (2001)","journal-title":"The VLDB J."},{"key":"154_CR29","unstructured":"Intel Corporation. The IA-32 Intel Architecture Optimization Reference Manual. Intel (Order Number 248966) (2004)"},{"key":"154_CR30","unstructured":"Intel Corporation. The IA-32 Intel Architecture Software Developer's Manual: System Programming Guide, vol. 3. Intel (Order Number 253668) (2004)"},{"key":"154_CR31","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Proceedings of the 13th International Conference on Automata, Languages and Programming, pp. 943\u2013955 (2003)","DOI":"10.1007\/3-540-45061-0_73"},{"key":"154_CR32","doi-asserted-by":"crossref","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, pp. 181\u2013192 (2001)","DOI":"10.1007\/3-540-48194-X_17"},{"key":"154_CR33","doi-asserted-by":"crossref","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 186\u2013199 (June 2003)","DOI":"10.1007\/3-540-44888-8_14"},{"key":"154_CR34","doi-asserted-by":"crossref","unstructured":"Ko, P., Aluru, S.: Space efficient linear-time construction of suffix arrays. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 200\u2013210 (June 2003)","DOI":"10.1007\/3-540-44888-8_15"},{"issue":"13","key":"154_CR35","first-page":"1149","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing space requirement of suffix trees. Soft: Pract. Exp. 29(13), 1149\u20131171 (1999)","journal-title":"Soft: Pract. Exp."},{"key":"154_CR36","doi-asserted-by":"crossref","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","volume":"29","author":"S. Kurtz","year":"2001","unstructured":"Kurtz, S., Choudhuri, J.V., Ohlebusch, E., Schleiermacher, C., Stoye, J., Giegerich, R.: REPuter: The manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res. 29, 4633\u20134642 (2001)","journal-title":"Nucleic Acids Res."},{"key":"154_CR37","doi-asserted-by":"crossref","unstructured":"Kurtz, S., Phillippy, A., Delcher, A., Smoot, M., Shumway, M., Antonescu, C., Salzberg, S.: Versatile and open software for comparing large genomes. Genome Bio. 5(R12) (2004)","DOI":"10.1186\/gb-2004-5-2-r12"},{"key":"154_CR38","doi-asserted-by":"crossref","unstructured":"Manzini, G.: Two space saving tricks for linear time LCP array computation. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, pp. 372\u2013383 (2004)","DOI":"10.1007\/978-3-540-27810-8_32"},{"issue":"1","key":"154_CR39","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","volume":"40","author":"G. Manzini","year":"2004","unstructured":"Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica 40(1), 33\u201350 (2004)","journal-title":"Algorithmica"},{"issue":"2","key":"154_CR40","doi-asserted-by":"crossref","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 23(2), 262\u2013272 (1976)","journal-title":"Journal of The ACM"},{"key":"154_CR41","doi-asserted-by":"crossref","unstructured":"Meek, C., Patel, J.M., Kasetty, S.: Oasis: An online and accurate technique for local-alignment searches on biological sequences. In Proceedings of 29th International Conference on Very Large Data Bases, pp. 910\u2013921 (2003)","DOI":"10.1016\/B978-012722442-8\/50085-9"},{"issue":"4","key":"154_CR42","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 Eng. Bull. 24(4), 19\u201327 (2001)","journal-title":"IEEE Data Eng. Bull."},{"issue":"1","key":"154_CR43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1089\/153623103322006670","volume":"7","author":"J.M. Patel","year":"2003","unstructured":"Patel, J.M.: The role of declarative querying in bioinformatics. OMICS: J. Integr. Biol. 7(1), 89\u201392 (2003)","journal-title":"OMICS: J. Integr. Biol."},{"key":"154_CR44","unstructured":"Pettersson, M.: Perfctr: Linux performance montioring counters driver. http:\/\/user.it.uu.se\/~mikpe\/linux\/perfctr."},{"key":"154_CR45","unstructured":"Project Gutenberg. http:\/\/www.gutenberg.net."},{"key":"154_CR46","unstructured":"Schurmann, K.-B., Stoye, J.: Suffix-tree construction and storage with limited main memory. Technical Report 2003-06, Univeristy of Bielefeld, Germany (2003)"},{"key":"154_CR47","unstructured":"STXXL Library. http:\/\/i10www.ira.uka.de\/dementiev\/stxxl.shtml."},{"key":"154_CR48","doi-asserted-by":"crossref","unstructured":"Szpankowski, W.: Average-Case Analysis of Algorithms on Sequences. John Wiley and Sons (2001)","DOI":"10.1002\/9781118032770"},{"key":"154_CR49","doi-asserted-by":"crossref","unstructured":"Tata, S., Hankins, R.A., Patel, J.M.: Practical suffix tree construction. In: Proceedings of 30th International Conference on Very Large Data Bases, pp. 36\u201347 (2004)","DOI":"10.1016\/B978-012088469-8.50007-3"},{"key":"154_CR50","unstructured":"The Growth of GenBank, NCBI, 2004. http:\/\/www.ncbi.nlm.nih.gov\/Genbank\/genbankstats.html."},{"key":"154_CR51","unstructured":"The MUMmer Software. http:\/\/www.tigr.org\/software\/mummer\/."},{"key":"154_CR52","unstructured":"Ukkonen, E.: Constructing suffix-trees on-line in linear time. In Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture: Information Processing, pp. 484\u2013492 (1992)"},{"key":"154_CR53","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, M.: Algorithms for parallel memory: Two-level memories. Algorithmica 12, 110\u2013147 (1994)","journal-title":"Algorithmica"},{"key":"154_CR54","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In Proceedings of the 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"154_CR55","unstructured":"Yona, S., Tsadok, D.: ANSI C implementation of a suffix tree. http:\/\/cs.haifa.ac.il\/~shlomo\/suffix_tree."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0154-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-005-0154-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0154-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:27:43Z","timestamp":1736004463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-005-0154-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s00778-005-0154-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}