{"id":"https://openalex.org/W2089357212","doi":"https://doi.org/10.1145/2071379.2071386","title":"Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees","display_name":"Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2089357212","doi":"https://doi.org/10.1145/2071379.2071386","mag":"2089357212"},"language":"en","primary_location":{"id":"doi:10.1145/2071379.2071386","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2071379.2071386","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2071379.2071386","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2071379.2071386","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033025664","display_name":"Sebastian B\u00f6cker","orcid":"https://orcid.org/0000-0002-9304-8091"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian B\u00f6cker","raw_affiliation_strings":["Friedrich-Schiller-Universit\u00e4t Jena"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Schiller-Universit\u00e4t Jena","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084938584","display_name":"Quang Bao Anh Bui","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Quang Bao Anh Bui","raw_affiliation_strings":["Friedrich-Schiller-Universit\u00e4t Jena"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Schiller-Universit\u00e4t Jena","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004620945","display_name":"Anke Tru\u00df","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anke Truss","raw_affiliation_strings":["Friedrich-Schiller-Universit\u00e4t Jena"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Friedrich-Schiller-Universit\u00e4t Jena","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1344,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.53127651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"8","issue":"1","first_page":"1","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9983999729156494,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9983999729156494,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9656999707221985,"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/bipartite-graph","display_name":"Bipartite graph","score":0.745610237121582},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7058022022247314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6313461661338806},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.50975102186203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4650833010673523},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4601026773452759},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4391426742076874},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43014854192733765}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.745610237121582},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7058022022247314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6313461661338806},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.50975102186203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4650833010673523},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4601026773452759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4391426742076874},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43014854192733765}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2071379.2071386","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2071379.2071386","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2071379.2071386","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.1714","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.1714","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bio.informatik.uni-jena.de/bib2html/downloads/2009/BoeckerEtAl_ImprovedFixedParameterAlgorithms_preprint_2009.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.389.4531","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.389.4531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bio.informatik.uni-jena.de/bib2html/downloads/2008/BoeckerEtAl_ImprovedFixedParameterAlgorithmMinimumFlipConsensusTrees_IWPEC_2008.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/2071379.2071386","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2071379.2071386","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2071379.2071386","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1501769561","https://openalex.org/W1517036688","https://openalex.org/W1579932957","https://openalex.org/W1596422325","https://openalex.org/W1834136713","https://openalex.org/W1972845596","https://openalex.org/W2009661773","https://openalex.org/W2033854905","https://openalex.org/W2054420170","https://openalex.org/W2061881283","https://openalex.org/W2065067768","https://openalex.org/W2074507113","https://openalex.org/W2080471862","https://openalex.org/W2084289491","https://openalex.org/W2099200823","https://openalex.org/W2127187002","https://openalex.org/W2130775582","https://openalex.org/W2144050783","https://openalex.org/W2160350701","https://openalex.org/W2579372702","https://openalex.org/W2913688336","https://openalex.org/W4244179086","https://openalex.org/W4254829036","https://openalex.org/W4292230561","https://openalex.org/W6630973240"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2151412766","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1987322712"],"abstract_inverted_index":{"In":[0,22],"computational":[1,204],"phylogenetics,":[2],"the":[3,27,31,64,70,88,101,122,129,138],"problem":[4,71],"of":[5,14,55,60,69,96],"constructing":[6],"a":[7,11,37,45,52,76,93,187],"consensus":[8],"tree":[9],"for":[10,48,137,172],"given":[12],"set":[13,95,124],"rooted":[15],"input":[16,32],"trees":[17,33],"has":[18,104],"frequently":[19],"been":[20],"addressed.":[21],"this":[23,49],"article":[24],"we":[25,41,196],"study":[26],"Minimum-Flip":[28,139],"Problem":[29,140],":":[30],"are":[34],"transformed":[35],"into":[36],"binary":[38],"matrix,":[39],"and":[40,113,125,156,179,192],"want":[42],"to":[43,91,121,128],"find":[44,92],"perfect":[46],"phylogeny":[47],"matrix":[50],"using":[51],"minimum":[53,94],"number":[54],"flips,":[56,178],"that":[57,100,111],"is,":[58],"corrections":[59],"single":[61],"entries":[62],"in":[63,115,190],"matrix.":[65],"The":[66],"graph-theoretical":[67],"formulation":[68],"is":[72,90],"as":[73],"follows:":[74],"Given":[75],"bipartite":[77],"graph":[78,103],"G":[79],"=":[80],"(":[81,151,167,181],"Vt":[82,116,119],"\u222a":[83],"Vc":[84,126],",":[85,117,141,153,169,183],"E":[86],"),":[87],"task":[89],"edge":[97],"modifications":[98],"such":[99],"resulting":[102],"no":[105],"induced":[106],"path":[107],"with":[108,143,159],"four":[109],"edges":[110],"starts":[112],"ends":[114],"where":[118],"corresponds":[120,127],"taxa":[123],"character":[130],"set.":[131],"We":[132,201],"present":[133],"two":[134],"fixed-parameter":[135],"algorithms":[136],"one":[142,158],"running":[144,160],"time":[145,161],"O":[146,162],"(4.83":[147],"k":[148,164,177],"+":[149,165],"poly":[150,166,180],"m":[152,168,175,182,191],"n":[154,170,173,184,193],"))":[155,171],"another":[157],"(4.42":[163],"taxa,":[174],"characters,":[176],")":[185],"denotes":[186],"polynomial":[188],"function":[189],".":[194],"Additionally,":[195],"discuss":[197],"several":[198],"heuristic":[199],"improvements.":[200],"also":[202],"report":[203],"results":[205],"on":[206],"phylogenetic":[207],"data.":[208]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}