The greedy algorithm for the minimum common string partition problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F05%3A00041403" target="_blank" >RIV/67985840:_____/05:00041403 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The greedy algorithm for the minimum common string partition problem
Original language description
In the Minimum Common String Partition problem(MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the number of the substrings in the partition. Even a special case, denoted 2-MCSP, where each letter occurs at most twice in each input string, is NP-hard. We study a greedy algorithm for MCSP that at each step extracts a longest common substring from the given strings.
Czech name
Hladový algoritmus pro minimální společné rozdělení řetízků
Czech description
Článek analyzuje hladový algoritmus pro minimální společné rozdělení řetízků.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ACM Transactions on Algorithms
ISSN
1549-6325
e-ISSN
—
Volume of the periodical
1
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
350-366
UT code for WoS article
—
EID of the result in the Scopus database
—