About: The greedy algorithm for the minimum common string partition problem     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)

AttributesValues
rdf:type
Description
  • Článek studuje hladový algoritmus pro minimální společné rozdělení řetízků. (cs)
  • 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 greed algorithm for MCSP.
  • 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 greed algorithm for MCSP. (en)
Title
  • The greedy algorithm for the minimum common string partition problem
  • The greedy algorithm for the minimum common string partition problem (en)
  • Hladový algoritmus pro minimální společné rozdělení řetízků (cs)
skos:prefLabel
  • The greedy algorithm for the minimum common string partition problem
  • The greedy algorithm for the minimum common string partition problem (en)
  • Hladový algoritmus pro minimální společné rozdělení řetízků (cs)
skos:notation
  • RIV/67985840:_____/04:00106921!RIV/2005/MSM/A05005/N
http://linked.open.../vavai/riv/strany
  • 84;95
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(IAA1019401), P(LN00A056), Z(AV0Z1019905)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 565769
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/04:00106921
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • string algorithms;approximation algorithms (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [7F25487FAA84]
http://linked.open...v/mistoKonaniAkce
  • Cambridge
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the APPROX
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Chrobak, M.
  • Sgall, Jiří
  • Kolman, P.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software