{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:07:27Z","timestamp":1743084447801,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642246685"},{"type":"electronic","value":"9783642246692"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24669-2_36","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T10:05:36Z","timestamp":1319277936000},"page":"375-386","source":"Crossref","is-referenced-by-count":9,"title":["Clustering Nodes in Large-Scale Biological Networks Using External Memory Algorithms"],"prefix":"10.1007","author":[{"given":"Ahmed Shamsul","family":"Arefin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Inostroza-Ponta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Mathieson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Regina","family":"Berretta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Moscato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Inostroza-Ponta, M.: An Integrated and Scalable Approach Based on Combinatorial Optimization Techniques for the Analysis of Microarray Data, PhD thesis, The University of Newcastle, Australia (2008)"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0167-7152(02)00421-2","volume":"62","author":"J.M. Gonzalez-Barrios","year":"2003","unstructured":"Gonzalez-Barrios, J.M., Quiroz, A.J.: A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree. Statistics and Probability Letters\u00a062(3), 23\u201334 (2003)","journal-title":"Statistics and Probability Letters"},{"key":"36_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-76931-6_14","volume-title":"Progress in Artificial Life","author":"M. Inostroza-Ponta","year":"2007","unstructured":"Inostroza-Ponta, M., Mendes, A., Berretta, R., Moscato, P.: An integrated QAP-based approach to visualize patterns of gene expression similarity. In: Randall, M., Abbass, H.A., Wiles, J. (eds.) ACAL 2007. LNCS (LNAI), vol.\u00a04828, pp. 156\u2013167. Springer, Heidelberg (2007)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Dementiev, R., Sanders, P., Schultes, D., Sibeyn, J.: Engineering an external memory minimum spanning tree algorithm. In: 3rd IFIP Intl. Conf. on Theoretical Computer Science, pp. 195\u2013208 (2004)","DOI":"10.1007\/1-4020-8141-3_17"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-27810-8_40","volume-title":"Algorithm Theory - SWAT 2004","author":"J. Sibeyn","year":"2004","unstructured":"Sibeyn, J.: External Connected Components. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 468\u2013479. Springer, Heidelberg (2004)"},{"key":"36_CR6","unstructured":"Schultes, D.: External memory spanning forests and connected components, Technical report (2004), http:\/\/algo2.iti.kit.edu\/dementiev\/files\/cc.pdf"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Vitter, J.S.: External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys\u00a033 (2001)","DOI":"10.1145\/384192.384193"},{"issue":"4","key":"36_CR8","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1093\/bioinformatics\/18.4.536","volume":"18","author":"Y. Xu","year":"2002","unstructured":"Xu, Y., Olman, V., Xu, D.: Clustering Gene Expression Data Using a Graph-Theoretic Approach: An Application of Minimum Spanning Tree. Bioinformatics\u00a018(4), 526\u2013535 (2002)","journal-title":"Bioinformatics"},{"key":"36_CR9","first-page":"73","volume-title":"Proc. of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006)","author":"O. Grygorash","year":"2006","unstructured":"Grygorash, O., Zhou, Y., Jorgensen, Z.: Minimum Spanning Tree Based Clustering Algorithms. In: Proc. of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), pp. 73\u201381. IEEE Computer Society, Washington, DC, USA (2006)"},{"issue":"3","key":"36_CR10","first-page":"276","volume":"1","author":"J. Doowang","year":"2006","unstructured":"Doowang, J.: An external memory approach to computing the maximal repeats across classes of dna sequences. Asian Journal of Health and Information Sciences\u00a01(3), 276\u2013295 (2006)","journal-title":"Asian Journal of Health and Information Sciences"},{"key":"36_CR11","first-page":"30","volume":"13","author":"J.H. Choi","year":"2002","unstructured":"Choi, J.H., Cho, H.G.: Analysis of common k-mers for whole genome sequences using SSB-tree. Japanese Society for Bioinformatics\u00a013, 30\u201341 (2002)","journal-title":"Japanese Society for Bioinformatics"},{"key":"36_CR12","first-page":"139","volume-title":"SODA 1995: Proceedings of the Sixth Annual ACM-SIAM","author":"Y. Chiang","year":"1995","unstructured":"Chiang, Y., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., et al.: External-memory graph algorithms, In. In: SODA 1995: Proceedings of the Sixth Annual ACM-SIAM, pp. 139\u2013149. Society for IAM, Philadelphia (1995)"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Abello, J., Buchsbaum, A.L., Westbrook, J.R.: A functional approach to external graph algorithms. Algorithmica, 332\u2013343 (1998)","DOI":"10.1007\/3-540-68530-8_28"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"van de Vijver, M.J., He, Y.D., van\u2019t Veer, L.J., Dai, H., et al.: A gene-expression signature as a predictor of survival in breast cancer. N. Engl. J. Med.\u00a0347(25) (2002)","DOI":"10.1056\/NEJMoa021967"},{"key":"36_CR15","unstructured":"Fayyad, U.M., Irarni, K.B.: Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. In: IJCAI, pp. 1022\u20131029 (1993)"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24653-4_3","volume-title":"Applications of Evolutionary Computing","author":"C. Cotta","year":"2004","unstructured":"Cotta, C., Sloper, C., Moscato, P.: Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data. In: Raidl, G.R., Cagnoni, S., Branke, J., Corne, D.W., Drechsler, R., Jin, Y., Johnson, C.G., Machado, P., Marchiori, E., Rothlauf, F., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2004. LNCS, vol.\u00a03005, pp. 21\u201330. Springer, Heidelberg (2004)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Rocha de Paula, M., Ravetti, M.G., Rosso, O.A., Berretta, R., Moscato, P.: Differences in abundances of cell-signalling proteins in blood reveal novel biomarkers for early detection of clinical Alzheimer\u2019s disease. PLoS ONE\u00a06(e17481) (2011)","DOI":"10.1371\/journal.pone.0017481"},{"issue":"3","key":"36_CR18","first-page":"759","volume":"30","author":"X.P. Jiang","year":"2010","unstructured":"Jiang, X.P., Elliot, R.L., Head, J.F.: Manipulation of iron transporter genes results in the suppression of human and mouse mammary adenocarcinomas. Anticancer Res.\u00a030(3), 759\u2013765 (2010)","journal-title":"Anticancer Res."},{"key":"36_CR19","unstructured":"Shamir, R., Sharan, R.: CLICK: A Clustering Algorithm with Applications to Gene Expression Analysis. In: Proc. of ISMB, pp. 307\u2013316 (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24669-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T08:04:26Z","timestamp":1560845066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24669-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642246685","9783642246692"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24669-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}