Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,992,858 papers from all fields of science
Search
Sign In
Create Free Account
Lowest common ancestor
Known as:
Least common ancestor
, Least common subsumer
, Nearest common ancestor
Expand
In graph theory and computer science, the lowest common ancestor (LCA) of two nodes v and w in a tree or directed acyclic graph (DAG) T is the lowest…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
ACM Transactions on Programming Languages and Systems
Cartesian tree
Cograph
Complex system
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Identifying the Least Common Subsumer Ontological Class
K. Litkowski
2016
Corpus ID: 56331220
A common problem in computational linguistics is providing a semantic characterization of a set of lexical items. For the most…
Expand
2014
2014
50 0 , 55 0 , 60 0 , 65 1 5 9 13 17 21 25 29 33 37 41 45 49 53
Antonio Sánchez-Ruiz
,
Santiago Ontañón
2014
Corpus ID: 189859976
This paper presents a new hierarchical case retrieval method called Least Common Subsumer Trees (LCS trees). LCS trees perform a…
Expand
2013
2013
Fast algorithm for finding the lowest common ancestor of two neighboring nodes in a complete binary tree
W. Ju
2013
Corpus ID: 124667224
Finding the lowest common ancestor(LCA) of two nodes in a binary tree has been focused both in graph theory and computer science…
Expand
2013
2013
Back-Track Routing for Fat-Tree Based Data Center Networks
Jijun Cao
,
Ke-Fei Wang
,
Xin Wang
IEEE International Conference on Cloud Computing…
2013
Corpus ID: 386602
Fat-tree topology is very popular for constructing interconnect network for data centers. Routing is one of the most important…
Expand
2010
2010
A New Measure Based on Gene Ontology for Semantic Similarity of Genes
Shaohua Zhang
,
Xuequn Shang
,
Miao Wang
,
Jingni Diao
WASE International Conference on Information…
2010
Corpus ID: 17853691
In this paper, we propose a novel method to measure the semantic similarity between genes. The key principle of our method relies…
Expand
2007
2007
Optimizing the Retrieval of Pertinent Answers for NL Questions with the E-Librarian Service
Serge Linckels
,
Harald Sack
,
C. Meinel
SMRR
2007
Corpus ID: 961246
There is a growing discrepancy between the creation of digital content and its actual employment and usefulness in a learning…
Expand
2006
2006
A Practical Algorithm for Computing Neighbors in Quadtrees, Octrees, and Hyperoctrees
R. Yoder
,
P. A. Bloniarz
International Conference on Modeling, Simulation…
2006
Corpus ID: 45389698
A simple and general method for computing location codes of same-size neighboring nodes for any direction within quadtrees is…
Expand
2004
2004
Efficient on the fly maintenance of series-parallel relationships
Jeremy T. Fineman
2004
Corpus ID: 118037416
A series-parallel directed acyclic graph, or SP-dag, contains nodes that are either in series or logically in parallel. We…
Expand
2002
2002
Semantic Structuration of Image Annotations: A Data Mining Approach
Marie-Aude Aufaure
,
Hicham Hajji
Multimedia Information Systems
2002
Corpus ID: 14506649
Image and video data become more and more popular for various applications. A considerable volume of multimedia data has been…
Expand
1977
1977
A space efficient method for the lowest common ancestor problem and an application to finding negative cycles
D. Maier
18th Annual Symposium on Foundations of Computer…
1977
Corpus ID: 16597325
We present a method for computing ancestor information in trees. We show the method is tunable to specific applications, and…
Expand