About: Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In the last decade there has been an ongoing interest in string comparison problems. Particular attention has been given to the problem of {\em sorting by reversals} ({\SBR}): given two strings, $A$ and $B$, find the minimum number of reversals that transform the string $A$ into the string $B$ (a {\em reversal} $\rho(i,j)$, $i.lt.j$, transforms a string $A=a_1\ldots a_n$ into a string $A'=a_1\ldots a_{i-1} a_{j} a_{j-1} \ldots a_{i} a_{j 1} \ldots a_n$). In this paper we consider the problem $k$-{\SBR}, a version of {\SBR} in which each symbol is allowed to appear up to $k$ times in each string, for some $k\geq 1$. The main result of the paper is a $\Theta(k)$-approximation algorithm for $k$-{\SBR} running in time $O(n)$, compared to the previously known algorithm for $k$-{\SBR}, this is an improvement by a factor of $\Theta(k)$ in the approximation ratio, and by a factor of $\Theta(k)$ in the running time. In the last decade there has been an ongoing interest in string comparison problems. Particular attention has been given to the problem of {\em sorting by reversals} ({\SBR}): given two strings, $A$ and $B$, find the minimum number of reversals that transform the string $A$ into the string $B$ (a {\em reversal} $\rho(i,j)$, $i.lt.j$, transforms a string $A=a_1\ldots a_n$ into a string $A'=a_1\ldots a_{i-1} a_{j} a_{j-1} \ldots a_{i} a_{j 1} \ldots a_n$). In this paper we consider the problem $k$-{\SBR}, a version of {\SBR} in which each symbol is allowed to appear up to $k$ times in each string, for some $k\geq 1$. The main result of the paper is a $\Theta(k)$-approximation algorithm for $k$-{\SBR} running in time $O(n)$, compared to the previously known algorithm for $k$-{\SBR}, this is an improvement by a factor of $\Theta(k)$ in the approximation ratio, and by a factor of $\Theta(k)$ in the running time. (en)
Title	Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set (en)
skos:prefLabel	Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set (en)
skos:notation	RIV/00216208:11320/06:00206144!RIV10-MSM-11320___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1M0545), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Kolman, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	497482
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/06:00206144
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Reversal; Distance; Strings; Duplicates; Linear; Approximation; using; Hitting; Set (en)
http://linked.open.../riv/klicoveSlovo	Distance using Set Duplicates Approximation Linear Reversal Strings Hitting
http://linked.open...ontrolniKodProRIV	[A54FCD8183D3]
http://linked.open...v/mistoKonaniAkce	Berlin
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Approximation and Online Algorithms
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Institute for Theoretical Computer Science
http://linked.open...UplatneniVysledku	2006
http://linked.open...iv/tvurceVysledku	Kolman, Petr Walen, Tomasz
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000244556500022
http://linked.open.../riv/zahajeniAkce	2006-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	11 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-540-69513-4
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software