{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:52:31Z","timestamp":1740135151993,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T00:00:00Z","timestamp":1544572800000},"content-version":"vor","delay-in-days":11,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["IIS-1553528"],"award-info":[{"award-number":["IIS-1553528"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s12859-018-2453-2","type":"journal-article","created":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T12:04:22Z","timestamp":1544616262000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A nearest-neighbors network model for sequence data reveals new insight into genotype distribution of a pathogen"],"prefix":"10.1186","volume":"19","author":[{"given":"Helen N.","family":"Catanese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kelly A.","family":"Brayton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assefaw H.","family":"Gebremedhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,12]]},"reference":[{"issue":"10","key":"2453_CR1","doi-asserted-by":"publisher","first-page":"372","DOI":"10.6026\/97320630006372","volume":"6","author":"P Mishra","year":"2011","unstructured":"Mishra P, Pandey PN. A graph-based clustering method applied to protein sequences. Bioinformation. 2011; 6(10):372\u20134.","journal-title":"Bioinformation"},{"key":"2453_CR2","doi-asserted-by":"crossref","unstructured":"Atkinson HJ, Morris JH, Ferrin TE, Babbitt PC. Using sequence similarity networks for visualization of relationships across diverse protein superfamilies. PLoS ONE. 2009; 4(2).","DOI":"10.1371\/journal.pone.0004345"},{"issue":"13","key":"2453_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1093\/bioinformatics\/btm220","volume":"23","author":"A Roberts","year":"2007","unstructured":"Roberts A, McMillan L, Wang W, Parker J, Rusyn I, Threadgill D. Inferring missing genotypes in large SNP panels using fast nearest-neighbor searches over sliding windows. Bioinformatics. 2007; 23(13):401\u20137.","journal-title":"Bioinformatics"},{"issue":"17","key":"2453_CR4","doi-asserted-by":"publisher","first-page":"6559","DOI":"10.1073\/pnas.0308067101","volume":"101","author":"J Weston","year":"2004","unstructured":"Weston J, Elisseeff A, Zhou D, Leslie CS, Noble WS. Protein ranking: from local to global structure in the protein similarity network. Proc Natl Acad Sci U S A. 2004; 101(17):6559\u201363.","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"6","key":"2453_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1000807","volume":"6","author":"J de Las Rivas","year":"2010","unstructured":"de Las Rivas J, Fontanillo C. Protein-protein interactions essentials: Key concepts to building and analyzing interactome networks. PLoS Comput Biol. 2010; 6(6):1\u20138.","journal-title":"PLoS Comput Biol"},{"key":"2453_CR6","doi-asserted-by":"crossref","unstructured":"Freschi V. Protein function prediction from interaction networks using a random walk ranking algorithm. In: Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering. IEEE: 2007. p. 42\u201348.","DOI":"10.1109\/BIBE.2007.4375543"},{"key":"2453_CR7","volume-title":"Proceedings of the 7th German Workshop on Artificial Life","author":"JF Knabe","year":"2006","unstructured":"Knabe JF, Nehaniv CL, Schilstra MJ. Evolutionary robustness of differentiation in genetic regulatory networks. In: Proceedings of the 7th German Workshop on Artificial Life. Berlin: Akademische Verlagsgesellschaft: 2006. p. 75\u201384."},{"issue":"5643","key":"2453_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1126\/science.1087447","volume":"302","author":"JM Stuart","year":"2003","unstructured":"Stuart JM, Segal E, Koller D, Kim SK. A Gene-Coexpression Network for Global Discovery of Conserved Genetic Modules. Science. 2003; 302(5643):249\u201355.","journal-title":"Science"},{"key":"2453_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-8-250","volume":"8","author":"C Huttenhower","year":"2007","unstructured":"Huttenhower C, Flamholz AI, Landis JN, Sahi S, Myers CL, Olszewski KL, Hibbs MA, Siemers NO, Troyanskaya OG, Coller HA. Nearest Neighbor Networks: Clustering expression data based on gene neighborhoods. BMC Bioinform. 2007; 8:1\u201313. \n                    https:\/\/doi.org\/10.1186\/1471-2105-8-250\n                    \n                  .","journal-title":"BMC Bioinform"},{"key":"2453_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-6-233","volume":"6","author":"JL Morrison","year":"2005","unstructured":"Morrison JL, Breitling R, Higham DJ, Gilbert DR. GeneRank: Using search engine technology for the analysis of microarray experiments. BMC Bioinform. 2005; 6:1\u201314.","journal-title":"BMC Bioinform"},{"key":"2453_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming RW. Error detecting and error correcting codes. Bell Syst Tech J. 1950; 29:147\u201360.","journal-title":"Bell Syst Tech J"},{"key":"2453_CR12","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI. Binary codes capable of correcting spurious insertions and deletions of ones. Sov Phys Dokl. 1966; 10:707.","journal-title":"Sov Phys Dokl"},{"issue":"3","key":"2453_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman SB, Wunsch CD. A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins. J Mol Bio. 1970; 48(3):443\u201353.","journal-title":"J Mol Bio"},{"issue":"3","key":"2453_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0001-8708(76)90202-4","volume":"20","author":"MS Waterman","year":"1976","unstructured":"Waterman MS, Smith TF, Beyer WA. Some biological sequence metrics. Adv Math. 1976; 20(3):367\u201387.","journal-title":"Adv Math"},{"issue":"C","key":"2453_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0076-6879(90)83007-V","volume":"183","author":"WR Pearson","year":"1990","unstructured":"Pearson WR. Rapid and sensitive sequence comparison with FASTP and FASTA. Methods Enzymol. 1990; 183(C):63\u201398.","journal-title":"Methods Enzymol"},{"key":"2453_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1186\/1471-2105-10-421","volume":"10","author":"C Camacho","year":"2009","unstructured":"Camacho C, Coulouris G, Avagyan V, Ma N, Papadopoulos J, Bealer K, Madden TL. BLAST+: architecture and applications. BMC Bioinform. 2009; 10:421.","journal-title":"BMC Bioinform"},{"issue":"10","key":"2453_CR17","doi-asserted-by":"publisher","first-page":"1923","DOI":"10.1109\/TPDS.2012.19","volume":"23","author":"C Wu","year":"2012","unstructured":"Wu C, Kalyanaraman A, Cannon WR. PGraph: Efficient Parallel Construction of Large-Scale Protein Sequence Homology Graphs. IEEE Trans Parallel Distrib Syst. 2012; 23(10):1923\u201333.","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"2453_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1006\/geno.1996.0614","volume":"38","author":"EG Shpaer","year":"1996","unstructured":"Shpaer EG, Robinson M, Yee D, Candlin JD, Mines R, Hunkapiller T. Sensitivity and selectivity in protein similarity searches: A comparison of Smith-Waterman in hardware to BLAST and FASTA. Genomics. 1996; 38(2):179\u201391.","journal-title":"Genomics"},{"issue":"3","key":"2453_CR19","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/0888-7543(91)90071-L","volume":"11","author":"WR Pearson","year":"1991","unstructured":"Pearson WR. Searching protein sequence libraries: Comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. Genomics. 1991; 11(3):635\u201350.","journal-title":"Genomics"},{"key":"2453_CR20","volume-title":"14th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"J Shieh","year":"2008","unstructured":"Shieh J, Keogh E. iSAX: Indexing and Mining Terabyte Sized Time Series. In: 14th ACM SIGKDD international conference on Knowledge discovery and data mining. New York: ACM: 2008. p. 623."},{"key":"2453_CR21","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases","author":"A Arasu","year":"2006","unstructured":"Arasu A, Ganti V, Kaushik R. Efficient Exact Set-Similarity Joins. In: Proceedings of the 32nd International Conference on Very Large Data Bases. Seoul: VLDB Endowment: 2006. p. 918\u201329."},{"issue":"3","key":"2453_CR22","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/bioinformatics\/btq655","volume":"27","author":"L Apeltsin","year":"2011","unstructured":"Apeltsin L, Morris JH, Babbitt PC, Ferrin TE. Improving the quality of protein similarity network clustering algorithms using the network edge weight distribution. Bioinformatics. 2011; 27(3):326\u201333.","journal-title":"Bioinformatics"},{"issue":"3","key":"2453_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00009293","volume":"17","author":"D Eppstein","year":"1997","unstructured":"Eppstein D, Paterson MS, Yao FF. On nearest neighbor graphs. Discret Comput Geom. 1997; 17(3):263\u201382.","journal-title":"Discret Comput Geom"},{"issue":"4","key":"2453_CR24","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"JL Bentley","year":"1980","unstructured":"Bentley JL. Multidimensional Divide-and-Conquer. Commun ACM. 1980; 23(4):214\u201329.","journal-title":"Commun ACM"},{"key":"2453_CR25","doi-asserted-by":"crossref","unstructured":"Clarkson KL. Fast algorithms for the all nearest neighbors problem. In: 24th Annual Symposium on Foundations of Computer Science. IEEE: 1983. p. 226\u2013232.","DOI":"10.1109\/SFCS.1983.16"},{"issue":"1","key":"2453_CR26","first-page":"1","volume":"51","author":"SM Omohundro","year":"1989","unstructured":"Omohundro SM. Five balltree construction algorithms. Int Comput Sci Inst Tech Rep. 1989; 51(1):1\u201322.","journal-title":"Int Comput Sci Inst Tech Rep"},{"issue":"2","key":"2453_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cag.2006.11.011","volume":"31","author":"J Sankaranarayanan","year":"2007","unstructured":"Sankaranarayanan J, Samet H, Varshney A. A fast all nearest neighbor algorithm for applications involving large point-clouds. Comput Graph. 2007; 31(2):157\u201374.","journal-title":"Comput Graph"},{"issue":"9","key":"2453_CR28","doi-asserted-by":"publisher","first-page":"e74113","DOI":"10.1371\/journal.pone.0074113","volume":"8","author":"A Dashti","year":"2013","unstructured":"Dashti A, Komarov I, D\u2019Souza RM. Efficient Computation of k-Nearest Neighbour Graphs for Large High-Dimensional Data Sets on GPU Clusters. PLoS ONE. 2013; 8(9):e74113.","journal-title":"PLoS ONE"},{"key":"2453_CR29","volume-title":"CIKM 2015: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management","author":"DC Anastasiu","year":"2015","unstructured":"Anastasiu DC, Karypis G. L2Knng : Fast Exact K-Nearest Neighbor Graph Construction with L2-Norm Pruning. In: CIKM 2015: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. New York: ACM: 2015. p. 791\u2013800."},{"issue":"6","key":"2453_CR30","first-page":"891","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Proceedings of the 5th ACM-SIAM Sympos. Discret Algoritm. 1998; 45(6):891\u2013923.","journal-title":"Discret Algoritm"},{"issue":"38","key":"2453_CR31","doi-asserted-by":"publisher","first-page":"15679","DOI":"10.1073\/pnas.1107769108","volume":"108","author":"PW Jones","year":"2011","unstructured":"Jones PW, Osipov A, Rokhlin V. A randomized approximate nearest neighbors algorithm. Proc Natl Acad Sci. 2011; 108(38):15679\u201386.","journal-title":"Proc Natl Acad Sci"},{"key":"2453_CR32","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"YM Zhang","year":"2013","unstructured":"Zhang YM, Huang K, Geng G, Liu CL. Fast kNN graph construction with locality sensitive hashing. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Berlin: Springer: 2013. p. 660\u201374."},{"key":"2453_CR33","volume-title":"Database Systems for Advanced Applications","author":"Y Park","year":"2014","unstructured":"Park Y, Park S, Lee S-g, Jung W. Greedy filtering: A scalable algorithm for k-nearest neighbor graph construction. In: Database Systems for Advanced Applications. Cham: Springer International Publishing: 2014. p. 327\u2013341."},{"key":"2453_CR34","volume-title":"Proceedings of the 5th international conference on Experimental Algorithms","author":"R Paredes","year":"2006","unstructured":"Paredes R, Navarro G. Practical Construction of k Nearest Neighbor Graphs in Metric Spaces. In: Proceedings of the 5th international conference on Experimental Algorithms. Berlin: Springer-Verlag: 2006. p. 85\u201397."},{"key":"2453_CR35","volume-title":"Proceedings of the 20th International Conference on World Wide Web","author":"W Dong","year":"2011","unstructured":"Dong W, Moses C, Li K. Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web. New York: ACM: 2011. p. 577\u2013586."},{"key":"2453_CR36","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"PM Vaidya","year":"1989","unstructured":"Vaidya PM. An O(n log n) algorithm for the all-nearest-neighbors Problem. Discret Comput Geom. 1989; 4:101\u201315.","journal-title":"Discret Comput Geom"},{"key":"2453_CR37","volume-title":"Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms","author":"PN Yianilos","year":"1993","unstructured":"Yianilos PN. Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. Philadelphia: SIAM: 1993. p. 311\u2013321."},{"key":"2453_CR38","volume-title":"Proceedings of the 21st VLDB Conference","author":"S Brin","year":"1995","unstructured":"Brin S. Near Neighbor Search in Large Metric Spaces. In: Proceedings of the 21st VLDB Conference. San Francisco: Morgan Kaufmann Publishers Inc.: 1995."},{"key":"2453_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/PL00009449","volume":"93","author":"KL Clarkson","year":"1999","unstructured":"Clarkson KL. Nearest Neighbor Queries in Metric Spaces. Discret Comput Geom. 1999; 93:63\u201393.","journal-title":"Discret Comput Geom"},{"issue":"1","key":"2453_CR40","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1186\/s12864-016-2686-2","volume":"17","author":"HN Catanese","year":"2016","unstructured":"Catanese HN, Brayton KA, Gebremedhin AH. RepeatAnalyzer: A Tool for Analysing and Managing Short-Sequence Repeat Data. BMC Genom. 2016; 17(1):422.","journal-title":"BMC Genom"},{"issue":"339","key":"2453_CR41","first-page":"327","volume":"29","author":"WJ Welsh","year":"1993","unstructured":"Welsh WJ. Heat shock proteins functioning as molecular chaperones: their roles in normal and stressed cells. Philos Trans R Soc Lond B Biol Sci. 1993; 29(339):327\u201333.","journal-title":"Philos Trans R Soc Lond B Biol Sci"},{"issue":"1","key":"2453_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2006-7-1-r8","volume":"7","author":"SD Brown","year":"2006","unstructured":"Brown SD, Gerlt JA, Seffernick JL, Babbitt P. A gold standard set of mechanistically diverse enzyme superfamilies. Genome Biol. 2006; 7(1):1\u201315.","journal-title":"Genome Biol"},{"issue":"11","key":"2453_CR43","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja M, Lowe DG. Scalable Nearest Neighbour Algorithms for High Dimensional Data. IEEE Trans Pattern Anal Mach Intell. 2014; 36(11):2227\u201340.","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"11","key":"2453_CR44","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman TMJ, Reingold EM. Graph drawing by force-directed placement. Softw Pract Experience. 1991; 21(11):1129\u201364.","journal-title":"Softw Pract Experience"},{"key":"2453_CR45","first-page":"1695","volume":"Complex Sy","author":"G Cs\u00e1rdi","year":"2006","unstructured":"Cs\u00e1rdi G, Nepusz T. The igraph software package for complex network research. InterJournal. 2006; Complex Sy:1695.","journal-title":"InterJournal"},{"issue":"3","key":"2453_CR46","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich DF. PageRank beyond the Web. SIAM Rev. 2015; 57(3):321\u201363.","journal-title":"SIAM Rev"},{"key":"2453_CR47","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J Stat Mech Theory Exp. 2008; 10:P10008.","journal-title":"J Stat Mech Theory Exp"},{"issue":"6","key":"2453_CR48","doi-asserted-by":"publisher","first-page":"65243","DOI":"10.1371\/journal.pone.0065243","volume":"8","author":"A Cabezas-Cruz","year":"2013","unstructured":"Cabezas-Cruz A, Passos LMF, Lis K, Kenneil R, Vald\u00e9s JJ, Ferrolho J, Tonk M, Pohl AE, Grubhoffer L, Zweygarth E, Shkap V, Ribeiro MFB, Estrada-Pe\u00f1a A, Kocan KM, de la Fuente J. Functional and Immunological Relevance of Anaplasma marginale Major Surface Protein 1a Sequence and Structural Analysis. PLoS ONE. 2013; 8(6):65243.","journal-title":"PLoS ONE"},{"key":"2453_CR49","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1101\/gr.849004","volume":"14","author":"G Crooks","year":"2004","unstructured":"Crooks G, Hon G, Chandonia J-M, Brenner SE. WebLogo: A Sequence Logo Generator. Genome Res. 2004; 14:1188\u201390.","journal-title":"Genome Res"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2453-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-018-2453-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2453-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T11:14:42Z","timestamp":1589454882000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-018-2453-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2453"],"URL":"https:\/\/doi.org\/10.1186\/s12859-018-2453-2","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"6 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2018","order":3,"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"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"475"}}