Results 1  10
of
2,205
Common Ancestor
"... e D irection • Which phylogeny? • Which ancestral states? • Which process? Key Questions: • Homologous objects • Comodelling • Genealogical Structures? ..."
Abstract
 Add to MetaCart
e D irection • Which phylogeny? • Which ancestral states? • Which process? Key Questions: • Homologous objects • Comodelling • Genealogical Structures?
Common Ancestor
"... e D irection • Which phylogeny? • Which ancestral states? • Which process? Key Questions: • Homologous objects • Comodelling • Genealogical Structures? ..."
Abstract
 Add to MetaCart
e D irection • Which phylogeny? • Which ancestral states? • Which process? Key Questions: • Homologous objects • Comodelling • Genealogical Structures?
The Least Common Ancestor Problem
, 2003
"... The Least Common Ancestor Problem can be used to solve many other algorithmic problems on trees. It is shown that an efficient and simple solution is possible. 1 ..."
Abstract
 Add to MetaCart
The Least Common Ancestor Problem can be used to solve many other algorithmic problems on trees. It is shown that an efficient and simple solution is possible. 1
Lowest Common Ancestor(LCA)
"... LCA problem is one of the most fundamental algorithmic problems on trees. It is concerned with how we can find the Least Common Ancestor of a pair of nodes. Over the last 3 ..."
Abstract
 Add to MetaCart
LCA problem is one of the most fundamental algorithmic problems on trees. It is concerned with how we can find the Least Common Ancestor of a pair of nodes. Over the last 3
Lowest Common Ancestor (LCA):
"...  static array A of n numbers query RMQ(i, j) = min{A[i],..., A[j]} naïve solution: O(n 2) lookup table, O(1) query time cartesian tree: [Gabow, Bentley, Tarjan STOC 84] • root = min in array, say A[i] • left subtree: recurse on A[1],..., A[i − 1] • right subtree: recurse on A[i + 1],..., A[n] ..."
Abstract
 Add to MetaCart
 static array A of n numbers query RMQ(i, j) = min{A[i],..., A[j]} naïve solution: O(n 2) lookup table, O(1) query time cartesian tree: [Gabow, Bentley, Tarjan STOC 84] • root = min in array, say A[i] • left subtree: recurse on A[1],..., A[i − 1] • right subtree: recurse on A[i + 1],..., A[n] • O(n) time construction (next lecture)
Universal Common Ancestor
, 2013
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. The phylogenetic signal for a nonhyperthermophilic Last
Most Recent Common Ancestor
"... e D irection •Which phylogeny? •Which ancestral states? •Which process? Key Questions: •Homologous objects •Comodelling •Genealogical Structures? ..."
Abstract
 Add to MetaCart
e D irection •Which phylogeny? •Which ancestral states? •Which process? Key Questions: •Homologous objects •Comodelling •Genealogical Structures?
COMMON ANCESTOR IN EXCHANGEABLE POPULATION MODELS
, 2003
"... A class of haploid population models with nonoverlapping generations and exchangeable offspring distribution is considered. Based on an analysis of the discrete ancestral process, we present solutions, algorithms and strong upper bounds for the expected time back to the most recent common ancestor. ..."
Abstract
 Add to MetaCart
A class of haploid population models with nonoverlapping generations and exchangeable offspring distribution is considered. Based on an analysis of the discrete ancestral process, we present solutions, algorithms and strong upper bounds for the expected time back to the most recent common ancestor
Recent Common Ancestors in Structured Populations
, 2003
"... Previous analyses have shown that the most recent common ancestor for a randomly mating population of size n would have lived approximately log 2 n generations ago; for example, a panmictic population of one million people would have a common ancestor about 20 generations in the past. Structured pop ..."
Abstract
 Add to MetaCart
Previous analyses have shown that the most recent common ancestor for a randomly mating population of size n would have lived approximately log 2 n generations ago; for example, a panmictic population of one million people would have a common ancestor about 20 generations in the past. Structured
Parallel Dynamic Lowest Common Ancestors
 NORDIC JOURNAL OF COMPUTING 1(1994), 402–432.
, 1994
"... This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a forest with a maximum of n vertices, the algorithm takes O(m/p + r log p + min(m, r log n)) time and O(n) space using p pro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a forest with a maximum of n vertices, the algorithm takes O(m/p + r log p + min(m, r log n)) time and O(n) space using p
Results 1  10
of
2,205