Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
Sorting permutations by tanspositions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Sorting by Prefix Transpositions
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Search intensity versus search diversity: a false trade off?
Applied Intelligence
| Hi-index | 0.00 |