{"id":"https://openalex.org/W2081742431","doi":"https://doi.org/10.1137/060664112","title":"Approximation Algorithms for Biclustering Problems","display_name":"Approximation Algorithms for Biclustering Problems","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2081742431","doi":"https://doi.org/10.1137/060664112","mag":"2081742431"},"language":"en","primary_location":{"id":"doi:10.1137/060664112","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060664112","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://scholars.cityu.edu.hk/en/publications/approximation-algorithms-for-biclustering-problems","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065315257","display_name":"Lusheng Wang","orcid":"https://orcid.org/0000-0002-4344-8791"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lusheng Wang","raw_affiliation_strings":["lwang@cs.cityu.edu.hk and liuxw@cs.cityu.edu.hk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"lwang@cs.cityu.edu.hk and liuxw@cs.cityu.edu.hk#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079714822","display_name":"Yu Lin","orcid":"https://orcid.org/0000-0001-6339-2644"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu Lin","raw_affiliation_strings":["linyu@cs.cityu.edu.hk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"linyu@cs.cityu.edu.hk#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100437902","display_name":"Xiaowen Liu","orcid":"https://orcid.org/0000-0003-4139-1127"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaowen Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.11255431,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"4","first_page":"1504","last_page":"1518"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10885","display_name":"Gene expression and cancer classification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10885","display_name":"Gene expression and cancer classification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7088190317153931},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6395891904830933},{"id":"https://openalex.org/keywords/biclustering","display_name":"Biclustering","score":0.6366262435913086},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5503196716308594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5358012914657593},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5258282423019409},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.504052996635437},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43014010787010193},{"id":"https://openalex.org/keywords/row-and-column-spaces","display_name":"Row and column spaces","score":0.41803693771362305},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.403672456741333},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.33641666173934937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32448893785476685}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7088190317153931},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6395891904830933},{"id":"https://openalex.org/C144817290","wikidata":"https://www.wikidata.org/wiki/Q2976575","display_name":"Biclustering","level":5,"score":0.6366262435913086},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5503196716308594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5358012914657593},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5258282423019409},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.504052996635437},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43014010787010193},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.41803693771362305},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.403672456741333},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.33641666173934937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32448893785476685},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/060664112","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060664112","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"is_oa":true,"landing_page_url":"https://scholars.cityu.edu.hk/en/publications/approximation-algorithms-for-biclustering-problems","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:pure.atira.dk:publications/aab3cb7d-2950-4f54-b214-41155fab006b","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/aab3cb7d-2950-4f54-b214-41155fab006b","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang, L, Lin, Y & Liu, X 2008, 'Approximation algorithms for biclustering problems', SIAM Journal on Computing, vol. 38, no. 4, pp. 1504-1518. https://doi.org/10.1137/060664112","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://scholars.cityu.edu.hk/en/publications/approximation-algorithms-for-biclustering-problems","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W214644695","https://openalex.org/W1492208811","https://openalex.org/W1493217831","https://openalex.org/W2021129827","https://openalex.org/W2027048490","https://openalex.org/W2027514721","https://openalex.org/W2040482262","https://openalex.org/W2041258613","https://openalex.org/W2046863812","https://openalex.org/W2047386086","https://openalex.org/W2066849581","https://openalex.org/W2098601504","https://openalex.org/W2099785391","https://openalex.org/W2109970232","https://openalex.org/W2110544411","https://openalex.org/W2113387206","https://openalex.org/W2116173654","https://openalex.org/W2126877147","https://openalex.org/W2129256542","https://openalex.org/W2130095365","https://openalex.org/W2135000328","https://openalex.org/W2135187880","https://openalex.org/W2135306061","https://openalex.org/W2143364665","https://openalex.org/W2144544802","https://openalex.org/W2144792853","https://openalex.org/W2148066219","https://openalex.org/W2150718242","https://openalex.org/W2150926065"],"related_works":["https://openalex.org/W2313440505","https://openalex.org/W3123744736","https://openalex.org/W1505848319","https://openalex.org/W2137691148","https://openalex.org/W2152668278","https://openalex.org/W3084408672","https://openalex.org/W2506426934","https://openalex.org/W2397510698","https://openalex.org/W2079846801","https://openalex.org/W1979810043"],"abstract_inverted_index":{"One":[0],"of":[1,8,15,19,45,60,97,169,194],"the":[2,6,34,46,49,54,61,95,100,103,106,135,141,144,170,179,188,192,199],"main":[3],"goals":[4],"in":[5,102,140],"analysis":[7],"microarray":[9,211],"data":[10,212],"is":[11,33,78,109,115,146,152,198],"to":[12,79,116,181],"identify":[13],"groups":[14,18],"genes":[16],"and":[17,25,53,69,72,87,89,105,124,129,143,150,161],"experimental":[20],"conditions":[21],"(including":[22],"environments,":[23],"individuals,":[24],"tissues)":[26],"that":[27,94,134,156,202],"exhibit":[28],"similar":[29],"expression":[30],"patterns.":[31],"This":[32],"so-called":[35],"biclustering":[36,47],"problem.":[37,57],"In":[38],"this":[39,197],"paper,":[40],"we":[41,176],"consider":[42],"two":[43,171,189],"variations":[44],"problem:":[48],"consensus":[50,75,91,107],"submatrix":[51,56,76,84,104,113,121,142],"problem":[52,77,114],"bottleneck":[55,112],"The":[58,74,111],"input":[59],"problems":[62,158],"contains":[63],"an":[64,81,118,126],"$m\\times":[65],"n$":[66],"matrix":[67],"A":[68],"integers":[70],"l":[71],"k.":[73],"find":[80,117],"$l\\times":[82,119],"k$":[83,120],"with":[85,122,205],"$l<m$":[86,123],"$k<n$":[88],"a":[90,130],"vector":[92,108,132,145],"such":[93,133],"sum":[96],"distances":[98],"between":[99,137],"rows":[101],"minimized.":[110,153],"$k<n$,":[125],"integer":[127],"d":[128,149,151],"center":[131],"distance":[136],"every":[138],"row":[139],"at":[147],"most":[148],"We":[154],"show":[155],"both":[157],"are":[159,208],"NP-hard":[160],"give":[162],"randomized":[163],"approximation":[164,185,203],"algorithms":[165,180,204],"for":[166,187,210],"special":[167],"cases":[168],"problems.":[172,190],"Using":[173],"standard":[174],"techniques,":[175],"can":[177],"derandomize":[178],"get":[182],"polynomial":[183],"time":[184,201],"schemes":[186],"To":[191],"best":[193],"our":[195],"knowledge,":[196],"first":[200],"guaranteed":[206],"ratios":[207],"presented":[209],"analysis.":[213]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-09T07:27:16.801131","created_date":"2025-09-09T00:00:00"}