1158 search results - page 54 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
142
click to vote
HICSS
2008
IEEE
15 years 11 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
134
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
173
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
133
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
121
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...