Melih Sözdinler
Title
Cited by
Cited by
Year
Crossing minimization in weighted bipartite graphs
OA Çakıroḡlu, C Erten, Ö Karataş, M Sözdinler
International Workshop on Experimental and Efficient Algorithms, 122-135, 2007
182007
Improving performances of suboptimal greedy iterative biclustering heuristics via localization
C Erten, M Sözdinler
Bioinformatics 26 (20), 2594-2600, 2010
112010
Biclustering expression data based on expanding localized substructures
C Erten, M Sözdinler
International Conference on Bioinformatics and Computational Biology, 224-235, 2009
82009
A robust biclustering method based on crossing minimization in bipartite graphs
C Erten, M Sözdinler
International Symposium on Graph Drawing, 439-440, 2008
42008
Reliability-Oriented bioinformatic networks visualization
AE Aladağ, C Erten, M Sözdinler
Bioinformatics 27 (11), 1583-1584, 2011
32011
Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming
M Sözdinler, C Özturan
2018 IEEE International Conference on Computational Science and Engineering …, 2018
12018
An integrated model for visualizing biclusters from gene expression data and PPI networks
AE Aladağ, C Erten, M Sözdinler
Proceedings of the International Symposium on Biocomputing, 1-8, 2010
12010
Weighted bipartite crossing minimization applications on biclustering and graph unions
M Sözdinler
Işık Üniversitesi, 2009
2009
The system can't perform the operation now. Try again later.
Articles 1–8