Sciweavers

Share
156 search results - page 1 / 32
» Optimization problems in multiple subtree graphs
Sort
View
DAM
2011
8 years 3 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
8 years 12 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
NIPS
2001
8 years 9 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
9 years 1 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex proļ¬ts asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
books