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%2F00216208%3A11320%2F04%3A00003543" target="_blank" >RIV/00216208:11320/04:00003543 - 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, minimimizing the number of the substrings in the partition.
Czech name
Hladov7 algoritmus pro MCSP problém
Czech description
V MCSP problému jsou na vstupu dány dva řetězce, které chceme rozsekat do stejné množiny podřetězců, přičemž minimalizujeme počet prvků v této množině.
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
<a href="/en/project/LN00A056" target="_blank" >LN00A056: Institute of Theoretical Computer Science (Center of Young Science)</a><br>
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
2004
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
Lecture Notes In Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
3122
Issue of the periodical within the volume
3122
Country of publishing house
US - UNITED STATES
Number of pages
12
Pages from-to
84-95
UT code for WoS article
—
EID of the result in the Scopus database
—