Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Phylogenies without Branch Bounds: Contracting the Short, Pruning the
  Deep   We introduce a new phylogenetic reconstruction algorithm which, unlike most
previous rigorous inference techniques, does not rely on assumptions regarding
the branch lengths or the depth of the tree. The algorithm returns a forest
which is guaranteed to contain all edges that are: 1) sufficiently long and 2)
sufficiently close to the leaves. How much of the true tree is recovered
depends on the sequence length provided. The algorithm is distance-based and
runs in polynomial time.

37
The categories of this paper are: supr-con
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
26
The categories of this paper are: bayes-an
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int