{"id":"https://openalex.org/W1486459277","doi":"https://doi.org/10.1007/3-540-58201-0_73","title":"The Optimal Alphabetic Tree problem revisited","display_name":"The Optimal Alphabetic Tree problem revisited","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W1486459277","doi":"https://doi.org/10.1007/3-540-58201-0_73","mag":"1486459277"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-58201-0_73","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-58201-0_73","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/A5089548776","display_name":"Teresa M. Przytycka","orcid":"https://orcid.org/0000-0002-6261-277X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Teresa M. Przytycka","raw_affiliation_strings":["Department of Mathematics and Computer Science, Odense University, DK-5230, Odense M, Denmark","Odense University"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, DK-5230, Odense M, Denmark","institution_ids":[]},{"raw_affiliation_string":"Odense University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038877069","display_name":"Lawrence L. Larmore","orcid":null},"institutions":[{"id":"https://openalex.org/I133999245","display_name":"University of Nevada, Las Vegas","ror":"https://ror.org/0406gha72","country_code":"US","type":"education","lineage":["https://openalex.org/I133999245"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lawrence L. Larmore","raw_affiliation_strings":["Department of Computer Science, University of Nevada Las Vegas, 89514, NV, USA","University of Nevada, Las Vegas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nevada Las Vegas, 89514, NV, USA","institution_ids":["https://openalex.org/I133999245"]},{"raw_affiliation_string":"University of Nevada, Las Vegas","institution_ids":["https://openalex.org/I133999245"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089548776"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4207,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77391525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9901999831199646,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9883000254631042,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.7984559535980225},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6372371912002563},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6114263534545898},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6065455675125122},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5583291053771973},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5375916957855225},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5311117768287659},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5041612386703491},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.49813055992126465},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.48091813921928406},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.45687711238861084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.442328542470932},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.43565624952316284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4318532645702362},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4214158058166504},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41608327627182007},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.4138435423374176},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3982181251049042},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18073970079421997},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07849985361099243}],"concepts":[{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.7984559535980225},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6372371912002563},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6114263534545898},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6065455675125122},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5583291053771973},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5375916957855225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5311117768287659},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5041612386703491},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.49813055992126465},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.48091813921928406},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.45687711238861084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.442328542470932},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.43565624952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4318532645702362},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4214158058166504},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41608327627182007},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.4138435423374176},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3982181251049042},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18073970079421997},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07849985361099243},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-58201-0_73","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-58201-0_73","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1965874601","https://openalex.org/W1979109797","https://openalex.org/W1988325634","https://openalex.org/W1999038556","https://openalex.org/W2001155924","https://openalex.org/W2028503265","https://openalex.org/W2063794498","https://openalex.org/W2065954102","https://openalex.org/W2090264641","https://openalex.org/W2090918100","https://openalex.org/W2118685354","https://openalex.org/W6815915282"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2026697457","https://openalex.org/W2364382882","https://openalex.org/W2361906991","https://openalex.org/W2501849745","https://openalex.org/W1979520615","https://openalex.org/W3169685561","https://openalex.org/W2371680642","https://openalex.org/W2061004850","https://openalex.org/W2004985727"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}