![]() |
Volumn , Issue , 1999, Pages 84-93
|
Formulations and hardness of multiple sorting by reversals
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
INTEGER PROGRAMMING;
LINEAR PROGRAMMING;
MATHEMATICAL MODELS;
SORTING;
TREES (MATHEMATICS);
EULERIAN GRAPH;
HAMILTONIAN CYCLE;
SIGNED PERMUTATIONS;
SORTING BY REVERSALS (SBR);
BIOLOGY;
|
EID: 0032635206
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/299432.299461 Document Type: Article |
Times cited : (95)
|
References (24)
|