{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:21:37Z","timestamp":1780053697507,"version":"3.54.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T00:00:00Z","timestamp":1710547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T00:00:00Z","timestamp":1710547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171452"],"award-info":[{"award-number":["12171452"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12231014"],"award-info":[{"award-number":["12231014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Anhui Initiative in Quantum Information Technologies","award":["AHY150200"],"award-info":[{"award-number":["AHY150200"]}]},{"name":"National Key Research and Development Program of China","award":["2020YFA0713100"],"award-info":[{"award-number":["2020YFA0713100"]}]},{"name":"Innovation Program for Quantum Science and Technolog","award":["2021ZD0302902"],"award-info":[{"award-number":["2021ZD0302902"]}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2021M703098"],"award-info":[{"award-number":["2021M703098"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10623-024-01377-y","type":"journal-article","created":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T15:01:36Z","timestamp":1710601296000},"page":"2011-2029","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Balanced reconstruction codes for single edits"],"prefix":"10.1007","volume":"92","author":[{"given":"Rongsheng","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4234-3610","authenticated-orcid":false,"given":"Xiande","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,16]]},"reference":[{"issue":"7","key":"1377_CR1","doi-asserted-by":"crossref","first-page":"2373","DOI":"10.1109\/18.887851","volume":"46","author":"E Agrell","year":"2000","unstructured":"Agrell E., Vardy A., Zeger K.: Upper bounds for constant-weight codes. IEEE Trans. Inf. Theory 46(7), 2373\u20132395 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1377_CR2","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/12.257712","volume":"42","author":"S Al-Bassam","year":"1993","unstructured":"Al-Bassam S., Bose B.: Design of efficient error-correcting balanced codes. IEEE Trans. Comput. 42(10), 1261\u20131266 (1993).","journal-title":"IEEE Trans. Comput."},{"key":"1377_CR3","unstructured":"Bar-Lev D., Kobovich A., Leitersdorf O., Yaakobi E.: Universal framework for parametric constrained coding (2023). arXiv:2304.01317."},{"key":"1377_CR4","volume-title":"Hypergraphs. Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge C.: Hypergraphs. Combinatorics of Finite Sets, 1st edn North Holland, Amsterdam (1989).","edition":"1"},{"issue":"3","key":"1377_CR5","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1109\/TCOMM.2018.2886354","volume":"67","author":"K Bibak","year":"2019","unstructured":"Bibak K., Milenkovic O.: Explicit formulas for the weight enumerators of some classes of deletion correcting codes. IEEE Trans. Inf. Theory 67(3), 1809\u20131816 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1377_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/18.370117","volume":"41","author":"S Bitan","year":"1995","unstructured":"Bitan S., Etzion T.: Constructions for optimal constant-weight cyclically permutable codes and difference families. IEEE Trans. Inf. Theory 41(1), 77\u201387 (1995).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1377_CR7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1008318207622","volume":"16","author":"S Blake-Wilson","year":"1999","unstructured":"Blake-Wilson S., Phelps K.T.: Constant weight codes and group divisible designs. Des. Codes Cryptogr. 16(1), 11\u201327 (1999).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1377_CR8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TIT.2021.3122798","volume":"68","author":"K Cai","year":"2021","unstructured":"Cai K., Kiah H.M., Nguyen T.T., Yaakobi E.: Coding for sequence reconstruction for single edits. IEEE Trans. Inf. Theory 68(1), 66\u201379 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1377_CR9","doi-asserted-by":"crossref","first-page":"3438","DOI":"10.1109\/TIT.2021.3049627","volume":"67","author":"K Cai","year":"2021","unstructured":"Cai K., Chee Y.M., Gabrys R., Kiah H.M., Nguyen T.: Correcting a single indel\/edit for DNA-based data storage: linear-time encoders and order-optimality. IEEE Trans. Inf. Theory 67(6), 3438\u20133451 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1377_CR10","doi-asserted-by":"crossref","first-page":"7094","DOI":"10.1109\/TIT.2018.2807480","volume":"64","author":"YM Chee","year":"2018","unstructured":"Chee Y.M., Kiah H.M., Vardy A., Vu V.K., Yaakobi E.: Coding for racetrack memories. IEEE Trans. Inf. Theory 64(11), 7094\u20137112 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1377_CR11","doi-asserted-by":"crossref","unstructured":"Chrisnata J., Kiahy H.M.: Correcting two deletions with more reads. In: Proceedings of IEEE International Symposium on Information Theory, Melbourne, Australia, pp. 2666\u20132671 (2021).","DOI":"10.1109\/ISIT45174.2021.9518269"},{"key":"1377_CR12","unstructured":"Chrisnata J., Kiah H.M., Yaakobi E.: Optimal reconstruction codes for deletion channels. In: Proceedings of IEEE International Symposium on Information Theory, Kapolei, USA, pp. 279\u2013283 (2020)."},{"issue":"11","key":"1377_CR13","doi-asserted-by":"crossref","first-page":"7141","DOI":"10.1109\/TIT.2022.3184868","volume":"68","author":"J Chrisnata","year":"2022","unstructured":"Chrisnata J., Kiah H.M., Yaakobi E.: Correcting deletions with multiple reads. IEEE Trans. Inf. Theory 68(11), 7141\u20137158 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1377_CR14","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/18.9775","volume":"34","author":"RH Deng","year":"1988","unstructured":"Deng R.H., Herro M.A.: DC-free coset codes. IEEE Trans. Inf. Theory 34(4), 786\u2013792 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1377_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1019947222243","volume":"27","author":"FW Fu","year":"2002","unstructured":"Fu F.W., Wei K.W.: Self-complementary balanced codes and quasi-symmetric designs. Des. Codes Cryptogr. 27(3), 271\u2013279 (2002).","journal-title":"Des. Codes Cryptogr."},{"key":"1377_CR16","doi-asserted-by":"crossref","unstructured":"Gabrys R., Yaakobi E.: Sequence reconstruction over the deletion channel. In: Proceedings of IEEE International Symposium on Information Theory, Barcelona, Spain, pp. 1596\u20131600 (2016).","DOI":"10.1109\/ISIT.2016.7541568"},{"issue":"4","key":"1377_CR17","doi-asserted-by":"crossref","first-page":"2924","DOI":"10.1109\/TIT.2018.2800044","volume":"64","author":"R Gabrys","year":"2018","unstructured":"Gabrys R., Yaakobi E.: Sequence reconstruction over deletion channel. IEEE Trans. Inf. Theory 64(4), 2924\u20132931 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1377_CR18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","volume":"26","author":"RL Graham","year":"1980","unstructured":"Graham R.L., Sloane N.J.A.: Lower bounds for constant weight codes. IEEE Trans. Inf. Theory 26(1), 37\u201343 (1980).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1377_CR19","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1109\/18.135636","volume":"38","author":"NQAL Gy\u00f6rfi","year":"1992","unstructured":"Gy\u00f6rfi N.Q.A.L., Massey J.L.: Constructions of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Trans. Inf. Theory 38(3), 940\u2013949 (1992).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1377_CR20","doi-asserted-by":"crossref","first-page":"49523","DOI":"10.1109\/ACCESS.2020.2980036","volume":"8","author":"K Immink","year":"2020","unstructured":"Immink K., Cai K.: Properties and constructions of constrained codes for DNA-based data storage. IEEE Acess 8, 49523\u201349531 (2020).","journal-title":"IEEE Acess"},{"issue":"8","key":"1377_CR21","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1109\/TIT.2004.831751","volume":"50","author":"T Jiang","year":"2004","unstructured":"Jiang T., Vardy A.: Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes. IEEE Trans. Inf. Theory 50(8), 1655\u20131664 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1377_CR22","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.1986.1057136","volume":"32","author":"D Knuth","year":"1986","unstructured":"Knuth D.: Efficient balanced codes. IEEE Trans. Inf. Theory 32(1), 51\u201353 (1986).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1377_CR23","doi-asserted-by":"crossref","unstructured":"Konstantinova E.: Reconstruction of signed permutations from their distorted patterns. In: Proceedings of IEEE International Symposium on Information Theory, Adelaide, Australia, pp. 474\u2013477 (2005).","DOI":"10.1109\/ISIT.2005.1523379"},{"issue":"5\u20136","key":"1377_CR24","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1016\/j.disc.2007.08.003","volume":"308","author":"E Konstantinova","year":"2008","unstructured":"Konstantinova E.: On reconstruction of signed permutations distorted by reversal errors. Discret. Math. 308(5\u20136), 974\u2013984 (2008).","journal-title":"Discret. Math."},{"issue":"8","key":"1377_CR25","doi-asserted-by":"crossref","first-page":"5115","DOI":"10.1109\/TIT.2013.2257917","volume":"59","author":"AA Kulkarni","year":"2013","unstructured":"Kulkarni A.A., Kiyavash N.: Nonasymptotic upper bounds for deletion correcting codes. IEEE Trans. Inf. Theory 59(8), 5115\u20135130 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1377_CR26","doi-asserted-by":"crossref","first-page":"3098","DOI":"10.1016\/j.disc.2019.06.019","volume":"342","author":"L Lan","year":"2019","unstructured":"Lan L., Chang Y.: Two-weight codes: upper bounds and new optimal constructions. Discret. Math. 342(11), 3098\u20133113 (2019).","journal-title":"Discret. Math."},{"key":"1377_CR27","doi-asserted-by":"crossref","unstructured":"Leiss, E.L.: Data integrity in digital optical disks. IEEE Trans. Comput. c-33(9):818\u2013827 (1984).","DOI":"10.1109\/TC.1984.1676498"},{"issue":"4","key":"1377_CR28","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1109\/TIT.2019.2961265","volume":"66","author":"A Lenz","year":"2020","unstructured":"Lenz A., Siegel P.H., Wachter-Zeh A., Yaakobi E.: Coding over sets for DNA storage. IEEE Trans. Inf. Theory 66(4), 2331\u20132351 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1377_CR29","unstructured":"Levenshtein V.I.: Binary codes capable of correcting deletions, insertions and reversals. Dokl. Akad. Nauk SSSR, 1965, 163(4):845\u2013848, 1965. English translation in Sov. Phys. Dokl., 10(8):707\u2013710. (1966)."},{"issue":"1","key":"1377_CR30","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/18.904499","volume":"47","author":"VI Levenshtein","year":"2001","unstructured":"Levenshtein V.I.: Efficient reconstruction of sequences. IEEE Trans. Inf. Theory 47(1), 2\u201322 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1377_CR31","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1006\/jcta.2000.3081","volume":"93","author":"VI Levenshtein","year":"2001","unstructured":"Levenshtein V.I.: Efficient reconstruction of sequences from their subsequences or supersequences. J. Comb. Theory A 93(2), 310\u2013332 (2001).","journal-title":"J. Comb. Theory A"},{"issue":"4","key":"1377_CR32","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.jcta.2008.11.005","volume":"116","author":"VI Levenshtein","year":"2009","unstructured":"Levenshtein V.I., Siemons J.: Error graphs and the reconstruction of elements in groups. J. Comb. Theory A 116(4), 795\u2013815 (2009).","journal-title":"J. Comb. Theory A"},{"issue":"9","key":"1377_CR33","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1016\/j.dam.2006.11.016","volume":"156","author":"VI Levenshtein","year":"2008","unstructured":"Levenshtein V.I., Konstantinova E., Konstantinov E., Molodtsov S.: Reconstruction of a graph from 2-vicinities of its vertices. Discret. Appl. Math. 156(9), 1399\u20131406 (2008).","journal-title":"Discret. Appl. Math."},{"key":"1377_CR34","volume-title":"Invitation to Discrete Mathematics","author":"J Matou\u0161ek","year":"2009","unstructured":"Matou\u0161ek J., Ne\u0161et\u0159il J.: Invitation to Discrete Mathematics, 2nd edn Oxford University Press, Oxford (2009).","edition":"2"},{"issue":"12","key":"1377_CR35","doi-asserted-by":"crossref","first-page":"7914","DOI":"10.1109\/TIT.2021.3119568","volume":"67","author":"T Nguyen","year":"2021","unstructured":"Nguyen T., Cai K., Immink K.: Efficient design of subblock energy-constrained codes and sliding window-constrained codes. IEEE Trans. Inf. Theory 67(12), 7914\u20137924 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1377_CR36","doi-asserted-by":"crossref","first-page":"1292","DOI":"10.1109\/18.850669","volume":"46","author":"E Ordentlich","year":"2000","unstructured":"Ordentlich E., Roth R.M.: Two-dimentional weight-constrained codes through enumeration bounds. IEEE Trans. Inf. Theory 46(4), 1292\u20131301 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1377_CR37","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1109\/TIT.2017.2649493","volume":"63","author":"F Sala","year":"2017","unstructured":"Sala F., Gabrys R., Schoeny C., Dolecek L.: Exact reconstruction from insertions in synchronization codes. IEEE Trans. Inf. Theory 63(4), 2428\u20132445 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1377_CR38","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1109\/TIT.2017.2661747","volume":"63","author":"C Schoeny","year":"2017","unstructured":"Schoeny C., Wachter-Zeh A., Gabrys R., Yaakobi E.: Codes correcting a burst of deletions or insertions. IEEE Trans. Inf. Theory 63(4), 1971\u20131985 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1377_CR39","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1007\/s10623-017-0390-0","volume":"86","author":"M Shi","year":"2018","unstructured":"Shi M., Sepasdar Z., Alahmadi A., Sol\u00e9 P.: On two-weight $${\\mathbb{Z} }_{2^k}$$-codes. Des. Codes Cryptogr. 86(6), 1201\u20131209 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"12","key":"1377_CR40","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1007\/s10623-020-00796-x","volume":"88","author":"M Shi","year":"2020","unstructured":"Shi M., Wang X., Sol\u00e9 P.: Two families of two-weight codes over $${\\mathbb{Z} }_4$$. Des. Codes Cryptogr. 88(12), 2493\u20132505 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1377_CR41","unstructured":"Sloane N.J.A.: On single-deletion-correcting codes. In: Codes and Designs: Proceedings of Conference Honoring Professor D.K. Ray-Chaudhuri on the Occasion of his 65th Birthday (2000)."},{"issue":"5","key":"1377_CR42","doi-asserted-by":"crossref","first-page":"2969","DOI":"10.1109\/TIT.2022.3226296","volume":"69","author":"Y Sun","year":"2023","unstructured":"Sun Y., Ge G.: Correcting two-deletion with a constant number of reads. IEEE Trans. Inf. Theory 69(5), 2969\u20132982 (2023).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1377_CR43","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1109\/18.42227","volume":"35","author":"HV Tilborg","year":"1989","unstructured":"Tilborg H.V., Blaum M.: On error-correcting balanced codes. IEEE Trans. Inf. Theory 35(5), 1091\u20131095 (1989).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1377_CR44","doi-asserted-by":"crossref","first-page":"2390","DOI":"10.1109\/26.297847","volume":"42","author":"XM Wang","year":"1994","unstructured":"Wang X.M., Yang Y.X.: On the undetected error probability of nonlinear binary constant weight codes. IEEE Trans. Commun. 42(7), 2390\u20132394 (1994).","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"1377_CR45","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1109\/LCOMM.2019.2912572","volume":"23","author":"Y Wang","year":"2019","unstructured":"Wang Y., Noor-A-Rahim M., Gunawan E., Guan Y., Poh C.L.: Construction of bio-constrained code for DNA data storage. IEEE Commun. Lett. 23(6), 963\u2013966 (2019).","journal-title":"IEEE Commun. Lett."},{"issue":"7","key":"1377_CR46","doi-asserted-by":"crossref","first-page":"4422","DOI":"10.1109\/TIT.2022.3159736","volume":"68","author":"HJ Wei","year":"2022","unstructured":"Wei H.J., Schwartz M.: Sequence reconstruction for limited-magnitude errors. IEEE Trans. Inf. Theory 68(7), 4422\u20134434 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1377_CR47","doi-asserted-by":"crossref","unstructured":"Yaakobi E., Schwartz M., Langberg M., Bruck J.: Sequence reconstruction for Grassmann graphs and permutations. In: Proceedings of IEEE International Symposium on Information Theory, Istanbul, Turkey, pp. 874\u2013878 (2013).","DOI":"10.1109\/ISIT.2013.6620351"},{"issue":"3","key":"1377_CR48","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TMBMC.2016.2537305","volume":"1","author":"SMHT Yazdi","year":"2015","unstructured":"Yazdi S.M.H.T., Kiah H.M., Garcia-Ruiz E., Ma J., Zhao H., Milenkovic O.: DNA-based storage: trends and methods. IEEE Trans. Mol. Biol. Multi-Scale Commun. 1(3), 230\u2013248 (2015).","journal-title":"IEEE Trans. Mol. Biol. Multi-Scale Commun."},{"issue":"9","key":"1377_CR49","doi-asserted-by":"crossref","first-page":"6283","DOI":"10.1109\/TIT.2018.2792488","volume":"64","author":"SMHT Yazdi","year":"2018","unstructured":"Yazdi S.M.H.T., Kiah H.M., Gabrys R., Milenkovic O.: Mutually uncorrelated primers for DNA-based data storage. IEEE Trans. Inf. Theory 64(9), 6283\u20136296 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1377_CR50","doi-asserted-by":"crossref","first-page":"4977","DOI":"10.1109\/TIT.2023.3260872","volume":"69","author":"Z Ye","year":"2023","unstructured":"Ye Z., Liu X., Zhang X., Ge G.: Reconstruction of sequences distorted by two insertions. IEEE Trans. Inf. Theory 69(8), 4977\u20134992 (2023).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01377-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01377-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01377-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T17:09:04Z","timestamp":1719248944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01377-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,16]]},"references-count":50,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1377"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01377-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,16]]},"assertion":[{"value":"28 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}