{"id":"https://openalex.org/W2104783359","doi":"https://doi.org/10.1137/s0097539794269461","title":"Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms","display_name":"Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms","publication_year":1997,"publication_date":"1997-12-01","ids":{"openalex":"https://openalex.org/W2104783359","doi":"https://doi.org/10.1137/s0097539794269461","mag":"2104783359"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794269461","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794269461","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048790288","display_name":"Amihood Amir","orcid":"https://orcid.org/0000-0002-3939-337X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amihood Amir","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011496893","display_name":"Dmitry Keselman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dmitry Keselman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048790288"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.475,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.82779197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"6","first_page":"1656","last_page":"1669"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9811999797821045,"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.9811999797821045,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9545000195503235,"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/set","display_name":"Set (abstract data type)","score":0.6565402150154114},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6517012715339661},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.633560836315155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5283860564231873},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.5281046628952026},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5012903213500977},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4847395122051239},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4765130281448364},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43733835220336914},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4307720959186554},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3854207396507263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3651955723762512},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34721648693084717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3157644271850586},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.2703801393508911},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15855440497398376},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.09485018253326416}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6565402150154114},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6517012715339661},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.633560836315155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5283860564231873},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.5281046628952026},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5012903213500977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4847395122051239},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4765130281448364},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43733835220336914},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4307720959186554},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3854207396507263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3651955723762512},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34721648693084717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3157644271850586},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.2703801393508911},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15855440497398376},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.09485018253326416},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539794269461","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794269461","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.732","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.732","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.biu.ac.il/~amir/Postscripts/subtree.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1963749031","https://openalex.org/W1975502736","https://openalex.org/W1991701064","https://openalex.org/W1996437477","https://openalex.org/W2042959539","https://openalex.org/W2083604204"],"related_works":["https://openalex.org/W2077383771","https://openalex.org/W2089864510","https://openalex.org/W4376140277","https://openalex.org/W2091985989","https://openalex.org/W270522628","https://openalex.org/W2019778981","https://openalex.org/W1548477435","https://openalex.org/W2168559467","https://openalex.org/W2019444679","https://openalex.org/W1971148082"],"abstract_inverted_index":{"The":[0],"maximum":[1,59,116,147,205,227],"agreement":[2,20,61,118,148,206,228],"subtree":[3,21,33,62,119,149,207,229],"approach":[4],"is":[5,34,94,121,158,165],"one":[6,93,213],"method":[7,201,221],"of":[8,17,26,63,71,84,107,135,150,153,177,208,211],"reconciling":[9],"different":[10],"evolutionary":[11,43,178],"trees":[12,75,125,179,186],"for":[13,29,56,123,138,202],"the":[14,27,31,82,115,140,171,175,185],"same":[15],"set":[16,152,163,176],"species.":[18],"An":[19],"enables":[22,222],"choosing":[23,139],"a":[24,37,58,146,151,162,199,204,226],"subset":[25],"species":[28,141],"whom":[30],"restricted":[32],"equivalent":[35],"(under":[36],"suitable":[38],"definition)":[39],"in":[40,81,91,145,183,230],"all":[41],"given":[42],"trees.":[44,65,85,108,155],"Recently,":[45],"dynamic":[46],"programming":[47],"ideas":[48],"were":[49],"used":[50],"to":[51,69,160,224],"provide":[52,161],"polynomial":[53],"time":[54,136,231],"algorithms":[55,77],"finding":[57,203],"homeomorphic":[60,117],"two":[64,74,100],"Generalizing":[66],"these":[67],"methods":[68],"sets":[70],"more":[72,98,167],"than":[73,99,168,195],"yields":[76],"that":[78,90,114,142,164],"are":[79,143],"exponential":[80],"number":[83],"Unfortunately,":[86],"it":[87],"turns":[88],"out":[89],"reality":[92],"usually":[95,187],"presented":[96],"with":[97,126],"trees,":[101,210],"sometimes":[102],"as":[103,105],"many":[104],"thousands":[106],"In":[109],"this":[110],"paper":[111],"we":[112],"prove":[113],"problem":[120],"$\\cal{NP}$-complete":[122],"three":[124],"unbounded":[127],"degrees.":[128],"We":[129,197],"then":[130],"show":[131],"an":[132],"approximation":[133,157],"algorithm":[134],"O(kn5)":[137],"not":[144],"k":[154,209],"Our":[156],"guaranteed":[159],"no":[166,193],"4":[169],"times":[170],"optimum":[172],"solution.":[173],"While":[174],"may":[180],"be":[181],"large":[182],"practice,":[184],"have":[188],"very":[189],"small":[190],"degrees,":[191],"typically":[192],"larger":[194],"three.":[196],"develop":[198],"new":[200,220],"which":[212],"has":[214],"degree":[215],"bounded":[216],"by":[217],"d.":[218],"This":[219],"us":[223],"find":[225],"O(knd":[232],"+":[233],"1+":[234],"n2d).":[235]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}