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
  • 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.
  • 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. (en)
  • Článek analyzuje hladový algoritmus pro minimální společné rozdělení řetízků. (cs)
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:_____/05:00041403!RIV07-AV0-67985840
http://linked.open.../vavai/riv/strany
  • 350;366
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/05/0124), P(IAA1019401), Z(AV0Z10190503)
http://linked.open...iv/cisloPeriodika
  • 2
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
  • 522916
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/05:00041403
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • string algorithms; approximation algorithms (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [28C1FBD520E4]
http://linked.open...i/riv/nazevZdroje
  • ACM Transactions on Algorithms
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...v/svazekPeriodika
  • 1
http://linked.open...iv/tvurceVysledku
  • Chrobak, M.
  • Sgall, Jiří
  • Kolman, P.
http://linked.open...n/vavai/riv/zamer
issn
  • 1549-6325
number of pages
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