Sciweavers

STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 3 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
137
Voted
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 4 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 3 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 3 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
COCO
1995
Springer
134views Algorithms» more  COCO 1995»
15 years 4 months ago
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
Rainer Schuler, Osamu Watanabe
Algorithms
Top of PageReset Settings