the lowest common ancestor (LCA) (also called least common ancestor) of two nodes v and w in a tree or directed acyclic graph (DAG) T is the lowest (i...

biology and genetic genealogy, the most recent common ancestor (MRCA), also known as the last common ancestor (LCA), of a set of organisms is the most recent...

computer science, Tarjan's off-line lowest common ancestors algorithm is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based...

subsequence (10) forms the lowest common ancestor of the leftmost and rightmost values (12 and 18). Because lowest common ancestors can be found in constant...

several use cases in computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP). Given an array A[1 … n] of...

common ancestor retrieval, it can be solved in Θ ( N ) {\displaystyle \Theta (N)} time. The following pseudocode finds the set of longest common substrings...

lowest common ancestor in T A {\displaystyle T_{A}} of a i {\displaystyle a_{i}} and a j {\displaystyle a_{j}} . Because the lowest common ancestor can...

whole section to a tree Finding the root for any node Finding the lowest common ancestor of two nodes Stepping through the items of a tree, by means of the...

{\displaystyle r} , the lowest common ancestor of all nodes in T i {\displaystyle T_{i}} that are in Right(y). In addition, the lowest common ancestor for all the...

Tarjan's strongly connected components algorithm Tarjan's off-line lowest common ancestors algorithm Tarjan's algorithm for finding bridges in an undirected...

linguistic term belonging to the theory of antisymmetry Lowest common ancestor, in graph theory, the lowest node in T that has both v and w as descendants Large...

breadth-first search forest connecting its two endpoints to their lowest common ancestor forms an odd cycle. If the algorithm terminates without finding...

Range query (computer science) Lowest common ancestor Bender, Michael A.; Farach-Colton, Martin (2004). "The Level Ancestor Problem Simplified". Theor. Comput...

been the lowest common ancestor of the point q {\displaystyle q} and the cell v {\displaystyle v} in an uncompressed quadtree. Call this ancestor cell u...

through the Lowest Common Ancestor (LCA) mapping: proceeding from the leaves to the root, each internal node is mapped to the lowest common ancestor of the...

number of advance edges up to and including (u,v). Determine the lowest common ancestor of two nodes. Henzinger and King suggest to represent a given tree...

share a common ancestor, and are separated from their most recent common ancestor by two or more generations. This means neither person is an ancestor of the...

cannot be charged against improvements to this function. In the lowest common ancestor data structure, the decomposition is used to embed the input tree...

logarithmic scale longest common subsequence longest common substring Lotka's law lower bound lower triangular matrix lowest common ancestor l-reduction...

pair of vertices to be queried in constant time per query, using lowest common ancestor queries in a Cartesian tree. The root of the Cartesian tree represents...

or 1, and two cograph vertices are adjacent if and only if their lowest common ancestor in the tree is labeled 1. cover A vertex cover is a set of vertices...

permutation: two vertices of the graph are adjacent if and only if their lowest common ancestor in the separation tree is negative. The graphs that can be formed...

used in bioinformatics to build a phylogenetic tree. Let x be the lowest common ancestor between two species i and j, we expect Mij = Mix + Mxj. This is...

than q). It follows from the theory of Cartesian trees that the lowest common ancestor of any two numbers q and r in the Stern–Brocot tree is the rational...

is that two vertices are connected by an edge if and only if the lowest common ancestor of the corresponding leaves is labeled by 1. Conversely, every cograph...

is not part of the tree, the distance between the root and the lowest common ancestor of u and v. For each edge uv that is part of the tree, find the...

which provide full suffix tree functionality like suffix links and lowest common ancestor queries. Furthermore, it can be used together with the suffix array...

computer scientist, known for his work in cache-oblivious algorithms, lowest common ancestor data structures, scheduling (computing), and pebble games. He is...

required information for statistical and graphical analysis. Lastly, lowest common ancestor (LCA) algorithm can be run to inspect assignments, to analyze data...

loss of generality that (i) holds. Let u {\displaystyle u} be the lowest common ancestor of p {\displaystyle p} and q {\displaystyle q} in the split tree...