LCA
- noun
- Specialized
- In a binary tree, the LCA of two nodes is the deepest node that is an ancestor of both.
And we're going to count this read at a particular node, namely the LCA of those two times.
- And we're going to count this read at a particular node, namely the LCA of those two times.
Examples
-
And that's that's what LCA in this tree gives you.
-
And we're going to count this read at a particular node, namely the LCA of those two times.
-
To find the LCA of the nodes, we implemented an algorithm that traverses the tree structure.
-
The LCA is essential for understanding the relationships between various nodes in data trees.
Surface Forms
Morphology
LCA = L + C + A
This is an initialism/acronym: the letters do not transparently convey the algorithmic meaning 'lowest common ancestor' without knowing the expanded phrase.
Etymology
LCA is short for lowest common ancestor, the nearest shared parent node of two items in a tree. Think of a family tree: the lowest common ancestor is the first person who is an ancestor of both, which is why computer scientists use LCA to find relationships in data trees.