Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Linear-Time Tree Containment in Phylogenetic Networks   We consider the NP-hard Tree Containment problem that has important
applications in phylogenetics. The problem asks if a given leaf-labeled network
contains a subdivision of a given leaf-labeled tree. We develop a fast
algorithm for the case that the input network is indeed a tree in which
multiple leaves might share a label. By combining this algorithm with a
generalization of a previously known decomposition scheme, we improve the
running time on reticulation visible networks and nearly stable networks to
linear time. While these are special classes of networks, they rank among the
most general of the previously considered classes.

14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
2
The categories of this paper are: math
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
16
The categories of this paper are: stat
19
The categories of this paper are: eess
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex