90 search results - page 14 / 18 » Perfect Sorting by Reversals |
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
CASC
2007
Springer
14 years 2 months ago
2007
Springer
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
COLING
1990
13 years 9 months ago
1990
This paper describes a new program, correct, which takes words rejected by the Unix spell program, proposes a list of candidate corrections, and sorts them by probability. The pro...
JUCS
2006
13 years 7 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...