214 search results - page 38 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
108
click to vote
ORL
2006
14 years 10 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
IR
2008
14 years 10 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
65
Voted
WABI
2001
Springer
15 years 2 months ago
2001
Springer
There are very few instances in which positive Darwinian selection has been convincingly demonstrated at the molecular level. In this study, we present a novel test for detecting p...
CIVR
2009
Springer
15 years 4 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...