5 search results - page 1 / 1 » A Faster FPT Algorithm for the Maximum Agreement Forest Prob... |
MST
2007
13 years 7 months ago
2007
WEA
2010
Springer
14 years 2 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
BMCBI
2010
13 years 7 months ago
2010
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...