{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T10:15:31Z","timestamp":1783678531778,"version":"3.55.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T00:00:00Z","timestamp":1781049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T00:00:00Z","timestamp":1781049600000},"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":["J Sci Comput"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s10915-026-03351-3","type":"journal-article","created":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T05:58:45Z","timestamp":1781071125000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Latent Structural Categorical Matrix Completion with Application to Quasispecies Analysis"],"prefix":"10.1007","volume":"108","author":[{"given":"Qian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meixia","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,10]]},"reference":[{"issue":"13","key":"3351_CR1","doi-asserted-by":"publisher","first-page":"i23","DOI":"10.1093\/bioinformatics\/bty291","volume":"34","author":"S Ahn","year":"2018","unstructured":"Ahn, S., Ke, Z., Vikalo, H.: Viral quasispecies reconstruction via tensor factorization with successive read removal. Bioinformatics 34(13), i23\u2013i31 (2018)","journal-title":"Bioinformatics"},{"issue":"7","key":"3351_CR2","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1089\/cmb.2017.0249","volume":"25","author":"S Ahn","year":"2018","unstructured":"Ahn, S., Vikalo, H.: aBayesQR: a Bayesian method for reconstruction of viral populations characterized by low diversity. J. Comput. Biol. 25(7), 637\u2013648 (2018)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"3351_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2019","unstructured":"Boumal, N., Absil, P.A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2019)","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"3351_CR4","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/JSTSP.2016.2547860","volume":"10","author":"C Cai","year":"2016","unstructured":"Cai, C., Sanghavi, S., Vikalo, H.: Structured low-rank matrix factorization for haplotype assembly. IEEE Journal of Selected Topics in Signal Processing 10(4), 647\u2013657 (2016)","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"issue":"4","key":"3351_CR5","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"3351_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? Journal of the ACM (JACM) 58(3), 1\u201337 (2011)","journal-title":"Journal of the ACM (JACM)"},{"issue":"6","key":"3351_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"EJ Cand\u00e8s","year":"2012","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Commun. ACM 55(6), 111\u2013119 (2012)","journal-title":"Commun. ACM"},{"key":"3351_CR8","doi-asserted-by":"crossref","unstructured":"Cao, Y., Xie, Y.: Categorical matrix completion. In: International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, pp. 369\u2013372. IEEE (2015)","DOI":"10.1109\/CAMSAP.2015.7383813"},{"issue":"6","key":"3351_CR9","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1109\/TCBB.2020.2982142","volume":"18","author":"J Chen","year":"2020","unstructured":"Chen, J., Hou, J., Wong, K.C.: Categorical matrix completion with active learning for high-throughput screening. IEEE\/ACM Trans. Comput. Biol. Bioinf. 18(6), 2261\u20132270 (2020)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"3","key":"3351_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/imaiai\/iau006","volume":"3","author":"MA Davenport","year":"2014","unstructured":"Davenport, M.A., Plan, Y., Van Den Berg, E., Wootters, M.: 1-bit matrix completion. Information and Inference: A Journal of the IMA 3(3), 189\u2013223 (2014)","journal-title":"Information and Inference: A Journal of the IMA"},{"key":"3351_CR11","unstructured":"Ge, R., Lee, J.D., Ma, T.: Matrix completion has no spurious local minimum. Adv. Neural. Inf. Process. Syst. 29, (2016)"},{"key":"3351_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12864-018-4551-y","volume":"19","author":"A Hashemi","year":"2018","unstructured":"Hashemi, A., Zhu, B., Vikalo, H.: Sparse tensor decomposition for haplotype assembly of diploids and polyploids. BMC Genomics 19, 1\u201315 (2018)","journal-title":"BMC Genomics"},{"issue":"4","key":"3351_CR13","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1093\/bioinformatics\/btr708","volume":"28","author":"W Huang","year":"2012","unstructured":"Huang, W., Li, L., Myers, J.R., Marth, G.T.: ART: a next-generation sequencing read simulator. Bioinformatics 28(4), 593\u2013594 (2012)","journal-title":"Bioinformatics"},{"issue":"4","key":"3351_CR14","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1007\/s00362-021-01276-7","volume":"63","author":"H Hung","year":"2022","unstructured":"Hung, H., Huang, S.Y., Ing, C.K.: A generalized information criterion for high-dimensional pca rank selection. Stat. Pap. 63(4), 1295\u20131321 (2022)","journal-title":"Stat. Pap."},{"key":"3351_CR15","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 665\u2013674. (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"6","key":"3351_CR16","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1093\/bioinformatics\/btu754","volume":"31","author":"D Jayasundara","year":"2015","unstructured":"Jayasundara, D., Saeed, I., Maheswararajah, S., Chang, B.C., Tang, S.L., Halgamuge, S.K.: ViQuaS: an improved reconstruction pipeline for viral quasispecies spectra generated by next-generation sequencing. Bioinformatics 31(6), 886\u2013896 (2015)","journal-title":"Bioinformatics"},{"key":"3351_CR17","unstructured":"Knuth, D.E.: The art of computer programming: sorting and searching, vol. 3, Addison-Wesley Professional (1998)"},{"key":"3351_CR18","unstructured":"Li, H.: Aligning sequence reads, clone sequences and assembly contigs with, (2013). arXiv:1303.3997 BWA-MEM. arXiv preprint"},{"key":"3351_CR19","unstructured":"Li, J., Nguyen, N., Lai, M., Paschalidis, I.C., Huggins, J.H.: Robust model selection for discovery of latent mechanistic processes, (2026). arXiv:2602.22062 arXiv preprint"},{"key":"3351_CR20","unstructured":"Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low-rank representation. Adv. Neural. Inf. Process. Syst. 24, (2011)"},{"issue":"6","key":"3351_CR21","doi-asserted-by":"publisher","first-page":"662","DOI":"10.3390\/pathogens11060662","volume":"11","author":"B Mart\u00ednez-Gonz\u00e1lez","year":"2022","unstructured":"Mart\u00ednez-Gonz\u00e1lez, B., Soria, M.E., V\u00e1zquez-Sirvent, L., Ferrer-Orta, C., Lobo-Vega, R., M\u00ednguez, P., de la Fuente, L., Llorens, C., Soriano, B., Ramos-Ru\u00edz, R., et al.: SARS-CoV-2 mutant spectra at different depth levels reveal an overwhelming abundance of low frequency mutations. Pathogens 11(6), 662 (2022)","journal-title":"Pathogens"},{"key":"3351_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12864-015-1456-x","volume":"16","author":"RJ Orton","year":"2015","unstructured":"Orton, R.J., Wright, C.F., Morelli, M.J., King, D.J., Paton, D.J., King, D.P., Haydon, D.T.: Distinguishing low frequency mutations from RT-PCR and sequence errors in viral deep sequencing data. BMC Genomics 16, 1\u201315 (2015)","journal-title":"BMC Genomics"},{"key":"3351_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.virusres.2016.09.016","volume":"239","author":"S Posada-Cespedes","year":"2017","unstructured":"Posada-Cespedes, S., Seifert, D., Beerenwinkel, N.: Recent advances in inferring viral diversity from high-throughput sequencing data. Virus Res. 239, 17\u201332 (2017)","journal-title":"Virus Res."},{"issue":"1","key":"3351_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/TCBB.2013.145","volume":"11","author":"S Prabhakaran","year":"2013","unstructured":"Prabhakaran, S., Rey, M., Zagordi, O., Beerenwinkel, N., Roth, V.: HIV haplotype inference using a propagating dirichlet process mixture model. IEEE\/ACM Trans. Comput. Biol. Bioinf. 11(1), 182\u2013191 (2013)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"2","key":"3351_CR25","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"issue":"20","key":"3351_CR26","doi-asserted-by":"publisher","first-page":"3538","DOI":"10.1093\/bioinformatics\/btab322","volume":"37","author":"H Sun","year":"2021","unstructured":"Sun, H., Murphy, R.F.: Evaluation of categorical matrix completion algorithms: toward improved active learning for drug discovery. Bioinformatics 37(20), 3538\u20133545 (2021)","journal-title":"Bioinformatics"},{"issue":"2","key":"3351_CR27","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/1467-9868.00293","volume":"63","author":"R Tibshirani","year":"2001","unstructured":"Tibshirani, R., Walther, G., Hastie, T.: Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 63(2), 411\u2013423 (2001)","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"3","key":"3351_CR28","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"3351_CR29","doi-asserted-by":"crossref","unstructured":"Udell, M., Horn, C., Zadeh, R., Boyd, S., et\u00a0al.: Generalized low rank models. Foundations and Trends\u00ae in Machine Learning 9(1), 1\u2013118 (2016)","DOI":"10.1561\/2200000055"},{"issue":"9","key":"3351_CR30","doi-asserted-by":"crossref","DOI":"10.1099\/mgen.0.000867","volume":"8","author":"LA Van Poelvoorde","year":"2022","unstructured":"Van Poelvoorde, L.A., Delcourt, T., Vuylsteke, M., De Keersmaecker, S.C., Thomas, I., Van Gucht, S., Saelens, X., Roosens, N., Vanneste, K.: A general approach to identify low-frequency variants within influenza samples collected during routine surveillance. Microbial Genomics 8(9), 000867 (2022)","journal-title":"Microbial Genomics"},{"issue":"1","key":"3351_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-12-119","volume":"12","author":"O Zagordi","year":"2011","unstructured":"Zagordi, O., Bhattacharya, A., Eriksson, N., Beerenwinkel, N.: ShoRAH: estimating the genetic diversity of a mixed sample from next-generation sequencing data. BMC Bioinformatics 12(1), 1\u20135 (2011)","journal-title":"BMC Bioinformatics"},{"key":"3351_CR32","unstructured":"Zheng, Q., Lafferty, J.: Convergence analysis for rectangular matrix completion using burer-monteiro factorization and gradient descent, (2016). arXiv:1605.07051 arXiv preprint"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03351-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03351-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03351-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T09:38:39Z","timestamp":1783676319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03351-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,10]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3351"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03351-3","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,10]]},"assertion":[{"value":"11 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2026","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"32"}}