140 search results - page 17 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
HM
2007
Springer
14 years 2 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
LATIN
2010
Springer
14 years 3 months ago
2010
Springer
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
BMCBI
2008
13 years 8 months ago
2008
Background: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of evolutionary events acting at the population level, like recombin...
IEEESCC
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...