{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:40Z","timestamp":1759638940073,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T00:00:00Z","timestamp":1246233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,29]]},"DOI":"10.1145\/1559845.1559931","type":"proceedings-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:34:19Z","timestamp":1247074459000},"page":"827-840","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Serial and parallel methods for i\/o efficient suffix tree construction"],"prefix":"10.1145","author":[{"given":"Amol","family":"Ghoting","sequence":"first","affiliation":[{"name":"IBM T. J. Watson Research Center, Yorktown Heights, NY, USA"}]},{"given":"Konstantin","family":"Makarychev","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Yorktown Heights, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,29]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/977401.978137"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/11602569_8"},{"key":"e_1_3_2_1_3_1","volume-title":"AVID:A global alignment program. Genome Research 13(1)","author":"Bray N.","year":"2003","unstructured":"N. Bray , I. Dubchak , and L. Pachter . AVID:A global alignment program. Genome Research 13(1) , 2003 . N. Bray, I. Dubchak, and L. Pachter. AVID:A global alignment program. Genome Research 13(1), 2003."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the Asia-Pacific Bioinformatics Conference","author":"Brown A.","year":"2004","unstructured":"A. Brown . Constructing genome scale suffix trees . In Proceedings of the Asia-Pacific Bioinformatics Conference 2004 . A. Brown. Constructing genome scale suffix trees. In Proceedings of the Asia-Pacific Bioinformatics Conference 2004."},{"key":"e_1_3_2_1_5_1","volume-title":"A block sorting lossless data compression algorithm. Technical report","author":"Burrows M.","year":"1994","unstructured":"M. Burrows and D. Wheeler . A block sorting lossless data compression algorithm. Technical report , Digital Equipment Corporation , 1994 . M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/978-3-540-30213-1_37"},{"key":"e_1_3_2_1_7_1","volume-title":"Sublinear approximate string matching and biological applications. Algorithmica 12(4\/5)","author":"Chang W.","year":"1994","unstructured":"W. Chang and E. Lawler . Sublinear approximate string matching and biological applications. Algorithmica 12(4\/5) , 1994 . W. Chang and E. Lawler. Sublinear approximate string matching and biological applications. Algorithmica 12(4\/5), 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/TKDE.2005.3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.5555\/1756553.1756559"},{"key":"e_1_3_2_1_10_1","volume-title":"Alignment of whole genomes. Nucleic Acids Res. 27(11)","author":"Delcher A.","year":"1999","unstructured":"A. Delcher , S. Kasif , R. Fleischmann , J. Peterson , O. White , and S. Salzberg . Alignment of whole genomes. Nucleic Acids Res. 27(11) , 1999 . A. Delcher, S. Kasif, R. Fleischmann, J. Peterson, O. White, and S. Salzberg. Alignment of whole genomes. Nucleic Acids Res. 27(11), 1999."},{"key":"e_1_3_2_1_11_1","volume-title":"Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res. 30(1)","author":"Delcher A.","year":"2002","unstructured":"A. Delcher , A. Phillippy , J. Carlton , and S. Salzberg . Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res. 30(1) , 2002 . A. Delcher, A. Phillippy, J. Carlton, and S. Salzberg. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res. 30(1), 2002."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the Annual Symposium on Foundations of Computer Science","author":"Farach-Colton M.","year":"1998","unstructured":"M. Farach-Colton , P. Ferragina , and S. Muthukrishnan . Overcoming the memory bottleneck in suffix tree construction . In Proceedings of the Annual Symposium on Foundations of Computer Science 1998 . M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. In Proceedings of the Annual Symposium on Foundations of Computer Science 1998."},{"key":"e_1_3_2_1_13_1","volume-title":"Algorithms on strings, trees, and sequences: Computer science and computational biology Cambridge University Press","author":"D.","year":"1997","unstructured":"D. Gus field. Algorithms on strings, trees, and sequences: Computer science and computational biology Cambridge University Press , Cambridge , 1997 . D. Gus field. Algorithms on strings, trees, and sequences: Computer science and computational biology Cambridge University Press, Cambridge, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1016\/j.jcss.2004.03.004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/645927.672030"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the Bioinformatics Workshop at the 21st Annual British National Conference on Databases","author":"Japp R.","year":"2004","unstructured":"R. Japp . The top-compressed suffix tree:A disk resident index for large sequences . In Proceedings of the Bioinformatics Workshop at the 21st Annual British National Conference on Databases 2004 . R. Japp. The top-compressed suffix tree:A disk resident index for large sequences. In Proceedings of the Bioinformatics Workshop at the 21st Annual British National Conference on Databases 2004."},{"key":"e_1_3_2_1_17_1","first-page":"29","author":"Kurtz S.","year":"2001","unstructured":"S. Kurtz , J. Choudhuri , E. Ohlebusch , C. Schleiermacher , J. Stoye , and R. Giegerich . Reputer: The manifold applications of repeat analysis on a genome scale. Nucleic Acids Res. 29 , 2001 . S. Kurtz, J. Choudhuri, E. Ohlebusch, C. Schleiermacher, J. Stoye, and R. Giegerich. Reputer: The manifold applications of repeat analysis on a genome scale. Nucleic Acids Res. 29, 2001.","journal-title":"Nucleic Acids Res."},{"key":"e_1_3_2_1_18_1","volume-title":"Versatile and open software for comparing large genomes. Genome Bio. 5(R12)","author":"Kurtz S.","year":"2004","unstructured":"S. Kurtz , A. Phillippy , A. Delcher , M. Smoot , M. Shumway , C. Antonescu , and S. Salzberg . Versatile and open software for comparing large genomes. Genome Bio. 5(R12) , 2004 . S. Kurtz, A. Phillippy, A. Delcher, M. Smoot, M. Shumway, C. Antonescu, and S. Salzberg. Versatile and open software for comparing large genomes. Genome Bio. 5(R12), 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of 29th International Conference on Very Large Databases","author":"Meek C.","year":"2003","unstructured":"C. Meek , J. Patel , and S. Kasetty . Oasis: An online and accurate technique for local-alignment searches on biological sequences . In Proceedings of 29th International Conference on Very Large Databases 2003 . C. Meek, J. Patel, and S. Kasetty. Oasis: An online and accurate technique for local-alignment searches on biological sequences. In Proceedings of 29th International Conference on Very Large Databases 2003."},{"unstructured":"NCBI. Public collections of dna and rna sequence reach 100 gigabases. http:\/\/www.nlm.nih.gov\/news\/press_releases\/dna_rna_100_gig.html.  NCBI. Public collections of dna and rna sequence reach 100 gigabases. http:\/\/www.nlm.nih.gov\/news\/press_releases\/dna_rna_100_gig.html.","key":"e_1_3_2_1_21_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1247480.1247572"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the Pacific Symposium on Biocomputing","author":"Phoophakdee B.","year":"2008","unstructured":"B. Phoophakdee and M. Zaki . Trellis+: An effective approach for indexing massive sequences . In Proceedings of the Pacific Symposium on Biocomputing 2008 . B. Phoophakdee and M. Zaki. Trellis+: An effective approach for indexing massive sequences. In Proceedings of the Pacific Symposium on Biocomputing 2008."},{"key":"e_1_3_2_1_24_1","volume-title":"Universitat Bielefeld","author":"Schurmann K.","year":"2003","unstructured":"K. Schurmann and J. Stoye . suffix tree construction and storage with limited main memory. Technical report , Universitat Bielefeld , 2003 . K. Schurmann and J. Stoye. suffix tree construction and storage with limited main memory. Technical report, Universitat Bielefeld, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1007\/s00778-005-0154-8"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the IFIP 12th Work Computer Congress on Algorithms","author":"Ukkonen E.","year":"1992","unstructured":"E. Ukkonen . Constructing suffix trees on-line in linear time . In Proceedings of the IFIP 12th Work Computer Congress on Algorithms , Software, Architecture: Information Processing 1992 . E. Ukkonen. Constructing suffix trees on-line in linear time. In Proceedings of the IFIP 12th Work Computer Congress on Algorithms, Software, Architecture: Information Processing 1992."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1109\/SWAT.1973.13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/ICDM.2007.61"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/290941.290956"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"acronym":"SIGMOD\/PODS '09","name":"SIGMOD\/PODS '09: International Conference on Management of Data","location":"Providence Rhode Island USA"},"container-title":["Proceedings of the 2009 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559931","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1559845.1559931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:12Z","timestamp":1750249092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1559845.1559931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,29]]},"references-count":29,"alternative-id":["10.1145\/1559845.1559931","10.1145\/1559845"],"URL":"https:\/\/doi.org\/10.1145\/1559845.1559931","relation":{},"subject":[],"published":{"date-parts":[[2009,6,29]]},"assertion":[{"value":"2009-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}