17 search results - page 3 / 4 » Short Labels for Lowest Common Ancestors in Trees |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
RECOMB
2009
Springer
14 years 6 months ago
2009
Springer
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
TKDE
2008
13 years 6 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
CIKM
2007
Springer
14 years 9 days ago
2007
Springer
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
BMCBI
2006
13 years 6 months ago
2006
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...