{"id":"https://openalex.org/W1559569263","doi":"https://doi.org/10.1023/a:1009833626004","title":"On the Complexity of Constructing Evolutionary Trees","display_name":"On the Complexity of Constructing Evolutionary Trees","publication_year":1999,"publication_date":"1999-07-01","ids":{"openalex":"https://openalex.org/W1559569263","doi":"https://doi.org/10.1023/a:1009833626004","mag":"1559569263"},"language":"en","primary_location":{"id":"doi:10.1023/a:1009833626004","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009833626004","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","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/A5052366414","display_name":"Leszek G\u0105sieniec","orcid":"https://orcid.org/0000-0003-1809-9814"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Leszek Gasieniec","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Peach Street, L69 7ZF, Liverpool, UK","Department of Computer Science University of Liverpool Liverpool UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Peach Street, L69 7ZF, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"Department of Computer Science University of Liverpool Liverpool UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060626918","display_name":"Jesper Jansson","orcid":"https://orcid.org/0000-0001-6859-8932"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jesper Jansson","raw_affiliation_strings":["Department of Computer Science, Lund Institute of Technology, Box 118, 221 00, Lund, Sweden","Department of Computer Science, Lund Institute of Technology, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund Institute of Technology, Box 118, 221 00, Lund, Sweden","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, Lund Institute of Technology, Lund, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andrzej Lingas","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","Department of Computer Science, Lund University, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032324378","display_name":"Anna \u00d6stlin","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Anna \u00d6stlin","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","Department of Computer Science, Lund University, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5052366414"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.5645,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.8465479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":"2-3","first_page":"183","last_page":"197"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991999864578247,"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.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9961000084877014,"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/theory-of-computation","display_name":"Theory of computation","score":0.768257737159729},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7402898669242859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7348769903182983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7060505151748657},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6156941652297974},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6071528196334839},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5981494188308716},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5823908448219299},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45856794714927673},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4152297377586365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3993458151817322},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21257281303405762},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19593417644500732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17452290654182434}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.768257737159729},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7402898669242859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7348769903182983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7060505151748657},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6156941652297974},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6071528196334839},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5981494188308716},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5823908448219299},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45856794714927673},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4152297377586365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3993458151817322},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21257281303405762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19593417644500732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17452290654182434},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1023/a:1009833626004","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009833626004","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:3:y:1999:i:2:d:10.1023_a:1009833626004","is_oa":false,"landing_page_url":"http://link.springer.com/10.1023/A:1009833626004","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320319997","display_name":"Nuffield Foundation","ror":"https://ror.org/0281jqk77"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1514963869","https://openalex.org/W1594549999","https://openalex.org/W1849794777","https://openalex.org/W1941736675","https://openalex.org/W1963749031","https://openalex.org/W1967160842","https://openalex.org/W1968300516","https://openalex.org/W1983593474","https://openalex.org/W1990313671","https://openalex.org/W1991701064","https://openalex.org/W2004660767","https://openalex.org/W2011729349","https://openalex.org/W2040924621","https://openalex.org/W2047715328","https://openalex.org/W2078109763","https://openalex.org/W2080541436","https://openalex.org/W2114651839","https://openalex.org/W2140118062","https://openalex.org/W2158700621"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2136838521","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W1581805909","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}