{"id":"https://openalex.org/W2003554135","doi":"https://doi.org/10.1137/s0097539796313477","title":"An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees","display_name":"An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2003554135","doi":"https://doi.org/10.1137/s0097539796313477","mag":"2003554135"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796313477","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796313477","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/A5042866153","display_name":"Richard Cole","orcid":"https://orcid.org/0000-0002-5885-0222"},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Cole","raw_affiliation_strings":["Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087023890","display_name":"Mart\u0131\u0301n Farach-Colton","orcid":"https://orcid.org/0000-0003-3616-7788"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Farach-Colton","raw_affiliation_strings":["Rutgers, The State University of New Jersey [New Brunswick]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers, The State University of New Jersey [New Brunswick]","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103368959","display_name":"Ramesh Hariharan","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ramesh Hariharan","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089548776","display_name":"Teresa M. Przytycka","orcid":"https://orcid.org/0000-0002-6261-277X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Teresa Przytycka","raw_affiliation_strings":["Johns Hopkins University ("],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University (","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.562,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.92668213,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"30","issue":"5","first_page":"1385","last_page":"1404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.979200005531311,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7483481764793396},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6865824460983276},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6630962491035461},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5840763449668884},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5792165398597717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5719050765037537},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5654140114784241},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47651851177215576},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4496581256389618},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4142623543739319},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4113718271255493},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35518932342529297},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34042781591415405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2971772849559784},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07348430156707764}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7483481764793396},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6865824460983276},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6630962491035461},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5840763449668884},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5792165398597717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5719050765037537},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5654140114784241},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47651851177215576},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4496581256389618},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4142623543739319},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4113718271255493},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35518932342529297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34042781591415405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2971772849559784},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07348430156707764},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796313477","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796313477","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3507321923","display_name":"String Matching, Amortization and Parallel Algorithms","funder_award_id":"9202900","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4697743404","display_name":"Networks, Pattern Matching and Parallel Algorithms","funder_award_id":"9503309","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1963749031","https://openalex.org/W1970802957","https://openalex.org/W1991701064","https://openalex.org/W2000568806","https://openalex.org/W2011999472","https://openalex.org/W2019026763","https://openalex.org/W2052334524","https://openalex.org/W2062799424","https://openalex.org/W2070976434","https://openalex.org/W2071695618","https://openalex.org/W2104783359","https://openalex.org/W2600246321","https://openalex.org/W2887787754"],"related_works":["https://openalex.org/W1992675042","https://openalex.org/W2070976434","https://openalex.org/W120230377","https://openalex.org/W2164147196","https://openalex.org/W1546313448","https://openalex.org/W2964024049","https://openalex.org/W1879543997","https://openalex.org/W2006131099","https://openalex.org/W2048760379","https://openalex.org/W1525833494"],"abstract_inverted_index":{"The":[0],"maximum":[1],"agreement":[2],"subtree":[3],"problem":[4],"is":[5],"the":[6,17,25,33,36,47,55,58],"following.":[7],"Given":[8],"two":[9,37],"rooted":[10],"trees":[11,38,59],"whose":[12],"leaves":[13],"are":[14,43,60],"drawn":[15],"from":[16],"same":[18],"set":[19],"of":[20,28,35],"items":[21,30,42],"(e.g.,":[22],"species),":[23],"find":[24],"largest":[26],"subset":[27],"these":[29,41],"so":[31],"that":[32],"portions":[34],"restricted":[39],"to":[40],"isomorphic.":[44],"We":[45],"consider":[46],"case":[48,56],"which":[49],"occurs":[50],"frequently":[51],"in":[52],"practice,":[53],"i.e.,":[54],"when":[57],"binary,":[61],"and":[62],"give":[63],"an":[64],"O(nlog":[65],"n)":[66],"time":[67],"algorithm":[68],"for":[69],"this":[70],"problem.":[71]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}