{"id":"https://openalex.org/W1554271130","doi":"https://doi.org/10.1007/3-540-49116-3_17","title":"Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions","display_name":"Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1554271130","doi":"https://doi.org/10.1007/3-540-49116-3_17","mag":"1554271130"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-49116-3_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-49116-3_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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":true,"raw_author_name":"Ming-Yang Kao","raw_affiliation_strings":["Department of Computer Science, Yale University, New Haven, CT, 06520, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, New Haven, CT, 06520, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"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, 118, S-22100, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, 118, S-22100, 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, 118, S-22100, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, 118, S-22100, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109219665"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7218,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68850902,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"184","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"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.9991000294685364,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9836000204086304,"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/ultrametric-space","display_name":"Ultrametric space","score":0.8304873108863831},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7023225426673889},{"id":"https://openalex.org/keywords/tree-rearrangement","display_name":"Tree rearrangement","score":0.5959697961807251},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5803971290588379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5695377588272095},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.48159071803092957},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.4452287256717682},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4417080581188202},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4390902817249298},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.43146535754203796},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3816601634025574},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3425232172012329},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3286975622177124},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.32758599519729614},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.312511146068573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2875327467918396},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2717526853084564},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.07727333903312683}],"concepts":[{"id":"https://openalex.org/C61067352","wikidata":"https://www.wikidata.org/wiki/Q1897429","display_name":"Ultrametric space","level":3,"score":0.8304873108863831},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7023225426673889},{"id":"https://openalex.org/C53208351","wikidata":"https://www.wikidata.org/wiki/Q7837630","display_name":"Tree rearrangement","level":4,"score":0.5959697961807251},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5803971290588379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5695377588272095},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.48159071803092957},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.4452287256717682},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4417080581188202},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4390902817249298},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.43146535754203796},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3816601634025574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3425232172012329},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3286975622177124},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.32758599519729614},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.312511146068573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2875327467918396},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2717526853084564},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.07727333903312683},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-49116-3_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-49116-3_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1514963869","https://openalex.org/W1532608758","https://openalex.org/W1581805909","https://openalex.org/W1594549999","https://openalex.org/W1963749031","https://openalex.org/W1968300516","https://openalex.org/W1981192617","https://openalex.org/W1985064024","https://openalex.org/W1991701064","https://openalex.org/W2011729349","https://openalex.org/W2079970266","https://openalex.org/W2080541436","https://openalex.org/W2104783359","https://openalex.org/W2158700621","https://openalex.org/W2887787754"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2061004850","https://openalex.org/W2004985727","https://openalex.org/W2072157347","https://openalex.org/W3169685561","https://openalex.org/W2501849745","https://openalex.org/W2364382882","https://openalex.org/W2949895650","https://openalex.org/W1979520615","https://openalex.org/W4288268215"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
