{"id":"https://openalex.org/W2012705570","doi":"https://doi.org/10.1016/0020-0190(94)00050-6","title":"Finding lowest common ancestors in arbitrarily directed trees","display_name":"Finding lowest common ancestors in arbitrarily directed trees","publication_year":1994,"publication_date":"1994-06-01","ids":{"openalex":"https://openalex.org/W2012705570","doi":"https://doi.org/10.1016/0020-0190(94)00050-6","mag":"2012705570"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)00050-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00050-6","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5045579827","display_name":"Matti Nyk\u00e4nen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Matti Nyk\u00e4nen","raw_affiliation_strings":["Department of Computer Science, University of Helsinky, P.O. Box 26 (Teollisuuskatu 23), SF-00014 Helsinky, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Helsinky, P.O. Box 26 (Teollisuuskatu 23), SF-00014 Helsinky, Finland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058284151","display_name":"Esko Ukkonen","orcid":"https://orcid.org/0000-0002-5978-1505"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Esko Ukkonen","raw_affiliation_strings":["Department of Computer Science, University of Helsinky, P.O. Box 26 (Teollisuuskatu 23), SF-00014 Helsinky, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Helsinky, P.O. Box 26 (Teollisuuskatu 23), SF-00014 Helsinky, Finland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045579827"],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.12995595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"50","issue":"6","first_page":"307","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.996399998664856,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.996399998664856,"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/T11106","display_name":"Data Management and Algorithms","score":0.989300012588501,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.6468086242675781},{"id":"https://openalex.org/keywords/ancestor","display_name":"Ancestor","score":0.6439962387084961},{"id":"https://openalex.org/keywords/reversing","display_name":"Reversing","score":0.606602668762207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6015199422836304},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5903408527374268},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5039321780204773},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4318745732307434},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.430237352848053},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.4267641305923462},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4267400801181793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3439016342163086},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3385312557220459}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6468086242675781},{"id":"https://openalex.org/C2780422015","wikidata":"https://www.wikidata.org/wiki/Q402152","display_name":"Ancestor","level":2,"score":0.6439962387084961},{"id":"https://openalex.org/C2781085045","wikidata":"https://www.wikidata.org/wiki/Q7318308","display_name":"Reversing","level":2,"score":0.606602668762207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6015199422836304},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5903408527374268},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5039321780204773},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4318745732307434},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.430237352848053},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.4267641305923462},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4267400801181793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3439016342163086},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3385312557220459},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(94)00050-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)00050-6","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1999978255","https://openalex.org/W2011999472","https://openalex.org/W2046946959","https://openalex.org/W2148928818","https://openalex.org/W2159080219"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W2372211403","https://openalex.org/W3164774158","https://openalex.org/W1498463151"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}