{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:45:28Z","timestamp":1768916728023,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T00:00:00Z","timestamp":1614297600000},"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":[[2021,2,26]]},"DOI":"10.1145\/3457682.3457704","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T21:53:38Z","timestamp":1624312418000},"page":"146-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Applying Neural Network to Reconstruction of Phylogenetic Tree"],"prefix":"10.1145","author":[{"given":"Tujin","family":"Zhu","sequence":"first","affiliation":[{"name":"Shenzhen Institute of Advanced Technology,Chinese Academy of Sciences and University of Chinese Academy of Sciences, China"}]},{"given":"Yunpeng","family":"Cai","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Advanced Technology,Chinese Academy of Sciences and University of Chinese Academy of Sciences, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics, 3(1). https:\/\/doi.org\/10.1016\/S0196-8858(82)80004-3","author":"Foulds L. R.","year":"1982","unstructured":"Foulds , L. R. , & Graham , R. L. ( 1982 ). The steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics, 3(1). https:\/\/doi.org\/10.1016\/S0196-8858(82)80004-3 Foulds, L. R., & Graham, R. L. (1982). The steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics, 3(1). https:\/\/doi.org\/10.1016\/S0196-8858(82)80004-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199602605.001.0001"},{"key":"e_1_3_2_1_3_1","volume-title":"Circular permutations and evolutionary trees. Advances in Applied Mathematics, 32(4). https:\/\/doi.org\/10.1016\/S0196-8858(03)00098-8","author":"Semple C.","year":"2004","unstructured":"Semple , C. , & Steel , M. ( 2004 ). Circular permutations and evolutionary trees. Advances in Applied Mathematics, 32(4). https:\/\/doi.org\/10.1016\/S0196-8858(03)00098-8 Semple, C., & Steel, M. (2004). Circular permutations and evolutionary trees. Advances in Applied Mathematics, 32(4). https:\/\/doi.org\/10.1016\/S0196-8858(03)00098-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/nrg3186"},{"key":"e_1_3_2_1_5_1","volume-title":"FastTree 2 - Approximately maximum-likelihood trees for large alignments. PLoS ONE, 5(3). https:\/\/doi.org\/10.1371\/journal.pone.0009490","author":"Price M. N.","year":"2010","unstructured":"Price , M. N. , Dehal , P. S. , & Arkin , A. P. ( 2010 ). FastTree 2 - Approximately maximum-likelihood trees for large alignments. PLoS ONE, 5(3). https:\/\/doi.org\/10.1371\/journal.pone.0009490 Price, M. N., Dehal, P. S., & Arkin, A. P. (2010). FastTree 2 - Approximately maximum-likelihood trees for large alignments. PLoS ONE, 5(3). https:\/\/doi.org\/10.1371\/journal.pone.0009490"},{"key":"e_1_3_2_1_6_1","volume-title":"RAxML version 8: A tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics, 30(9). https:\/\/doi.org\/10.1093\/bioinformatics\/btu033","author":"Stamatakis A.","year":"2014","unstructured":"Stamatakis , A. ( 2014 ). RAxML version 8: A tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics, 30(9). https:\/\/doi.org\/10.1093\/bioinformatics\/btu033 Stamatakis, A. (2014). RAxML version 8: A tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics, 30(9). https:\/\/doi.org\/10.1093\/bioinformatics\/btu033"},{"key":"e_1_3_2_1_7_1","volume-title":"P., Ayres, D. L., Darling, A., H\u00f6hna, S., Larget, B., Liu, L., Suchard, M. A.","author":"Ronquist F.","year":"2012","unstructured":"Ronquist , F. , Teslenko , M. , Van Der Mark , P., Ayres, D. L., Darling, A., H\u00f6hna, S., Larget, B., Liu, L., Suchard, M. A. , & Huelsenbeck, J. P. ( 2012 ). Mrbayes 3.2: Efficient bayesian phylogenetic inference and model choice across a large model space. Systematic Biology , 61(3). https:\/\/doi.org\/10.1093\/sysbio\/sys029 Ronquist, F., Teslenko, M., Van Der Mark, P., Ayres, D. L., Darling, A., H\u00f6hna, S., Larget, B., Liu, L., Suchard, M. A., & Huelsenbeck, J. P. (2012). Mrbayes 3.2: Efficient bayesian phylogenetic inference and model choice across a large model space. Systematic Biology, 61(3). https:\/\/doi.org\/10.1093\/sysbio\/sys029"},{"key":"e_1_3_2_1_8_1","volume-title":"BEAST 2: A Software Platform for Bayesian Evolutionary Analysis. PLoS Computational Biology, 10(4). https:\/\/doi.org\/10.1371\/journal.pcbi.1003537","author":"Bouckaert R.","year":"2014","unstructured":"Bouckaert , R. , Heled , J. , K\u00fchnert , D. , Vaughan , T. , Wu , C. H. , Xie , D. , Suchard , M. A. , Rambaut , A. , & Drummond , A. J. ( 2014 ). BEAST 2: A Software Platform for Bayesian Evolutionary Analysis. PLoS Computational Biology, 10(4). https:\/\/doi.org\/10.1371\/journal.pcbi.1003537 Bouckaert, R., Heled, J., K\u00fchnert, D., Vaughan, T., Wu, C. H., Xie, D., Suchard, M. A., Rambaut, A., & Drummond, A. J. (2014). BEAST 2: A Software Platform for Bayesian Evolutionary Analysis. PLoS Computational Biology, 10(4). https:\/\/doi.org\/10.1371\/journal.pcbi.1003537"},{"key":"e_1_3_2_1_9_1","volume-title":"Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees. https:\/\/doi.org\/10.1090\/dimacs\/037\/11","author":"Makarenkov V.","year":"1997","unstructured":"Makarenkov , V. , & Leclerc , B. ( 1997 ). Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees. https:\/\/doi.org\/10.1090\/dimacs\/037\/11 Makarenkov, V., & Leclerc, B. (1997). Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees. https:\/\/doi.org\/10.1090\/dimacs\/037\/11"},{"key":"e_1_3_2_1_10_1","volume-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4(4). https:\/\/doi.org\/10.1093\/oxfordjournals.molbev.a040454","author":"Saitou N.","year":"1987","unstructured":"Saitou , N. , & Nei , M. ( 1987 ). The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4(4). https:\/\/doi.org\/10.1093\/oxfordjournals.molbev.a040454 Saitou, N., & Nei, M. (1987). The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4(4). https:\/\/doi.org\/10.1093\/oxfordjournals.molbev.a040454"},{"key":"e_1_3_2_1_11_1","volume-title":"Unweighted pair group method with arithmetic mean.\u00a0Numerical Taxonomy, 230-234","author":"Sneath P. H. A.","year":"1973","unstructured":"Sneath , P. H. A. , & Sokal , R. R. ( 1973 ). Unweighted pair group method with arithmetic mean.\u00a0Numerical Taxonomy, 230-234 . Sneath, P. H. A., & Sokal, R. R. (1973). Unweighted pair group method with arithmetic mean.\u00a0Numerical Taxonomy, 230-234."},{"key":"e_1_3_2_1_12_1","volume-title":"The minimum evolution distance-based approach to phylogenetic inference. Mathematics of Evolution and Phylogeny, 1","author":"Desper R.","year":"2005","unstructured":"Desper , R. , & Gascuel , O. ( 2005 ). The minimum evolution distance-based approach to phylogenetic inference. Mathematics of Evolution and Phylogeny, 1 . Desper, R., & Gascuel, O. (2005). The minimum evolution distance-based approach to phylogenetic inference. Mathematics of Evolution and Phylogeny, 1."},{"key":"e_1_3_2_1_13_1","volume-title":"MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research, 32(5). https:\/\/doi.org\/10.1093\/nar\/gkh340","author":"Edgar R. C.","year":"2004","unstructured":"Edgar , R. C. ( 2004 ). MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research, 32(5). https:\/\/doi.org\/10.1093\/nar\/gkh340 Edgar, R. C. (2004). MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research, 32(5). https:\/\/doi.org\/10.1093\/nar\/gkh340"},{"key":"e_1_3_2_1_14_1","volume-title":"5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings.","author":"Bello I.","year":"2019","unstructured":"Bello , I. , Pham , H. , Le , Q. V. , Norouzi , M. , & Bengio , S. ( 2019 ). Neural combinatorial optimization with reinforcement learning . 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. Bello, I., Pham, H., Le, Q. V., Norouzi, M., & Bengio, S. (2019). Neural combinatorial optimization with reinforcement learning. 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings."},{"key":"e_1_3_2_1_15_1","volume-title":"ICLR","author":"Kool W.","year":"2019","unstructured":"Kool , W. , Van Hoof , H. , & Welling , M. ( 2019 ). Attention, learn to solve routing problems! 7th International Conference on Learning Representations , ICLR 2019. Kool, W., Van Hoof, H., & Welling, M. (2019). Attention, learn to solve routing problems! 7th International Conference on Learning Representations, ICLR 2019."},{"key":"e_1_3_2_1_16_1","volume-title":"Advances in Neural Information Processing Systems","author":"Dai H.","year":"2017","unstructured":"Dai , H. , Khalil , E. B. , Zhang , Y. , Dilkina , B. , & Song , L. ( 2017 ). Learning combinatorial optimization algorithms over graphs . Advances in Neural Information Processing Systems , 2017-December. Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., & Song, L. (2017). Learning combinatorial optimization algorithms over graphs. Advances in Neural Information Processing Systems, 2017-December."},{"key":"e_1_3_2_1_17_1","volume-title":"Learning heuristics over large graphs via deep reinforcement learning.\u00a0arXiv preprint arXiv:1903.03332","author":"Mittal A.","year":"2019","unstructured":"Mittal , A. , Dhawan , A. , Manchanda , S. , Medya , S. , Ranu , S. , & Singh , A. ( 2019 ). Learning heuristics over large graphs via deep reinforcement learning.\u00a0arXiv preprint arXiv:1903.03332 . Mittal, A., Dhawan, A., Manchanda, S., Medya, S., Ranu, S., & Singh, A. (2019). Learning heuristics over large graphs via deep reinforcement learning.\u00a0arXiv preprint arXiv:1903.03332."},{"key":"e_1_3_2_1_18_1","volume-title":"Playing atari with deep reinforcement learning.\u00a0arXiv preprint arXiv:1312.5602","author":"Mnih V.","year":"2013","unstructured":"Mnih , V. , Kavukcuoglu , K. , Silver , D. , Graves , A. , Antonoglou , I. , Wierstra , D. , & Riedmiller , M. ( 2013 ). Playing atari with deep reinforcement learning.\u00a0arXiv preprint arXiv:1312.5602 . Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013). Playing atari with deep reinforcement learning.\u00a0arXiv preprint arXiv:1312.5602."},{"key":"e_1_3_2_1_19_1","volume-title":"Using traveling salesman problem algorithms for evolutionary tree construction. Bioinformatics, 16(7). https:\/\/doi.org\/10.1093\/bioinformatics\/16.7.619","author":"Korostensky C.","year":"2000","unstructured":"Korostensky , C. , & Gonnet , G. H. ( 2000 ). Using traveling salesman problem algorithms for evolutionary tree construction. Bioinformatics, 16(7). https:\/\/doi.org\/10.1093\/bioinformatics\/16.7.619 Korostensky, C., & Gonnet, G. H. (2000). Using traveling salesman problem algorithms for evolutionary tree construction. Bioinformatics, 16(7). https:\/\/doi.org\/10.1093\/bioinformatics\/16.7.619"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"e_1_3_2_1_21_1","volume-title":"Advances in Neural Information Processing Systems","author":"Vaswani A.","year":"2017","unstructured":"Vaswani , A. , Shazeer , N. , Parmar , N. , Uszkoreit , J. , Jones , L. , Gomez , A. N. , Kaiser , \u0141., & Polosukhin , I. ( 2017 ). Attention is all you need . Advances in Neural Information Processing Systems , 2017-December. Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, \u0141., & Polosukhin, I. (2017). Attention is all you need. Advances in Neural Information Processing Systems, 2017-December."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_1_23_1","volume-title":"32nd International Conference on Machine Learning, ICML 2015, 1.","author":"Ioffe S.","year":"2015","unstructured":"Ioffe , S. , & Szegedy , C. ( 2015 ). Batch normalization: Accelerating deep network training by reducing internal covariate shift . 32nd International Conference on Machine Learning, ICML 2015, 1. Ioffe, S., & Szegedy, C. (2015). Batch normalization: Accelerating deep network training by reducing internal covariate shift. 32nd International Conference on Machine Learning, ICML 2015, 1."},{"key":"e_1_3_2_1_24_1","volume-title":"3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings.","author":"Kingma D. P.","year":"2015","unstructured":"Kingma , D. P. , & Ba , J. L. ( 2015 ). Adam: A method for stochastic optimization . 3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings. Kingma, D. P., & Ba, J. L. (2015). Adam: A method for stochastic optimization. 3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings."},{"key":"e_1_3_2_1_25_1","volume-title":"Construction of a tree with","author":"Yushmanov S. V.","year":"1984","unstructured":"Yushmanov , S. V. ( 1984 ). Construction of a tree with p leaves from 2p-3 elements of its distance matrix.\u00a0Matematicheskie Zametki ,\u00a035, 877-887. Yushmanov, S. V. (1984). Construction of a tree with p leaves from 2p-3 elements of its distance matrix.\u00a0Matematicheskie Zametki,\u00a035, 877-887."},{"key":"e_1_3_2_1_26_1","volume-title":"Greengenes, a chimera-checked 16S rRNA gene database and workbench compatible with ARB. Applied and Environmental Microbiology, 72(7). https:\/\/doi.org\/10.1128\/AEM.03006-05","author":"DeSantis T. Z.","year":"2006","unstructured":"DeSantis , T. Z. , Hugenholtz , P. , Larsen , N. , Rojas , M. , Brodie , E. L. , Keller , K. , Huber , T. , Dalevi , D. , Hu , P. , & Andersen , G. L. ( 2006 ). Greengenes, a chimera-checked 16S rRNA gene database and workbench compatible with ARB. Applied and Environmental Microbiology, 72(7). https:\/\/doi.org\/10.1128\/AEM.03006-05 DeSantis, T. Z., Hugenholtz, P., Larsen, N., Rojas, M., Brodie, E. L., Keller, K., Huber, T., Dalevi, D., Hu, P., & Andersen, G. L. (2006). Greengenes, a chimera-checked 16S rRNA gene database and workbench compatible with ARB. Applied and Environmental Microbiology, 72(7). https:\/\/doi.org\/10.1128\/AEM.03006-05"},{"key":"e_1_3_2_1_27_1","volume-title":"Comparison of phylogenetic trees. Mathematical biosciences, 53(1-2), 131-147","author":"Robinson D. F.","year":"1981","unstructured":"Robinson , D. F. , & Foulds , L. R. ( 1981 ). Comparison of phylogenetic trees. Mathematical biosciences, 53(1-2), 131-147 . Robinson, D. F., & Foulds, L. R. (1981). Comparison of phylogenetic trees. Mathematical biosciences, 53(1-2), 131-147."},{"key":"e_1_3_2_1_28_1","volume-title":"DendroPy: A Python library for phylogenetic computing. Bioinformatics, 26(12). https:\/\/doi.org\/10.1093\/bioinformatics\/btq228","author":"Sukumaran J.","year":"2010","unstructured":"Sukumaran , J. , & Holder , M. T. ( 2010 ). DendroPy: A Python library for phylogenetic computing. Bioinformatics, 26(12). https:\/\/doi.org\/10.1093\/bioinformatics\/btq228 Sukumaran, J., & Holder, M. T. (2010). DendroPy: A Python library for phylogenetic computing. Bioinformatics, 26(12). https:\/\/doi.org\/10.1093\/bioinformatics\/btq228"}],"event":{"name":"ICMLC 2021: 2021 13th International Conference on Machine Learning and Computing","location":"Shenzhen China","acronym":"ICMLC 2021"},"container-title":["2021 13th International Conference on Machine Learning and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457682.3457704","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3457682.3457704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:08Z","timestamp":1750195688000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457682.3457704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,26]]},"references-count":28,"alternative-id":["10.1145\/3457682.3457704","10.1145\/3457682"],"URL":"https:\/\/doi.org\/10.1145\/3457682.3457704","relation":{},"subject":[],"published":{"date-parts":[[2021,2,26]]},"assertion":[{"value":"2021-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}