1421 search results - page 94 / 285 » Algorithms for subsequence combinatorics |
161
click to vote
CPM
2005
Springer
15 years 11 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
151
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
167
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
171
click to vote
JCB
2008
15 years 6 months ago
2008
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
184
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...