Minimum common string partition problem: hardness and approximations.
Goldstein, Avraham; Kolman, Petr; Zheng, Jie
The Electronic Journal of Combinatorics [electronic only] (2005)
- Volume: 12, Issue: 1, page Research Paper 50, 18 p., electronic only-Research Paper 50, 18 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGoldstein, Avraham, Kolman, Petr, and Zheng, Jie. "Minimum common string partition problem: hardness and approximations.." The Electronic Journal of Combinatorics [electronic only] 12.1 (2005): Research Paper 50, 18 p., electronic only-Research Paper 50, 18 p., electronic only. <http://eudml.org/doc/126825>.
@article{Goldstein2005,
author = {Goldstein, Avraham, Kolman, Petr, Zheng, Jie},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {String comparison},
language = {eng},
number = {1},
pages = {Research Paper 50, 18 p., electronic only-Research Paper 50, 18 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Minimum common string partition problem: hardness and approximations.},
url = {http://eudml.org/doc/126825},
volume = {12},
year = {2005},
}
TY - JOUR
AU - Goldstein, Avraham
AU - Kolman, Petr
AU - Zheng, Jie
TI - Minimum common string partition problem: hardness and approximations.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2005
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 12
IS - 1
SP - Research Paper 50, 18 p., electronic only
EP - Research Paper 50, 18 p., electronic only
LA - eng
KW - String comparison
UR - http://eudml.org/doc/126825
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.