Graphminator: Kasım 2010

8 Kasım 2010 Pazartesi

Graph Tip for the 9th of November

How can be the visualisation of the same graph differ? If you are lucky to simplify the original graph, surely you can have better visualizations and better execution times.

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.

Graphminator

26 Kasım 2010 Cuma

14 Kasım 2010 Pazar

Graph of Today

8 Kasım 2010 Pazartesi

Graph Tip for the 9th of November

Hakkımda

Etiketler