{"id":"https://openalex.org/W102742865","doi":null,"title":"A minimum spanning tree based clustering algorithm for high throughput biological data","display_name":"A minimum spanning tree based clustering algorithm for high throughput biological data","alternate_titles":[],"publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W102742865","mag":"102742865"},"language":"en","primary_location":{"id":"mag:102742865","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=2126230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W102742865"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027942567","display_name":"Burak Ek\u015fio\u011flu","orcid":"https://orcid.org/0000-0002-2999-6783","observed_orcids":["https://orcid.org/0000-0002-2999-6783"]},"institutions":[{"id":"https://openalex.org/I99041443","display_name":"Mississippi State University","ror":"https://ror.org/0432jq872","country_code":"US","type":"education","lineage":["https://openalex.org/I4210141039","https://openalex.org/I99041443"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Burak Ek\u015fio\u011flu","raw_affiliation_strings":["Mississippi State University *"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mississippi State University *","institution_ids":["https://openalex.org/I99041443"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033240437","display_name":"Harun Pirim","orcid":"https://orcid.org/0000-0001-5273-5955","observed_orcids":["https://orcid.org/0000-0001-5273-5955"]},"institutions":[{"id":"https://openalex.org/I99041443","display_name":"Mississippi State University","ror":"https://ror.org/0432jq872","country_code":"US","type":"education","lineage":["https://openalex.org/I4210141039","https://openalex.org/I99041443"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Harun Pirim","raw_affiliation_strings":["Mississippi State University *"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mississippi State University *","institution_ids":["https://openalex.org/I99041443"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99041443"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9672999978065491,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9672999978065491,"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"}},{"id":"https://openalex.org/T10885","display_name":"Gene expression and cancer classification","score":0.01360000018030405,"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.011099999770522118,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/gene-clustering","display_name":"gene clustering","score":0.652999997138977},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.8289999961853027},{"id":"https://openalex.org/keywords/heuristic-clustering","display_name":"heuristic clustering","score":0.5189999938011169},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.9750000238418579},{"id":"https://openalex.org/keywords/cluster-separation","display_name":"cluster separation","score":0.9860000014305115},{"id":"https://openalex.org/keywords/shortest-path-length","display_name":"shortest path length","score":0.871999979019165},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.6970000267028809},{"id":"https://openalex.org/keywords/high-throughput-biological-data","display_name":"high-throughput biological data","score":0.7590000033378601},{"id":"https://openalex.org/keywords/network-clustering","display_name":"network clustering","score":0.3790000081062317}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7131296992301941},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.610844612121582},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5168514847755432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4788670241832733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4780077040195465},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.46445202827453613},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45747068524360657},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44047561287879944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43018639087677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41839659214019775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41651132702827454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21162056922912598},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16851675510406494},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1435466706752777}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:102742865","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=2126230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2026230245","https://openalex.org/W2141410140","https://openalex.org/W2075526473","https://openalex.org/W2127284416","https://openalex.org/W2376047578","https://openalex.org/W58415858","https://openalex.org/W2172291596","https://openalex.org/W2291440429","https://openalex.org/W2280300977","https://openalex.org/W2981836782"],"abstract_inverted_index":{"A":[0,54,201],"new":[1,55],"minimum":[2,122],"spanning":[3],"tree":[4],"(MST)":[5],"based":[6],"heuristic":[7,15],"for":[8,177,194,206,213],"clustering":[9,207],"biological":[10,208],"data":[11,158,175,192,209],"is":[12,58,77,88,108,130,210],"proposed.":[13],"The":[14,65,103,144,163,183],"uses":[16],"MSTs":[17],"to":[18,27,36,170],"generate":[19],"initial":[20],"solutions":[21],"and":[22,60,71,119,146,161],"applies":[23],"a":[24,98,111],"local":[25],"search":[26,32],"improve":[28],"the":[29,34,37,43,50,63,74,81,92,116,121,127,147,150],"solutions.":[30],"Local":[31],"transfers":[33],"nodes":[35,135],"clusters":[38,166,180,189,197],"with":[39,100],"which":[40,167,178,195],"they":[41],"have":[42],"most":[44],"connections,":[45],"if":[46],"this":[47],"transfer":[48],"improves":[49],"objective":[51,56,66,104],"function":[52,57,67,105],"value.":[53],"defined":[59],"used":[61,137],"in":[62],"heuristic.":[64],"considers":[68],"both":[69],"tightness":[70],"separation":[72],"of":[73,95,97,124,149],"clusters.":[75,86,102],"Tightness":[76],"obtained":[78,89],"by":[79,90],"minimizing":[80,91],"maximum":[82,93],"diameter":[83],"among":[84],"all":[85],"Separation":[87],"number":[94],"connections":[96],"gene":[99,142],"other":[101],"value":[106,118],"calculation":[107],"realized":[109],"on":[110],"binary":[112,128],"graph":[113,129],"generated":[114],"using":[115,155,173,190],"threshold":[117],"keeping":[120],"percentage":[123],"edges":[125],"while":[126],"connected.":[131],"Shortest":[132],"paths":[133],"between":[134,141],"are":[136,153,168,181,198],"as":[138],"distance":[139],"values":[140],"pairs.":[143],"efficiency":[145],"effectiveness":[148],"proposed":[151,212],"method":[152,164,184],"tested":[154],"fourteen":[156],"different":[157],"sets":[159,176,193],"externally":[160],"biologically.":[162],"finds":[165,186],"similar":[169],"actual":[171,179],"ones":[172],"12":[174],"known.":[182,200],"also":[185,211],"biologically":[187],"meaningful":[188],"2":[191],"real":[196],"not":[199],"mixed":[202],"integer":[203,222],"programming":[204,223],"model":[205],"future":[214],"studies.":[215],"\r\nKey":[216],"words:":[217],"clustering,":[218],"optimization,":[219],"heuristics,":[220],"networks,":[221]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W102742865","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
