A robust biclustering method based on crossing minimization in bipartite graphs
dc.authorid | 0000-0002-8149-7113 | |
dc.contributor.author | Erten, Cesim | en_US |
dc.contributor.author | Sözdinler, Melih | en_US |
dc.date.accessioned | 2015-07-14T23:48:11Z | |
dc.date.available | 2015-07-14T23:48:11Z | |
dc.date.issued | 2009 | |
dc.department | Işık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.department | Işık University, Faculty of Engineering, Department of Computer Engineering | en_US |
dc.description.abstract | [No abstract available] | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Erten, C. & Sözdinler, M. (2009). A robust biclustering method based on crossing minimization in bipartite graphs. Paper presented at the , 5417, 439-440. doi:10.1007/978-3-642-00219-9_45 | en_US |
dc.identifier.doi | 10.1007/978-3-642-00219-9_45 | |
dc.identifier.endpage | 440 | |
dc.identifier.isbn | 9783642002182 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.scopus | 2-s2.0-68749114439 | |
dc.identifier.scopusquality | Q3 | |
dc.identifier.startpage | 439 | |
dc.identifier.uri | https://hdl.handle.net/11729/632 | |
dc.identifier.uri | http://dx.doi.org/10.1007/978-3-642-00219-9_45 | |
dc.identifier.volume | 5417 | |
dc.identifier.wos | WOS:000264579700044 | |
dc.identifier.wosquality | Q4 | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Conference Proceedings Citation Index – Science (CPCI-S) | en_US |
dc.institutionauthor | Erten, Cesim | en_US |
dc.institutionauthor | Sözdinler, Melih | en_US |
dc.institutionauthorid | 0000-0002-8149-7113 | |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Springer-Verlag Berlin | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Gene expression | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Biclustering algorithm | en_US |
dc.title | A robust biclustering method based on crossing minimization in bipartite graphs | en_US |
dc.type | Conference Object | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 632.pdf
- Boyut:
- 266.78 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version