238 search results - page 17 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
66
Voted
ALGORITHMICA
2008
14 years 9 months ago
2008
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
75
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...
HICSS
2008
IEEE
14 years 9 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
88
Voted
PVLDB
2010
14 years 8 months ago
2010
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...