Sciweavers

TCBB
2010
166views more  TCBB 2010»
13 years 10 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 4 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky