{"id":"https://openalex.org/W1969781519","doi":"https://doi.org/10.1137/s0097539797332275","title":"Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees","display_name":"Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1969781519","doi":"https://doi.org/10.1137/s0097539797332275","mag":"1969781519"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797332275","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797332275","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/A5109219665","display_name":"Ming\u2010Yang Kao","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ming-Yang Kao","raw_affiliation_strings":["Yale University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077116003","display_name":"Tak\u2010Wah Lam","orcid":"https://orcid.org/0000-0003-4676-8587"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Tak-Wah Lam","raw_affiliation_strings":["University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012563463","display_name":"Wing\u2010Kin Sung","orcid":"https://orcid.org/0000-0001-7806-7086"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Wing-Kin Sung","raw_affiliation_strings":["University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033934413","display_name":"Hing\u2010Fung Ting","orcid":"https://orcid.org/0000-0002-2807-2351"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Hing-Fung Ting","raw_affiliation_strings":["University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5929,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8615099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"30","issue":"2","first_page":"602","last_page":"624"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9700999855995178,"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"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9642000198364258,"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.7736528515815735},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6709734201431274},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6007035970687866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5719603896141052},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5235721468925476},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49240052700042725},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.43567854166030884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43134790658950806},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.416655033826828},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3765268921852112},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3562047481536865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3295082449913025},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2498658299446106},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.11604520678520203}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7736528515815735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6709734201431274},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6007035970687866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5719603896141052},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5235721468925476},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49240052700042725},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.43567854166030884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43134790658950806},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.416655033826828},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3765268921852112},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3562047481536865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3295082449913025},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2498658299446106},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.11604520678520203},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539797332275","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797332275","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.342.3259","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3259","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0101031v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.7346","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.7346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0101031v2.pdf","raw_type":"text"},{"id":"pmh:oai:hub.hku.hk:10722/43657","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/43657","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G5501871649","display_name":"Efficient Algorithms with Practical Applications","funder_award_id":"9531028","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1514963869","https://openalex.org/W1577048928","https://openalex.org/W1655990431","https://openalex.org/W1849794777","https://openalex.org/W1963749031","https://openalex.org/W1969357318","https://openalex.org/W1991701064","https://openalex.org/W2003227017","https://openalex.org/W2004688869","https://openalex.org/W2019026763","https://openalex.org/W2052334524","https://openalex.org/W2065170767","https://openalex.org/W2069852500","https://openalex.org/W2070976434","https://openalex.org/W2074507113","https://openalex.org/W2079970266","https://openalex.org/W2104783359","https://openalex.org/W2120154580","https://openalex.org/W2134766004","https://openalex.org/W2156043130","https://openalex.org/W2164141517","https://openalex.org/W2167901041","https://openalex.org/W2752885492","https://openalex.org/W2887787754","https://openalex.org/W2888871578","https://openalex.org/W4233071458"],"related_works":["https://openalex.org/W2151412766","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2568037855","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W4299980042","https://openalex.org/W2951748403"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,77],"algorithm":[3,37,60,78],"for":[4,21,32],"computing":[5],"a":[6,62,66,89,99],"maximum":[7,82],"agreement":[8],"subtree":[9],"of":[10,73,88],"two":[11],"unrooted":[12],"evolutionary":[13],"trees.":[14],"It":[15],"takes":[16,96],"O(n1.5":[17],"log":[18],"n)":[19],"time":[20,30],"trees":[22,41,47],"with":[23],"unbounded":[24],"degrees,":[25],"matching":[26],"the":[27,33,39,56,81],"best":[28],"known":[29],"complexity":[31],"rooted":[34],"case.":[35],"Our":[36,59],"allows":[38],"input":[40],"to":[42,97],"be":[43],"mixed":[44],"trees,":[45],"i.e.,":[46],"that":[48,79],"may":[49],"contain":[50],"directed":[51],"and":[52],"undirected":[53],"edges":[54],"at":[55],"same":[57],"time.":[58],"adopts":[61],"recursive":[63],"strategy":[64],"exploiting":[65],"technique":[67,75],"called":[68],"label":[69],"compression.":[70],"The":[71],"backbone":[72],"this":[74],"is":[76],"computes":[80],"weight":[83],"matchings":[84],"over":[85],"many":[86],"subgraphs":[87],"bipartite":[90],"graph":[91],"as":[92,94],"fast":[93],"it":[95],"compute":[98],"single":[100],"matching.":[101]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}