Attributes | Values |
---|
rdf:type
| |
Description
| - For a string $A=a_1\ldots a_n$, a {\em reversal} $\rho(i,j)$, $1\leq i lt \leq n$, reverses the order of symbols in the substring $a_i\ldots a_j$ of $A$. Given two strings, $A$ and $B$, {\em sorting by reversals} is the problem of finding the minimum number of reversals that transform the string $A$ into the string $B$. Traditionally, the problem was studied for permutations. We consider a generalization of the problem and allow each symbol to appear at most $k$ times in each string. The main result of the paper is a $\Theta(k^2)$-approximation algorithm running in time $O(kn)$.
- For a string $A=a_1\ldots a_n$, a {\em reversal} $\rho(i,j)$, $1\leq i lt \leq n$, reverses the order of symbols in the substring $a_i\ldots a_j$ of $A$. Given two strings, $A$ and $B$, {\em sorting by reversals} is the problem of finding the minimum number of reversals that transform the string $A$ into the string $B$. Traditionally, the problem was studied for permutations. We consider a generalization of the problem and allow each symbol to appear at most $k$ times in each string. The main result of the paper is a $\Theta(k^2)$-approximation algorithm running in time $O(kn)$. (en)
|
Title
| - Approximating Reversal Distance for Strings with Bounded Number of Duplicates
- Approximating Reversal Distance for Strings with Bounded Number of Duplicates (en)
|
skos:prefLabel
| - Approximating Reversal Distance for Strings with Bounded Number of Duplicates
- Approximating Reversal Distance for Strings with Bounded Number of Duplicates (en)
|
skos:notation
| - RIV/00216208:11320/05:00206164!RIV10-MSM-11320___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(1M0545), Z(MSM0021620838)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/05:00206164
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Approximating; Reversal; Distance; Strings; Bounded; Number; Duplicates (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Mathematical Foundations of Computer Science 2005, proceedings
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| |
http://linked.open...vavai/riv/typAkce
| |
http://linked.open...ain/vavai/riv/wos
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |