{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T22:24:15Z","timestamp":1773354255471,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819604364","type":"print"},{"value":"9789819604371","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-96-0437-1_12","type":"book-chapter","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T16:55:38Z","timestamp":1732640138000},"page":"158-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Approach for\u00a0Constructing Phylogenetic Maximum Parsimony Tree"],"prefix":"10.1007","author":[{"given":"Hoang Huu","family":"Bach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc Kien","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nghiem Nguyen Viet","family":"Dung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,27]]},"reference":[{"issue":"8","key":"12_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.3390\/pr6080106","volume":"6","author":"L Beal","year":"2018","unstructured":"Beal, L., Hill, D., Martin, R., Hedengren, J.: Gekko optimization suite. Processes 6(8), 106 (2018). https:\/\/doi.org\/10.3390\/pr6080106","journal-title":"Processes"},{"key":"12_CR2","unstructured":"Bonnet, \u00c9., Sikora, F.: The pace 2018 parameterized algorithms and computational experiments challenge: the third iteration. In: IPEC 2018 (2018)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: I. the parameter setting problem. Quantum Inf. Process. 7, 193\u2013209 (2008)","DOI":"10.1007\/s11128-008-0082-9"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"10029","DOI":"10.1038\/s41598-021-89461-4","volume":"11","author":"P Date","year":"2021","unstructured":"Date, P., Arthur, D., Pusey-Nazzaro, L.: QUBO formulations for training machine learning models. Sci. Rep. 11(1), 10029 (2021)","journal-title":"Sci. Rep."},{"key":"12_CR5","first-page":"227","volume":"5","author":"DZ Du","year":"2009","unstructured":"Du, D.Z., Lu, B., Ngo, H.Q., Pardalos, P.M.: Steiner tree problems. Encycl. Optim. 5, 227\u2013290 (2009)","journal-title":"Encycl. Optim."},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1093\/sysbio\/20.4.406","volume":"20","author":"WM Fitch","year":"1971","unstructured":"Fitch, W.M.: Toward defining the course of evolution: minimum change for a specific tree topology. Syst. Biol. 20(4), 406\u2013416 (1971)","journal-title":"Syst. Biol."},{"key":"12_CR7","unstructured":"Fowler, A.: Improved QUBO formulations for D-Wave quantum computing. Ph. D. thesis, University of Auckland (2017)"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Gascuel, O.: BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. Mol. Biol. Evol. 14(7), 685\u2013695 (1997). https:\/\/doi.org\/10.1093\/oxfordjournals.molbev.a025808","DOI":"10.1093\/oxfordjournals.molbev.a025808"},{"issue":"5","key":"12_CR9","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1111\/j.1096-0031.2008.00217.x","volume":"24","author":"PA Goloboff","year":"2008","unstructured":"Goloboff, P.A., Farris, J.S., Nixon, K.C.: TNT, a free program for phylogenetic analysis. Cladistics 24(5), 774\u2013786 (2008)","journal-title":"Cladistics"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/s12862-018-1131-3","volume":"18","author":"DT Hoang","year":"2018","unstructured":"Hoang, D.T., Sy Vinh, L., Flouri, T., Stamatakis, A., von Haeseler, A., Quang Minh, B.: MPBoot: fast phylogenetic maximum parsimony tree inference and bootstrap approximation. BMC Evol. Biol. 18, 11 (2018)","journal-title":"BMC Evol. Biol."},{"issue":"10","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1093\/bioinformatics\/btq098","volume":"26","author":"AD Johnson","year":"2010","unstructured":"Johnson, A.D.: An extended IUPAC nomenclature code for polymorphic nucleic acids. Bioinformatics 26(10), 1386\u20131389 (2010)","journal-title":"Bioinformatics"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/1748-7188-7-9","volume":"7","author":"W Kannan","year":"2012","unstructured":"Kannan, W.: Maximum parsimony on phylogenetic networks. Algorithms Mol. Biol. 7(1), 9 (2012)","journal-title":"Algorithms Mol. Biol."},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.22005","volume":"77","author":"I Ljubi\u0107","year":"2021","unstructured":"Ljubi\u0107, I.: Solving steiner trees: recent advances, challenges, and perspectives. Networks 77(2), 177\u2013204 (2021)","journal-title":"Networks"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 5 (2014)","journal-title":"Front. Phys."},{"key":"12_CR15","unstructured":"McGeoch, C., Farr\u00e9, P.: The advantage system: performance update. The Quantum Computing Company, Tech. Rep, D-Wave (2021)"},{"issue":"12","key":"12_CR16","doi-asserted-by":"publisher","first-page":"125210","DOI":"10.1063\/1.2995837","volume":"49","author":"S Morita","year":"2008","unstructured":"Morita, S., Nishimori, H.: Mathematical foundation of quantum annealing. J. Math. Phys. 49(12), 125210 (2008)","journal-title":"J. Math. Phys."},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1093\/oxfordjournals.molbev.a040454","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4(4), 406\u2013425 (1987). https:\/\/doi.org\/10.1093\/oxfordjournals.molbev.a040454","journal-title":"Mol. Biol. Evol."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1186\/1471-2105-6-92","volume":"6","author":"LS Vinh","year":"2005","unstructured":"Vinh, L.S., von Haeseler, A.: Shortest triplet clustering: reconstructing large phylogenies using representative sets. BMC Bioinform. 6, 92 (2005)","journal-title":"BMC Bioinform."},{"issue":"8","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1093\/molbev\/msh176","volume":"21","author":"LS Vinh","year":"2004","unstructured":"Vinh, L.S., Von Haeseler, A.: IQPNNI: moving fast through tree space and stopping in time. Mol. Biol. Evol. 21(8), 1565\u20131571 (2004)","journal-title":"Mol. Biol. Evol."},{"issue":"7","key":"12_CR20","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s00285-011-0442-4","volume":"64","author":"JF Weng","year":"2012","unstructured":"Weng, J.F., Mareels, I., Thomas, D.A.: Probability steiner trees and maximum parsimony in phylogenetic analysis. J. Math. Biol. 64(7), 1225\u20131251 (2012)","journal-title":"J. Math. Biol."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Wilgenbusch, J.C., Swofford, D.: Inferring evolutionary trees with PAUP. Curr. Protoc. Bioinfor. 6(1), Unit 6.4 (2003)","DOI":"10.1002\/0471250953.bi0604s00"}],"container-title":["Communications in Computer and Information Science","Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0437-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T17:03:22Z","timestamp":1732640602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0437-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819604364","9789819604371"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0437-1_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Binh Duong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/thefdse.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}