{"language":[{"iso":"eng"}],"alternative_title":["Methods in Molecular Biology"],"page":"215–231","_id":"11847","day":"04","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","editor":[{"full_name":"Canzar, Stefan","last_name":"Canzar","first_name":"Stefan"},{"full_name":"Rojas Ringeling, Francisca","last_name":"Rojas Ringeling","first_name":"Francisca"}],"extern":"1","date_updated":"2023-02-17T09:34:26Z","publication_status":"published","article_processing_charge":"No","external_id":{"pmid":["31583641"]},"doi":"10.1007/978-1-4939-9873-9_16","title":"Vienna Graph Clustering","publication_identifier":{"issn":["1064-3745"],"eissn":["1940-6029"],"isbn":["9781493998722"],"eisbn":["9781493998739"]},"date_created":"2022-08-16T06:54:48Z","abstract":[{"lang":"eng","text":"This paper serves as a user guide to the Vienna graph clustering framework. We review our general memetic algorithm, VieClus, to tackle the graph clustering problem. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. After giving a description of the algorithms employed, we establish the connection of the graph clustering problem to protein–protein interaction networks and moreover give a description on how the software can be used, what file formats are expected, and how this can be used to find functional groups in protein–protein interaction networks."}],"pmid":1,"author":[{"first_name":"Sonja","last_name":"Biedermann","full_name":"Biedermann, Sonja"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"},{"first_name":"Bernhard","last_name":"Schuster","full_name":"Schuster, Bernhard"}],"publisher":"Springer Nature","series_title":"MIMB","intvolume":" 2074","year":"2019","citation":{"apa":"Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2019). Vienna Graph Clustering. In S. Canzar & F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks (Vol. 2074, pp. 215–231). Springer Nature. https://doi.org/10.1007/978-1-4939-9873-9_16","ama":"Biedermann S, Henzinger MH, Schulz C, Schuster B. Vienna Graph Clustering. In: Canzar S, Rojas Ringeling F, eds. Protein-Protein Interaction Networks. Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:10.1007/978-1-4939-9873-9_16","ista":"Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering. In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074, 215–231.","ieee":"S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.","chicago":"Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Vienna Graph Clustering.” In Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature, 2019. https://doi.org/10.1007/978-1-4939-9873-9_16.","short":"S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F. Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature, 2019, pp. 215–231.","mla":"Biedermann, Sonja, et al. “Vienna Graph Clustering.” Protein-Protein Interaction Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074, Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16."},"date_published":"2019-10-04T00:00:00Z","volume":2074,"publication":"Protein-Protein Interaction Networks","type":"book_chapter","oa_version":"None","status":"public","scopus_import":"1"}