Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
The OrthoMCL database (http://orthomcl.cbil.upenn. edu) houses ortholog group predictions for 55 spe10 cies, including 16 bacterial and 4 archaeal genomes representing phylogeneti...
Feng Chen, Aaron J. Mackey, Christian J. Stoeckert...
The WIT (What Is There) (http://wit.mcs.anl.gov/WIT2/ ) system has been designed to support comparative analysis of sequenced genomes and to generate metabolic reconstructions bas...
Ross A. Overbeek, Niels Larsen, Gordon D. Pusch, M...
A recurring difficulty for organizations that employ a product-line approach to development is that when a new product is added to an existing product line, there is currently no a...
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...