Sciweavers

13 search results - page 3 / 3
» An approximation algorithm for sorting by reversals and tran...
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
13 years 8 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
13 years 10 months ago
Minimum Common String Partition Problem: Hardness and Approximations
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...
Avraham Goldstein, Petr Kolman, Jie Zheng
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
13 years 6 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane