Graphminator

31 Mart 2010 Çarşamba

Graph of Day 19: Worldcup Visualizations

I found interesting studies of some research group. They visualize world cup history according to some semantics like participations, success etc. using graph layouts.

30 Mart 2010 Salı

Visual Web Mining

During the Internet surfing, found a research website with interesting screens. They aim to visualize the web using appropriate mining techniques. Some of their results are confusing but seems to be beautiful.

Graph of Day 18: Network of Electronic Devices

Network of electronic devices visualized with orthogonal layout.

29 Mart 2010 Pazartesi

Graph of Day 17: Political Networks

They have chosen American politics visualized using Radial-Circular layout.

28 Mart 2010 Pazar

Graph of Day 16: PPI Network 2

Recently, I try to propose a new model for the visualization of PPI networks. The main problem of the model is how to collect subgraphs and how to visualize. There are over 165000 interactions meaning edges and over 6000 nodes. I do not want to code existing algorithms since then the production of subgraphs are done with C++ using OGDF. Interestingly, one of the subgraphs has the property of very high disconnectivity. Here are my first snapshots using Circular and Symmetric layouts in GDE graph editor.

Circular

Symmetric

My Publications

Journal Papers

3. Ahmet Emre Aladağ, Cesim Erten, Melih Sozdinler, "Robinviz: Reliability Oriented Bioinformatic Networks Visualization", Bioinformatics(2011) 27(11):1583-1584, doi: 10.1093/bioinformatics/btr178,

http://bioinformatics.oxfordjournals.org/content/27/11/1583

website: http://code.google.com/p/robinviz/

2. Cesim Erten, Melih Sozdinler, "Improving performances of suboptimal greedy iterative biclustering heuristics via localization" Bioinformatics 26(20): 2594-2600 ,2010,

website: http://code.google.com/p/biclustering/

1. A.O. Cakiroglu, C. Erten, O. Karatas, M. Sozdinler, "Crossing Minimization in Weighted Bipartite Graphs", Journal of Discrete Algorithms (JDA), vol.7, no.4, pp.439-452, 2009.

Conference Papers

4. A. E. Aladağ, C. Erten, M. Sozdinler,"An integrated model for visualizing biclusters from gene expression data and PPI networks", Proc. Int. Symp. on Biocomputing (ISB), ACM New York, NY, USA, pp.1-8, 2010

3. C. Erten, M. Sozdinler, "Biclustering Expression Data Based on Expanding Localized Substructures", Proc. Int. Conf. on Bioinformatics and Computational Biology (BICOB), Lecture Notes in Bioinformatics 5462, pp.224-235, 2009.

2. C. Erten, M. Sozdinler, "A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs", Proc. Int. Symp. Graph Drawing (GD), Lecture Notes in Computer Science 5417, pp. 439-440, 2009.

1. A.O. Cakiroglu, C. Erten, O. Karatas, M. Sozdinler, "Crossing Minimization in Weighted Bipartite Graphs", Proc. 6th Workshop on Experimental Algorithms (WEA), Lecture Notes in Computer Science 4525, pp. 122-135, 2007.