Reversal distance for strings with duplicates: linear time approximation using hitting set.
The Electronic Journal of Combinatorics [electronic only] (2007)
- Volume: 14, Issue: 1, page Research Paper R50, 11 p.-Research Paper R50, 11 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKolman, Petr, and Walen, Tomasz. "Reversal distance for strings with duplicates: linear time approximation using hitting set.." The Electronic Journal of Combinatorics [electronic only] 14.1 (2007): Research Paper R50, 11 p.-Research Paper R50, 11 p.. <http://eudml.org/doc/117182>.
@article{Kolman2007,
author = {Kolman, Petr, Walen, Tomasz},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {string comparison; Minimum Common String Partition Problem},
language = {eng},
number = {1},
pages = {Research Paper R50, 11 p.-Research Paper R50, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Reversal distance for strings with duplicates: linear time approximation using hitting set.},
url = {http://eudml.org/doc/117182},
volume = {14},
year = {2007},
}
TY - JOUR
AU - Kolman, Petr
AU - Walen, Tomasz
TI - Reversal distance for strings with duplicates: linear time approximation using hitting set.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2007
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 14
IS - 1
SP - Research Paper R50, 11 p.
EP - Research Paper R50, 11 p.
LA - eng
KW - string comparison; Minimum Common String Partition Problem
UR - http://eudml.org/doc/117182
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.