{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:54Z","timestamp":1750307454878,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T00:00:00Z","timestamp":1280707200000},"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":[[2010,8,2]]},"DOI":"10.1145\/1854776.1854792","type":"proceedings-article","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T15:48:28Z","timestamp":1283874508000},"page":"79-85","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An annotated\n            <i>k<\/i>\n            -deep prefix tree for (1-\n            <i>k<\/i>\n            )-mer based sequence comparisons"],"prefix":"10.1145","author":[{"given":"Adrienne","family":"Breland","sequence":"first","affiliation":[{"name":"University of Nevada, Reno, NV"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karen","family":"Schlauch","sequence":"additional","affiliation":[{"name":"University of Nevada, Reno, NV"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monica","family":"Nicolescu","sequence":"additional","affiliation":[{"name":"University of Nevada, Reno, NV"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Frederick C.","family":"Harris","sequence":"additional","affiliation":[{"name":"University of Nevada, Reno, NV"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,8,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"volume-title":"Proceedings of the IEEE International Parallel Distributed Processing Symposium(IPDPS'03)","author":"Arnau V.","key":"e_1_3_2_1_3_1","unstructured":"Arnau V. and Marin , M . 2003. A fast Algorithm for the Exhaustive Analysis of 12-Nucleoitde-Long DNA Sequences. Applications to Human Genomic . Proceedings of the IEEE International Parallel Distributed Processing Symposium(IPDPS'03) . Arnau V. and Marin, M. 2003. A fast Algorithm for the Exhaustive Analysis of 12-Nucleoitde-Long DNA Sequences. Applications to Human Genomic. Proceedings of the IEEE International Parallel Distributed Processing Symposium(IPDPS'03)."},{"volume-title":"Proceedings of the IEEE International Parallel and Distributed Processing Symposium.","author":"Arnau V.","key":"e_1_3_2_1_4_1","unstructured":"Arnau V. , Gallach M. , and Marin I . 2008. Fast comparison of DNA sequences by oligonucleotide profiling . Proceedings of the IEEE International Parallel and Distributed Processing Symposium. Arnau V., Gallach M., and Marin I. 2008. Fast comparison of DNA sequences by oligonucleotide profiling. Proceedings of the IEEE International Parallel and Distributed Processing Symposium."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1089\/10665270050081397"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the Twenty-Seventh Hawaii International Conference on 5, 35--44","author":"Bieganski P.","year":"1994","unstructured":"Bieganski , P. , Reidl , J. , Cartis , J., V. , Retzel , E. F. 1994 . Generalized suffix trees for biological sequence data: applications and implementation. in System SciencesV: Biotechnology Computing , Proceedings of the Twenty-Seventh Hawaii International Conference on 5, 35--44 . Bieganski, P., Reidl, J., Cartis, J., V., Retzel, E. F. 1994. Generalized suffix trees for biological sequence data: applications and implementation. in System SciencesV: Biotechnology Computing, Proceedings of the Twenty-Seventh Hawaii International Conference on 5, 35--44."},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Efficient Influenza A Virus Origin Detection","volume":"10","author":"Breland A.","year":"2008","unstructured":"Breland , A. , Nasser , S. , Schlauch , K. , Nicolescu , M. , Harris , F. C. Jr. 2008 . Efficient Influenza A Virus Origin Detection . Journal of Electronics and Computer Science 10 , 1 -- 8 . Breland, A., Nasser, S., Schlauch, K., Nicolescu, M., Harris, F. C. Jr. 2008. Efficient Influenza A Virus Origin Detection. Journal of Electronics and Computer Science 10, 1--8.","journal-title":"Journal of Electronics and Computer Science"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.9.11.1135"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/089120102760173652"},{"volume-title":"Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries 7, 229--233","author":"Hazelhurst S.","key":"e_1_3_2_1_10_1","unstructured":"Hazelhurst , S. 2004. An efficient implementation of the d2 distance function for EST clustering:preliminary investigations . Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries 7, 229--233 . Hazelhurst, S.2004. An efficient implementation of the d2 distance function for EST clustering:preliminary investigations. Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries 7, 229--233."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0000579"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.229202"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2005.04.003"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.194201"},{"key":"e_1_3_2_1_16_1","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou N","year":"1987","unstructured":"Saitou , N and Nei , M. 1987 . The neighbor-joining method: a new method for reconstructing phylogenetic trees . Mol. Bio. Evol. 4 , 406 -- 425 Saitou, N and Nei, M. 1987. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Bio. Evol. 4, 406--425","journal-title":"Mol. Bio. Evol."},{"volume-title":"SFI Studies in the sciences of complexity","author":"Torney D. C.","key":"e_1_3_2_1_17_1","unstructured":"Torney , D. C. , Burke , C. , Davidson , D. , Sirkin , K. M. 1990. Computation of d2:A measure of sequence dissimilarity, computers and DNA , SFI Studies in the sciences of complexity . Bell, G., Marr, T., editors, VII. New York, NY : Addison-Wesley . Torney, D. C., Burke, C., Davidson, D., Sirkin, K. M. 1990. Computation of d2:A measure of sequence dissimilarity, computers and DNA, SFI Studies in the sciences of complexity. Bell, G., Marr, T., editors, VII. New York, NY: Addison-Wesley."},{"volume-title":"Compression algorithms for real programmers","author":"Wayner P.","key":"e_1_3_2_1_18_1","unstructured":"Wayner P. 2000. Compression algorithms for real programmers . Morgan Kaufman Publishers Inc ., San Franciso, CA. Wayner P. 2000. Compression algorithms for real programmers. Morgan Kaufman Publishers Inc., San Franciso, CA."}],"event":{"name":"BCB'10: ACM International Conference on Bioinformatics and Computational Biology","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"location":"Niagara Falls New York","acronym":"BCB'10"},"container-title":["Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1854776.1854792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1854776.1854792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:12Z","timestamp":1750248492000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1854776.1854792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,2]]},"references-count":18,"alternative-id":["10.1145\/1854776.1854792","10.1145\/1854776"],"URL":"https:\/\/doi.org\/10.1145\/1854776.1854792","relation":{},"subject":[],"published":{"date-parts":[[2010,8,2]]},"assertion":[{"value":"2010-08-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}