{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:03:53Z","timestamp":1757311433578},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"S22","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2019,12,30]],"date-time":"2019-12-30T00:00:00Z","timestamp":1577664000000},"content-version":"vor","delay-in-days":29,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>Identifying different types of cancer based on gene expression data has become hotspot in bioinformatics research. Clustering cancer gene expression data from multiple cancers to their own class is a significance solution. However, the characteristics of high-dimensional and small samples of gene expression data and the noise of the data make data mining and research difficult. Although there are many effective and feasible methods to deal with this problem, the possibility remains that these methods are flawed.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>In this paper, we propose the graph regularized low-rank representation under symmetric and sparse constraints (sgLRR) method in which we introduce graph regularization based on manifold learning and symmetric sparse constraints into the traditional low-rank representation (LRR). For the sgLRR method, by means of symmetric constraint and sparse constraint, the effect of raw data noise on low-rank representation is alleviated. Further, sgLRR method preserves the important intrinsic local geometrical structures of the raw data by introducing graph regularization. We apply this method to cluster multi-cancer samples based on gene expression data, which improves the clustering quality. First, the gene expression data are decomposed by sgLRR method. And, a lowest rank representation matrix is obtained, which is symmetric and sparse. Then, an affinity matrix is constructed to perform the multi-cancer sample clustering by using a spectral clustering algorithm, i.e., normalized cuts (Ncuts). Finally, the multi-cancer samples clustering is completed.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusions<\/jats:title><jats:p>A series of comparative experiments demonstrate that the sgLRR method based on low rank representation has a great advantage and remarkable performance in the clustering of multi-cancer samples.<\/jats:p><\/jats:sec>","DOI":"10.1186\/s12859-019-3231-5","type":"journal-article","created":{"date-parts":[[2019,12,30]],"date-time":"2019-12-30T08:02:27Z","timestamp":1577692947000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Multi-cancer samples clustering via graph regularized low-rank representation method under sparse and symmetric constraints"],"prefix":"10.1186","volume":"20","author":[{"given":"Juan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Cong-Hai","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jin-Xing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ling-Yun","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Xiang-Zhen","family":"Kong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,30]]},"reference":[{"issue":"6","key":"3231_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.3322\/caac.21492","volume":"68","author":"F Bray","year":"2018","unstructured":"Bray F, Ferlay J, Soerjomataram I, Siegel RL, Torre LA, Jemal A. Global cancer statistics 2018: GLOBOCAN estimates of incidence and mortality worldwide for 36 cancers in 185 countries. CA Cancer J Clin. 2018;68(6):394\u2013424.","journal-title":"CA Cancer J Clin"},{"issue":"10","key":"3231_CR2","doi-asserted-by":"publisher","first-page":"2926","DOI":"10.1109\/TNNLS.2019.2893190","volume":"30","author":"C Feng","year":"2019","unstructured":"Feng C, Xu Y, Liu J, Gao Y, Zheng C. Supervised discriminative sparse PCA for com-characteristic gene selection and tumor classification on multiview biological data. IEEE Trans Neural Netw Learn Syst. 2019;30(10):2926\u201337.","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3231_CR3","doi-asserted-by":"publisher","first-page":"151329","DOI":"10.1109\/ACCESS.2019.2941227","volume":"7","author":"Jin-Xing Liu","year":"2019","unstructured":"Liu J-X, Feng C-M, Kong X-Z, Xu Y. Dual graph-Laplacian PCA: a closed-form solution for bi-clustering to find \u201ccheckerboard\u201d structures on gene expression data. IEEE Access. 2019, 7:151329\u201338.","journal-title":"IEEE Access"},{"key":"3231_CR4","doi-asserted-by":"crossref","unstructured":"Sadhu A, Bhattacharyya B. Discovery of cancer linked biomarker genes through common subcluster mining. In: 2016 international conference on bioinformatics and systems biology (BSB): Mar, Allahabad, India 2016. p. 1\u20135.","DOI":"10.1109\/BSB.2016.7552153"},{"issue":"5507","key":"3231_CR5","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1126\/science.1058040","volume":"291","author":"JC Venter","year":"2001","unstructured":"Venter JC, Adams MD, Myers EW, Li PW, Mural RJ, Sutton GG, Smith HO, Yandell M, Evans CA, Holt RA, et al. The sequence of the human genome. Science (New York, NY). 2001;291(5507):1304\u201351.","journal-title":"Science (New York, NY)"},{"issue":"4","key":"3231_CR6","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1007\/s10618-013-0320-3","volume":"28","author":"D Mavroeidis","year":"2014","unstructured":"Mavroeidis D, Marchiori E. Feature selection for k-means clustering stability: theoretical analysis and an algorithm. Data Min Knowl Disc. 2014;28(4):918\u201360.","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"3231_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TNB.2011.2144998","volume":"10","author":"CH Zheng","year":"2011","unstructured":"Zheng CH, Ng TY, Zhang L, Shiu CK, Wang HQ. Tumor classification based on non-negative matrix factorization using gene expression data. IEEE Trans NanoBiosci. 2011;10(2):86\u201393.","journal-title":"IEEE Trans NanoBiosci"},{"issue":"2","key":"3231_CR8","first-page":"87","volume":"7","author":"M Pooladi","year":"2014","unstructured":"Pooladi M, Tavirani MR, Hashemi M, HesamiTackallou S, Abad SKR, Moradi A, Zali AR, Mousavi M, Dalvand LF, Rakhshan A, et al. Cluster and principal component analysis of human glioblastoma multiforme (GBM) tumor proteome. Iran J Cancer Prevent. 2014;7(2):87\u201395.","journal-title":"Iran J Cancer Prevent"},{"key":"3231_CR9","unstructured":"Liu GC, Lin ZC, Yu Y. Robust subspace segmentation by low-rank representation. In: Proceedings of the 27th international conference on machine learning (ICML-10): 2010. 2010."},{"key":"3231_CR10","unstructured":"Lu C, Feng J, Lin Z, Mei T, Yan S. Subspace clustering by block diagonal representation. IEEE Trans Pattern Anal Mach Intell. 2018:1\u20131."},{"key":"3231_CR11","unstructured":"Chen CF, Wei CP, Wang YF. Low-rank matrix recovery with structural incoherence for robust face recognition. In: 2012 IEEE conference on computer vision and pattern recognition: Jun. 2012. p. 2618\u201325."},{"issue":"3","key":"3231_CR12","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0059377","volume":"8","author":"Y Cui","year":"2013","unstructured":"Cui Y, Zheng CH, Yang J. Identifying subspace gene clusters from microarray data using low-rank representation. PLoS One. 2013;8(3):e59377.","journal-title":"PLoS One"},{"issue":"7","key":"3231_CR13","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/TPAMI.2012.274","volume":"35","author":"ZY Zhang","year":"2013","unstructured":"Zhang ZY, Zhao KK. Low-rank matrix approximation with manifold regularization. IEEE Trans Pattern Anal Mach Intell. 2013;35(7):1717\u201329.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3231_CR14","doi-asserted-by":"crossref","unstructured":"Liu GC, Yan SC. Latent low-rank representation for subspace segmentation and feature extraction. In: 2011 international conference on computer vision: Nov.; Barcelona, Spain 2011. p. 1615\u20131622.","DOI":"10.1109\/ICCV.2011.6126422"},{"key":"#cr-split#-3231_CR15.1","doi-asserted-by":"crossref","unstructured":"Ni YZ, Sun J, Yuan XT, Yan SC, Cheong LF. Robust low-rank subspace segmentation with semidefinite guarantees. In: Proceedings of the 2010 IEEE international conference on data mining workshops (ICDMW '10): Dec.","DOI":"10.1109\/ICDMW.2010.64"},{"key":"#cr-split#-3231_CR15.2","unstructured":"Sydney, NSW, Australia, IEEE Computer Society 2010. p. 1179-1188."},{"key":"3231_CR16","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.knosys.2017.02.031","volume":"127","author":"J Chen","year":"2017","unstructured":"Chen J, Mao H, Sang Y, Yi Z. Subspace clustering using a symmetric low-rank representation. Knowl-Based Syst. 2017;127:46\u201357.","journal-title":"Knowl-Based Syst"},{"issue":"12","key":"3231_CR17","doi-asserted-by":"publisher","first-page":"4918","DOI":"10.1109\/TIP.2015.2472277","volume":"24","author":"M Yin","year":"2015","unstructured":"Yin M, Gao JB, Lin ZC, Shi QF, Guo Y. Dual graph regularized latent low-rank representation for subspace clustering. IEEE Trans Image Process. 2015;24(12):4918\u201333.","journal-title":"IEEE Trans Image Process"},{"issue":"5500","key":"3231_CR18","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum JB, de Silva V, Langford JC. A global geometric framework for nonlinear dimensionality reduction. Science (New York, NY). 2000;290(5500):2319\u201323.","journal-title":"Science (New York, NY)"},{"issue":"5500","key":"3231_CR19","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis ST, Saul LK. Nonlinear dimensionality reduction by locally linear embedding. Science (New York, NY). 2000;290(5500):2323\u20136.","journal-title":"Science (New York, NY)"},{"key":"3231_CR20","volume-title":"Locality preserving projections","author":"X He","year":"2005","unstructured":"He X. Locality preserving projections. Chicago: University of Chicago; 2005."},{"issue":"1","key":"3231_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S1064827502419154","volume":"26","author":"Z Zhang","year":"2006","unstructured":"Zhang Z, Zha H. Principal manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM J Sci Comput. 2006;26(1):313\u201338.","journal-title":"SIAM J Sci Comput"},{"key":"3231_CR22","doi-asserted-by":"crossref","unstructured":"Belkin M, Niyogi P. Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Proceedings of the 14th international conference on neural information processing systems: natural and synthetic: Dec.; Vancouver, British Columbia, Canada. MIT Press 2001. p. 585\u2013591.","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"3231_CR23","first-page":"44","volume-title":"Computer vision \u2013 ECCV 2006","author":"T Lin","year":"2006","unstructured":"Lin T, Zha H, Lee SU. Riemannian manifold learning for nonlinear dimensionality reduction. In: Leonardis A, Bischof H, Pinz A, editors. Computer vision \u2013 ECCV 2006. Berlin\/Heidelberg: Springer; 2006. p. 44\u201355."},{"issue":"3","key":"3231_CR24","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TPAMI.2015.2462360","volume":"38","author":"M Yin","year":"2016","unstructured":"Yin M, Gao J, Lin Z. Laplacian regularized low-rank representation and its applications. IEEE Trans Pattern Anal Mach Intell. 2016;38(3):504\u201317.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"9","key":"3231_CR25","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1109\/TKDE.2010.259","volume":"23","author":"XF He","year":"2011","unstructured":"He XF, Cai D, Shao YL, Bao HJ, Han JW. Laplacian regularized Gaussian mixture model for data clustering. IEEE Trans Knowl Data Eng. 2011;23(9):1406\u201318.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3231_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.compbiolchem.2016.09.014","volume":"65","author":"YX Wang","year":"2016","unstructured":"Wang YX, Liu JX, Gao YL, Zheng CH, Shang JL. Differentially expressed genes selection via Laplacian regularized low-rank representation method. Comput Biol Chem. 2016;65:185\u201392.","journal-title":"Comput Biol Chem"},{"key":"3231_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCBB.2016.2599867","volume":"7","author":"J Wang","year":"2018","unstructured":"Wang J, Liu JX, Zheng CH, Wang YX, Kong XZ, Weng CG. A mixed-norm Laplacian regularized low-rank representation method for tumor samples clustering. IEEE\/ACM Trans Comput Biol Bioinform. 2018;7:1\u20131.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"1A","key":"3231_CR28","first-page":"A68","volume":"19","author":"K Tomczak","year":"2015","unstructured":"Tomczak K, Czerwinska P, Wiznerowicz M. The Cancer Genome Atlas (TCGA): an immeasurable source of knowledge. Contemp Oncol (Poznan, Poland). 2015;19(1A):A68\u201377.","journal-title":"Contemp Oncol (Poznan, Poland)"},{"issue":"6","key":"3231_CR29","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 2003;15(6):1373\u201396.","journal-title":"Neural Comput"},{"key":"3231_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.neucom.2012.08.070","volume":"124","author":"SL Sun","year":"2014","unstructured":"Sun SL, Hussain Z, Shawe-Taylor J. Manifold-preserving graph reduction for sparse semi-supervised learning. Neurocomputing. 2014;124:13\u201321.","journal-title":"Neurocomputing"},{"key":"3231_CR31","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s EJ, Recht B. Exact matrix completion via convex optimization. Found Comput Math. 2009;9:717\u201372.","journal-title":"Found Comput Math"},{"key":"3231_CR32","doi-asserted-by":"crossref","unstructured":"Keshavan RH, Montanari A, Oh S. Matrix completion from noisy entries. In: Proceedings of the 22nd international conference on neural information processing systems. 2009. p. 952\u201360.","DOI":"10.1109\/ISIT.2009.5205567"},{"issue":"3","key":"3231_CR33","first-page":"1","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s EJ, Li X, Ma Y, Wright J. Robust principal component analysis? ACM. 2011;58(3):1\u201337.","journal-title":"ACM"},{"issue":"1","key":"3231_CR34","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"GC Liu","year":"2013","unstructured":"Liu GC, Lin ZC, Yan SC, Sun J, Yu Y, Ma Y. Robust recovery of subspace structures by low-rank representation. IEEE Trans Pattern Anal Mach Intell. 2013;35(1):171\u201384.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3231_CR35","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1155\/2017\/4216797","volume":"2017","author":"LY Dai","year":"2017","unstructured":"Dai LY, Feng CM, Liu JX, Zheng CH, Yu J, Hou MX. Robust nonnegative matrix factorization via joint graph Laplacian and discriminative information for identifying differentially expressed genes. Complexity. 2017;2017:11.","journal-title":"Complexity"},{"key":"3231_CR36","unstructured":"Lin Z, Liu R, Su Z. Linearized alternating direction method with adaptive penalty for low-rank representation. Adv Neural Inf Proces Syst. 2011:612\u201320."},{"key":"3231_CR37","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.sigpro.2018.02.010","volume":"148","author":"Y Oktara","year":"2018","unstructured":"Oktara Y, Turkan M. A review of sparsity-based clustering methods. Signal Process. 2018;148:20\u201330.","journal-title":"Signal Process"},{"key":"3231_CR38","unstructured":"Lin Z, Chen M, Ma Y. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. Eprint Arxiv. 2010;"},{"issue":"4","key":"3231_CR39","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2008","unstructured":"Cai J-F, Cand\u00e8s EJ, Shen Z. A singular value thresholding algorithm for matrix completion. SIAM J Optim. 2008;20(4):1956\u201382.","journal-title":"SIAM J Optim"},{"issue":"8","key":"3231_CR40","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"JB Shi","year":"2000","unstructured":"Shi JB, Malik J. Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell. 2000;22(8):888\u2013905.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"8","key":"3231_CR41","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1002\/gepi.22164","volume":"42","author":"SJ Teran Hidalgo","year":"2018","unstructured":"Teran Hidalgo SJ, Zhu T, Wu M, Ma S. Overlapping clustering of gene expression data using penalized weighted normalized cut. Genet Epidemiol. 2018;42(8):796\u2013811.","journal-title":"Genet Epidemiol"},{"issue":"4","key":"3231_CR42","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TITB.2009.2018115","volume":"13","author":"CH Zheng","year":"2009","unstructured":"Zheng CH, Huang DS, Zhang L, Kong XZ. Tumor clustering using nonnegative matrix factorization with gene selection. IEEE Trans Inf Technol Biomed. 2009;13(4):599\u2013607.","journal-title":"IEEE Trans Inf Technol Biomed"},{"issue":"2","key":"3231_CR43","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/0005-2795(75)90109-9","volume":"405","author":"BW Matthews","year":"1975","unstructured":"Matthews BW. Comparison of the predicted and observed secondary structure of T4 phage lysozyme. Biochimica et Biophysica Acta (BBA) - Protein Structure. 1975;405(2):442\u201351.","journal-title":"Biochimica et Biophysica Acta (BBA) - Protein Structure"},{"issue":"336","key":"3231_CR44","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand WM. Objective criteria for the evaluation of clustering methods. J Am Stat Assoc. 1971;66(336):846\u201350.","journal-title":"J Am Stat Assoc"},{"key":"3231_CR45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"C Manning","year":"2008","unstructured":"Manning C, Raghavan P, Sch\u00fctze H. Introduction to information retrieval, vol. 1. Cambridge: Cambridge University Press; 2008."},{"issue":"3","key":"3231_CR46","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1109\/TSMCA.2011.2170414","volume":"42","author":"H Zhu","year":"2012","unstructured":"Zhu H, Zhou MC, Alkins R. Group role assignment via a Kuhn-Munkres algorithm-based solution. IEEE Trans Syst Man Cybernet Part A Syst Hum. 2012;42(3):739\u201350.","journal-title":"IEEE Trans Syst Man Cybernet Part A Syst Hum"},{"issue":"6","key":"3231_CR47","doi-asserted-by":"publisher","first-page":"e0177678","DOI":"10.1371\/journal.pone.0177678","volume":"12","author":"S Boughorbel","year":"2017","unstructured":"Boughorbel S, Jarray F, El-Anbari M. Optimal classifier for imbalanced data using Matthews Correlation Coefficient metric. PLoS One. 2017;12(6):e0177678.","journal-title":"PLoS One"},{"issue":"3","key":"3231_CR48","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.celrep.2013.09.036","volume":"5","author":"G Liu","year":"2013","unstructured":"Liu G, Mercer TR, Shearwood A-MJ, Siira SJ, Hibbs ME, Mattick JS, Rackham O, Filipovska A. Mapping of mitochondrial RNA-protein interactions by digital RNase footprinting. Cell Rep. 2013;5(3):839\u201348.","journal-title":"Cell Rep"},{"key":"3231_CR49","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-04962-0_53","volume":"51","author":"Q Gu","year":"2009","unstructured":"Gu Q, Zhu L, Cai Z. Evaluation measures of the classification performance of imbalanced data sets. Commun Comput Inform Sci. 2009;51:461\u201371.","journal-title":"Commun Comput Inform Sci"},{"issue":"5","key":"3231_CR50","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1093\/bioinformatics\/16.5.412","volume":"16","author":"P Baldi","year":"2000","unstructured":"Baldi P, Brunak S, Chauvin Y, Andersen CA, Nielsen H. Assessing the accuracy of prediction algorithms for classification: an overview. Bioinformatics (Oxford, England). 2000;16(5):412\u201324.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"3231_CR51","unstructured":"Arthur D, Vassilvitskii S. k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms; New Orleans, Louisiana. 1283494: Society for Industrial and Applied Mathematics 2007. p. 1027\u201335."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-3231-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-019-3231-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-3231-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T09:16:52Z","timestamp":1722244612000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-019-3231-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":52,"journal-issue":{"issue":"S22","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3231"],"URL":"https:\/\/doi.org\/10.1186\/s12859-019-3231-5","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"30 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"718"}}