Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Petr Kolman, Tomasz Walen. Approximating reversal distance for strings with bounded number of duplicates. Discrete Applied Mathematics, 155(3):327-336, 2007. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Approximating Reversal Distance for Strings with Bounded Number of DuplicatesPetr Kolman. mfcs 2005: 580-590 [doi] Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting SetPetr Kolman, Tomasz Walen. waoa 2006: 279-289 [doi] Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting SetPetr Kolman, Tomasz Walen. combinatorics, 14(1), 2007. [doi]
The following publications are possibly variants of this publication: