{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T05:02:37Z","timestamp":1777093357798,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015911","name":"Joint Genome Institute","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015911","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Biology and Chemistry"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.compbiolchem.2026.108911","type":"journal-article","created":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T16:23:32Z","timestamp":1768494212000},"page":"108911","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Optimal path reconstruction of plant chromosome evolution"],"prefix":"10.1016","volume":"122","author":[{"given":"Yunfei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"weiwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiting","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuelong","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiyin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.compbiolchem.2026.108911_bib1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.14738\/jbemi.14.395","article-title":"\"Rehabilitation of the blind using audio to visual conversion tool","volume":"1","author":"Aggarwal","year":"2014","journal-title":"J. Biomed. Eng. Med. Imaging"},{"key":"10.1016\/j.compbiolchem.2026.108911_bib2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.37394\/23208.2023.20.12","article-title":"\"A review on genomics data analysis using machine learning","volume":"20","author":"Aggarwal","year":"2023","journal-title":"WSEAS Trans. Biol. Biomed."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.21671","article-title":"Local search metaheuristics for the critical node problem","volume":"67","author":"Aringhieri","year":"2016","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.compbiolchem.2026.108911_bib4","article-title":"Hierarchical policy with deep-reinforcement learning for nonprehensile multiobject rearrangement","volume":"2","author":"Bai","year":"2022","journal-title":"Biomim. Intell. Robot."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib5","article-title":"A new approach for solving the minimum vertex cover problem using artificial bee colony algorithm","volume":"6","author":"Banharnsakun","year":"2023","journal-title":"Decis. Anal. J."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib6","unstructured":"Coulom, R., 2006. Efficient selectivity and backup operators in Monte-Carlo tree search. International Conference on Computers and Games CG 2006; 20060529-31; TurinIT. CNRS-LIFL, INRIA-SequeL, Universite Charles de Gaulle, Lille, France.."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"\"A formal basis for the heuristic determination of minimum cost paths.\"","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"12","key":"10.1016\/j.compbiolchem.2026.108911_bib8","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1038\/s41571-020-0417-8","article-title":"\"Artificial intelligence in radiation oncology","volume":"17","author":"Huynh","year":"2020","journal-title":"Nat. Rev. Clin. Oncol."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib9","unstructured":"Johnson, David S., and Michael R.Garey. Computers and intractability: a guide to the theory of NP-completeness. WH Freeman, 1979."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib10","unstructured":"Kareva, I., Karev, G., 2020. Linear rather than exponential decay: a mathematical model and underlying mechanisms[J]. 2020.DOI:10.48550\/arXiv.2004.05726."},{"issue":"1","key":"10.1016\/j.compbiolchem.2026.108911_bib11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1186\/s13059-022-02735-6","article-title":"\"Multiple genome alignment in the telomere-to-telomere assembly era","volume":"23","author":"Kille","year":"2022","journal-title":"Genome Biol."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib12","doi-asserted-by":"crossref","unstructured":"Kocsis, L., Szepesv\u00e1ri, C. 2006. Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds) Machine Learning: ECML 2006. ECML 2006. Lecture Notes in Computer Science, vol 4212. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11871842_29.","DOI":"10.1007\/11871842_29"},{"key":"10.1016\/j.compbiolchem.2026.108911_bib13","first-page":"14","article-title":"\"Near-infrared optical imaging of the breast","volume":"1","author":"Kumar","year":"2006","journal-title":"Int. J. Comput. Assist. Radiol. Surg."},{"issue":"9","key":"10.1016\/j.compbiolchem.2026.108911_bib14","doi-asserted-by":"crossref","first-page":"2799","DOI":"10.3390\/s18092799","article-title":"\"Breast cancer detection using infrared thermal imaging and a deep learning model","volume":"18","author":"Mambou","year":"2018","journal-title":"Sensors"},{"issue":"4","key":"10.1016\/j.compbiolchem.2026.108911_bib15","doi-asserted-by":"crossref","DOI":"10.1109\/TCIAIG.2010.2088123","article-title":"Combining uct and nested monte-carlo search for single-player general game playing","volume":"2","author":"Mehat","year":"2011","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"10.1016\/j.compbiolchem.2026.108911_bib16","series-title":"Computational Intelligence & Games","article-title":"Enhancements for Monte-Carlo tree search in Ms Pac-man","author":"Pepels","year":"2012"},{"key":"10.1016\/j.compbiolchem.2026.108911_bib17","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1093\/bib\/bbp037","article-title":"Improved criteria and comparative genomics tool provide new insights into grass paleogenomics","volume":"6","author":"Salse","year":"2009","journal-title":"Brief. Bioinforma. 10"},{"key":"10.1016\/j.compbiolchem.2026.108911_bib18","doi-asserted-by":"crossref","unstructured":"Schadd, M.P.D., Winands, M.H.M., van den Herik, H.J., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M., 2008. \u201cSingle-player Monte-Carlo tree search,\u201d in Computers and Games (CG 2008), ser. LNCS, H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, Eds., vol. 5131. Berlin, Germany: Springer-Verlag, 2008, pp. 1-12.","DOI":"10.1007\/978-3-540-87608-3_1"},{"key":"10.1016\/j.compbiolchem.2026.108911_bib19","doi-asserted-by":"crossref","unstructured":"M.P.D. Schadd M.H.M. Winands M.J.W. Tak W.H.M. Uiterwijk Single-player Monte-Carlo tree search for SameGame,Knowledge-Based Systems, Volume 34, 2012, Pages 3-11, ISSN 0950-7051, https:\/\/doi.org\/10.1016\/j.knosys.2011.08.008. 2012.","DOI":"10.1016\/j.knosys.2011.08.008"},{"key":"10.1016\/j.compbiolchem.2026.108911_bib20","first-page":"2164","article-title":"Monte-carlo planning in large pomdps","author":"Silver","year":"2010","journal-title":"Adv. Neural Inf. Process. Syst. (NIPS)"},{"issue":"1","key":"10.1016\/j.compbiolchem.2026.108911_bib21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.6.1.1","article-title":"Heuristic problem solving: the next advance in operations research","volume":"6","author":"Simon","year":"1958","journal-title":"Oper. Res."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib22","doi-asserted-by":"crossref","unstructured":"Song, H., Haustein, J.A., Yuan, W., Hang, K., Wang, M.Y., Kragic, D., , 2019. Multi-object rearrangement with monte carlo tree search:a case study on planar nonprehensile sorting.","DOI":"10.1109\/IROS45743.2020.9341532"},{"issue":"12","key":"10.1016\/j.compbiolchem.2026.108911_bib23","doi-asserted-by":"crossref","first-page":"1841","DOI":"10.1016\/j.molp.2022.10.018","article-title":"WGDI: a user-friendly toolkit for evolutionary analyses of whole-genome duplications and ancestral karyotypes","volume":"15","author":"Sun","year":"2022","journal-title":"Mol. Plant"},{"issue":"1","key":"10.1016\/j.compbiolchem.2026.108911_bib24","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1111\/nph.12985","article-title":"Telomere-centric genome repatterning determines recurring chromosome number reductions during the evolution of eukaryotes","volume":"205","author":"Wang","year":"2015","journal-title":"N. Phytol."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib25","article-title":"Comparative genomics approach to infer ancestral cell karyotypes and reconstruct the evolutionary trajectories of plant chromosomes","author":"Wang","year":"2025","journal-title":"Nat. Protoc."},{"key":"10.1016\/j.compbiolchem.2026.108911_bib26","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1038\/s41588-019-0402-2","article-title":"The genome of cultivated peanut provides insight into legume karyotypes, polyploid evolution and crop domestication","volume":"51","author":"Zhuang","year":"2019","journal-title":"Nat. Genet."}],"container-title":["Computational Biology and Chemistry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1476927126000368?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1476927126000368?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T13:25:46Z","timestamp":1772544346000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1476927126000368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":26,"alternative-id":["S1476927126000368"],"URL":"https:\/\/doi.org\/10.1016\/j.compbiolchem.2026.108911","relation":{},"ISSN":["1476-9271"],"issn-type":[{"value":"1476-9271","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal path reconstruction of plant chromosome evolution","name":"articletitle","label":"Article Title"},{"value":"Computational Biology and Chemistry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compbiolchem.2026.108911","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108911"}}