Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Slim Sets of Binary Trees   A classical problem in phylogenetic tree analysis is to decide whether there
is a phylogenetic tree $T$ that contains all information of a given collection
$\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is
compatible and $T$ displays $\cP$. This decision problem is NP-complete even if
all input trees are quartets, that is binary trees with exactly four leaves. In
this paper, we prove a sufficient condition for a set of binary phylogenetic
trees to be compatible. That result is used to give a short and self-contained
proof of the known characterization of quartet sets of minimal cardinality
which are displayed by a unique phylogenetic tree.

21
The categories of this paper are: adap-org
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
33
The categories of this paper are: plasm-ph