{"id":"https://openalex.org/W2129484641","doi":"https://doi.org/10.3390/a6030396","title":"New Heuristics for Rooted Triplet Consistency","display_name":"New Heuristics for Rooted Triplet Consistency","publication_year":2013,"publication_date":"2013-07-11","ids":{"openalex":"https://openalex.org/W2129484641","doi":"https://doi.org/10.3390/a6030396","mag":"2129484641"},"language":"en","primary_location":{"id":"doi:10.3390/a6030396","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030396","pdf_url":"https://www.mdpi.com/1999-4893/6/3/396/pdf?version=1373531793","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/6/3/396/pdf?version=1373531793","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112907193","display_name":"Soheil Jahangiri","orcid":"https://orcid.org/0009-0005-0177-8812"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]},{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Soheil Jahangiri","raw_affiliation_strings":["Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, Iran","Bioinformatics Group, School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Niavaran, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]},{"raw_affiliation_string":"Bioinformatics Group, School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Niavaran, Tehran, Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056821502","display_name":"Seyed Mohammad Hashemi","orcid":"https://orcid.org/0000-0003-1484-9008"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Seyed Hashemi","raw_affiliation_strings":["Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez Ave, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005109924","display_name":"Hadi Poormohammadi","orcid":"https://orcid.org/0000-0001-9716-0550"},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hadi Poormohammadi","raw_affiliation_strings":["Shahid Beheshti University, Evin, Tehran 19839-63113, Iran"],"affiliations":[{"raw_affiliation_string":"Shahid Beheshti University, Evin, Tehran 19839-63113, Iran","institution_ids":["https://openalex.org/I48379061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112907193"],"corresponding_institution_ids":["https://openalex.org/I158248296","https://openalex.org/I4210146419"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2924,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.62123389,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"6","issue":"3","first_page":"396","last_page":"406"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9987000226974487,"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.9987000226974487,"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.9866999983787537,"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.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/ackermann-function","display_name":"Ackermann function","score":0.7506877183914185},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6936371326446533},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5740930438041687},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.5383198857307434},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5276970863342285},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4909997284412384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4745912253856659},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4653506875038147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45426031947135925},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43125060200691223},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.41186124086380005},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.3759075999259949},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33344027400016785},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22734752297401428},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.09890863299369812}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.7506877183914185},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6936371326446533},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5740930438041687},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.5383198857307434},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5276970863342285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4909997284412384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4745912253856659},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4653506875038147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45426031947135925},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43125060200691223},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.41186124086380005},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.3759075999259949},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33344027400016785},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22734752297401428},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.09890863299369812},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a6030396","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030396","pdf_url":"https://www.mdpi.com/1999-4893/6/3/396/pdf?version=1373531793","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.361.5413","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.361.5413","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mdpi.com/1999-4893/6/3/396/pdf?y=1","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:2ab59f9bdc3b4e84a8af40983b2130bb","is_oa":true,"landing_page_url":"https://doaj.org/article/2ab59f9bdc3b4e84a8af40983b2130bb","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 6, Iss 3, Pp 396-406 (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a6030396","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6030396","pdf_url":"https://www.mdpi.com/1999-4893/6/3/396/pdf?version=1373531793","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2129484641.pdf","grobid_xml":"https://content.openalex.org/works/W2129484641.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1517182104","https://openalex.org/W1535064766","https://openalex.org/W1559569263","https://openalex.org/W1778865519","https://openalex.org/W1884098403","https://openalex.org/W2036921810","https://openalex.org/W2038848746","https://openalex.org/W2045430818","https://openalex.org/W2065746563","https://openalex.org/W2066429145","https://openalex.org/W2078109763","https://openalex.org/W2079970266","https://openalex.org/W2098524338","https://openalex.org/W2118275957","https://openalex.org/W2137120608","https://openalex.org/W2146149072","https://openalex.org/W2491957372","https://openalex.org/W2506594699","https://openalex.org/W2752885492","https://openalex.org/W3136367277","https://openalex.org/W4302368174","https://openalex.org/W4311816414"],"related_works":["https://openalex.org/W3035316584","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851"],"abstract_inverted_index":{"Rooted":[0],"triplets":[1,75],"are":[2],"becoming":[3],"one":[4],"of":[5,10,31,43,53,73,94],"the":[6,28,32,41,45,79,91,107],"most":[7],"important":[8],"types":[9],"input":[11],"for":[12,136],"reconstructing":[13],"rooted":[14,17,54],"phylogenies.":[15],"A":[16],"triplet":[18],"is":[19,58,90,98,109],"a":[20,51,70],"phylogenetic":[21],"tree":[22,49],"on":[23,76,126],"three":[24,34],"leaves":[25],"and":[26],"shows":[27],"evolutionary":[29,48],"relationship":[30],"corresponding":[33],"species.":[35],"In":[36],"this":[37,137],"paper,":[38],"we":[39],"investigate":[40],"problem":[42,57],"inferring":[44],"maximum":[46],"consensus":[47],"from":[50],"set":[52,72],"triplets.":[55],"This":[56,97],"known":[59,104,134],"to":[60],"be":[61],"APX-hard.":[62],"We":[63],"present":[64],"two":[65],"new":[66],"heuristic":[67],"algorithms.":[68],"For":[69],"given":[71],"m":[74],"n":[77],"species,":[78],"FastTree":[80],"algorithm":[81,120],"runs":[82,121],"in":[83,122],"O(m":[84],"+":[85],"\u03b1(n)n2)":[86],"time,":[87],"where":[88],"\u03b1(n)":[89],"functional":[92],"inverse":[93],"Ackermann\u2019s":[95],"function.":[96],"faster":[99],"than":[100,130],"any":[101,131],"other":[102,132],"previously":[103,133],"algorithms,":[105],"although":[106],"outcome":[108],"less":[110],"satisfactory.":[111],"The":[112],"Best":[113],"Pair":[114],"Merge":[115],"with":[116],"Total":[117],"Reconstruction":[118],"(BPMTR)":[119],"O(mn3)":[123],"time":[124],"and,":[125],"average,":[127],"performs":[128],"better":[129],"algorithms":[135],"problem.":[138]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":29},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}