#### Filter Results:

#### Publication Year

2006

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

a r t i c l e i n f o a b s t r a c t In this paper, we introduce the maximum duo-preservation string mapping problem (MPSM), which is complementary to the minimum common string partition problem (MCSP). When each letter occurs at most k times in any input string, the version of MPSM is called k-MPSM. In order to design approximation algorithms for MPSM, we… (More)

- ‹
- 1
- ›