{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:34Z","timestamp":1750306954418,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,15]],"date-time":"2013-09-15T00:00:00Z","timestamp":1379203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["TIN2007-60625, CSD2007-00050"],"award-info":[{"award-number":["TIN2007-60625, CSD2007-00050"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,15]]},"DOI":"10.1145\/2488551.2488579","type":"proceedings-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T06:54:53Z","timestamp":1378882493000},"page":"211-216","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficient parallel construction of suffix trees for genomes larger than main memory"],"prefix":"10.1145","author":[{"given":"Matteo","family":"Comin","sequence":"first","affiliation":[{"name":"University of Padova, Italy"}]},{"given":"Montse","family":"Farreras","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center, Barcelona, Spain"}]}],"member":"320","published-online":{"date-parts":[[2013,9,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Bsc: Barcelona supercomputing center marenostrum system architecture. http:\/\/www.bsc.es.  Bsc: Barcelona supercomputing center marenostrum system architecture. http:\/\/www.bsc.es."},{"key":"e_1_3_2_1_2_1","unstructured":"Complete human genome from ncbi public collections of dna and rna sequences. ftp:\/\/ftp.ncbi.nlm.nih.gov\/genomes\/H_sapiens\/Assembled_chromosomes\/.  Complete human genome from ncbi public collections of dna and rna sequences. ftp:\/\/ftp.ncbi.nlm.nih.gov\/genomes\/H_sapiens\/Assembled_chromosomes\/."},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/11889342_51","volume-title":"General Theory of Information Transfer and Combinatorics","author":"Apostolico A.","year":"2006","unstructured":"A. Apostolico , M. Comin , and L. Parida . Bridging lossy and lossless compression by motif pattern discovery . In General Theory of Information Transfer and Combinatorics , Lecture Notes in Computer Science , volume 4123 , pages 793 -- 813 , 2006 . A. Apostolico, M. Comin, and L. Parida. Bridging lossy and lossless compression by motif pattern discovery. In General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, volume 4123, pages 793--813, 2006."},{"key":"e_1_3_2_1_4_1","volume-title":"Mining, compressing and classifying with extensible motifs. Algorithms for Molecular Biology, 1(4)","author":"Apostolico A.","year":"2006","unstructured":"A. Apostolico , M. Comin , and L. Parida . Mining, compressing and classifying with extensible motifs. Algorithms for Molecular Biology, 1(4) , 2006 . A. Apostolico, M. Comin, and L. Parida. Mining, compressing and classifying with extensible motifs. Algorithms for Molecular Biology, 1(4), 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2008.123"},{"key":"e_1_3_2_1_6_1","volume-title":"Parallel construction of a suffix tree with applications. Algorithmica, 1(4)","author":"Apostolico A.","year":"1988","unstructured":"A. Apostolico , C. Iliopulos , G. Landau , B. Schieber , and U. Vishkin . Parallel construction of a suffix tree with applications. Algorithmica, 1(4) , 1988 . A. Apostolico, C. Iliopulos, G. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 1(4), 1988."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.11.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/9781860947995_0006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.017"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2010.0171"},{"key":"e_1_3_2_1_11_1","volume-title":"Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms for Molecular Biology, 7(34)","author":"Comin M.","year":"2012","unstructured":"M. Comin and D. Verzotto . Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms for Molecular Biology, 7(34) , 2012 . M. Comin and D. Verzotto. Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms for Molecular Biology, 7(34), 2012."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.2012.10"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355547"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654122"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195162"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200064"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/29.22.4633"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.017"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047490"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_23_1","first-page":"910","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 , pages 910 -- 921 , 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, pages 910--921, 2003."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247572"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316695"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0154-8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"}],"event":{"name":"EuroMPI '13: 20th European MPI Users's Group Meeting","sponsor":["ARCOS Computer Architecture and Technology Area, Universidad Carlos III de Madrid","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"Madrid Spain","acronym":"EuroMPI '13"},"container-title":["Proceedings of the 20th European MPI Users' Group Meeting"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488551.2488579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488551.2488579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:04Z","timestamp":1750235944000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488551.2488579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,15]]},"references-count":27,"alternative-id":["10.1145\/2488551.2488579","10.1145\/2488551"],"URL":"https:\/\/doi.org\/10.1145\/2488551.2488579","relation":{},"subject":[],"published":{"date-parts":[[2013,9,15]]},"assertion":[{"value":"2013-09-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}