{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:11:57Z","timestamp":1761487917056,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1247480.1247572","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"833-844","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Genome-scale disk-based suffix tree indexing"],"prefix":"10.1145","author":[{"given":"Benjarath","family":"Phoophakdee","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY"}]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, NY"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"20th Int'l Conference on Data Engineering","author":"Bedathur S.","year":"2004","unstructured":"S. Bedathur and J. Haritsa . Engineering a fast online persistent suffix tree construction . In 20th Int'l Conference on Data Engineering , 2004 . S. Bedathur and J. Haritsa. Engineering a fast online persistent suffix tree construction. In 20th Int'l Conference on Data Engineering, 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.789803"},{"key":"e_1_3_2_1_4_1","volume-title":"2nd Asia-Pacific Bioinformatics Conference","author":"Brown A.","year":"2004","unstructured":"A. Brown . Constructing genome scale suffix trees . In 2nd Asia-Pacific Bioinformatics Conference , 2004 . A. Brown. Constructing genome scale suffix trees. In 2nd Asia-Pacific Bioinformatics Conference, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/967900.967932"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185431"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756553.1756559"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0051-5"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/30.11.2478"},{"key":"e_1_3_2_1_11_1","volume-title":"Workshop on Algorithm Engineering and Experiments","author":"Dementiev R.","year":"2005","unstructured":"R. Dementiev , J. K\u00e4rkk\u00e4inen , J. Mehnert , and P. Sanders . Better external memory suffix array construction . In Workshop on Algorithm Engineering and Experiments , 2005 . R. Dementiev, J. K\u00e4rkk\u00e4inen, J. Mehnert, and P. Sanders. Better external memory suffix array construction. In Workshop on Algorithm Engineering and Experiments, 2005."},{"key":"e_1_3_2_1_12_1","volume-title":"39th Annual Symposium on Foundations of Computer Science","author":"Farach-Colton M.","year":"1997","unstructured":"M. Farach-Colton . Optimal suffix tree construction with large alphabets . In 39th Annual Symposium on Foundations of Computer Science , 1997 . M. Farach-Colton. Optimal suffix tree construction with large alphabets. In 39th Annual Symposium on Foundations of Computer Science, 1997."},{"key":"e_1_3_2_1_13_1","volume-title":"39th Annual Symp. 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 39th Annual Symp. on Foundations of Computer Science , 1998 . M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. In 39th Annual Symp. on Foundations of Computer Science, 1998."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355547"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301973"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.535"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/270563.571472"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/792771.793872"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.03.004"},{"key":"e_1_3_2_1_20_1","volume-title":"3rd South American Workshop on String Processing","author":"Heumann K.","year":"1996","unstructured":"K. Heumann and H. W. Mewes . The hashed position tree (HPT): A suffix tree variant for large data sets stored on slow mass storage devices . In 3rd South American Workshop on String Processing , 1996 . K. Heumann and H. W. Mewes. The hashed position tree (HPT): A suffix tree variant for large data sets stored on slow mass storage devices. In 3rd South American Workshop on String Processing, 1996."},{"key":"e_1_3_2_1_21_1","volume-title":"Efficient multiple genome alignment. Bioinformatics, 18(supplement 1):312--320","author":"H\u00f6hl M.","year":"2002","unstructured":"M. H\u00f6hl , S. Kurtz , and E. Ohlebusch . Efficient multiple genome alignment. Bioinformatics, 18(supplement 1):312--320 , 2002 . M. H\u00f6hl, S. Kurtz, and E. Ohlebusch. Efficient multiple genome alignment. Bioinformatics, 18(supplement 1):312--320, 2002."},{"key":"e_1_3_2_1_22_1","volume-title":"27th Int'l Conference on Very Large Data Bases","author":"Hunt E.","year":"2001","unstructured":"E. Hunt , M. Atkinson , and R. Irving . A database index to large biological sequences . In 27th Int'l Conference on Very Large Data Bases , 2001 . E. Hunt, M. Atkinson, and R. Irving. A database index to large biological sequences. In 27th Int'l Conference on Very Large Data Bases, 2001."},{"key":"e_1_3_2_1_23_1","volume-title":"Bioinformatics Workshop, 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 seqeuences . In Bioinformatics Workshop, 21st Annual British National Conference On Databases , 2004 . R. Japp. The top-compressed suffix tree: A disk-resident index for large seqeuences. In Bioinformatics Workshop, 21st Annual British National Conference On Databases, 2004."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_25_1","volume-title":"http:\/\/www.nlm.nih.gov\/news\/press_releases\/dna_rna_100_gig.html","author":"NCBI.","year":"2005","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 , 2005 . NCBI. Public collections of dna and rna sequence reach 100 gigabases. http:\/\/www.nlm.nih.gov\/news\/press_releases\/dna_rna_100_gig.html, 2005."},{"key":"e_1_3_2_1_27_1","volume-title":"30th Int'l Conference on Very Large Data Bases","author":"Tata S.","year":"2004","unstructured":"S. Tata , R. Hankins , and J. Patel . Practical suffix tree construction . In 30th Int'l Conference on Very Large Data Bases , 2004 . S. Tata, R. Hankins, and J. Patel. Practical suffix tree construction. In 30th Int'l Conference on Very Large Data Bases, 2004."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0154-8"},{"key":"e_1_3_2_1_29_1","volume-title":"On-line construction of suffix trees. Algorithmica, 14(3)","author":"Ukkonen E.","year":"1995","unstructured":"E. Ukkonen . On-line construction of suffix trees. Algorithmica, 14(3) , 1995 . E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3), 1995."},{"key":"e_1_3_2_1_30_1","volume-title":"2nd Annual Int'l Conference on Computing and Combinatorics","author":"Ukkonen E.","year":"1996","unstructured":"E. Ukkonen and J. K\u00e4rkk\u00e4inen . Sparse suffix trees . In 2nd Annual Int'l Conference on Computing and Combinatorics , 1996 . E. Ukkonen and J. K\u00e4rkk\u00e4inen. Sparse suffix trees. In 2nd Annual Int'l Conference on Computing and Combinatorics, 1996."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"}],"event":{"name":"SIGMOD\/PODS07: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Beijing China","acronym":"SIGMOD\/PODS07"},"container-title":["Proceedings of the 2007 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1247480.1247572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:46Z","timestamp":1750258306000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":30,"alternative-id":["10.1145\/1247480.1247572","10.1145\/1247480"],"URL":"https:\/\/doi.org\/10.1145\/1247480.1247572","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}