3 search results - page 1 / 1 » cpm 1995 |
CPM
1995
Springer
13 years 8 months ago
1995
Springer
CPM
2001
Springer
13 years 9 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
CPM
1995
Springer
13 years 8 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...