This HTML5 document contains 43 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n6http://purl.org/net/nknouf/ns/bibtex#
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n21http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F10%3A00176036%21RIV11-MSM-21230___/
n17http://linked.opendata.cz/ontology/domain/vavai/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
n7https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F10%3A00176036%21RIV11-MSM-21230___
rdf:type
n17:Vysledek skos:Concept
dcterms:description
This paper presents successful application of the POEMS algorithm to the Shortest Common Supersequence problem (SCSP). Series of experiments with POEMS on both the artificial as well as the real biological data sets have been carried out. Results presented in this paper show that POEMS is competitive with standard state-of-the-art heuristic algorithms for solving the SCS problem This paper presents successful application of the POEMS algorithm to the Shortest Common Supersequence problem (SCSP). Series of experiments with POEMS on both the artificial as well as the real biological data sets have been carried out. Results presented in this paper show that POEMS is competitive with standard state-of-the-art heuristic algorithms for solving the SCS problem
dcterms:title
Solving the Shortest Common Supersequence Problem Using Iterative Optimization with Evolved Hypermutations Solving the Shortest Common Supersequence Problem Using Iterative Optimization with Evolved Hypermutations
skos:prefLabel
Solving the Shortest Common Supersequence Problem Using Iterative Optimization with Evolved Hypermutations Solving the Shortest Common Supersequence Problem Using Iterative Optimization with Evolved Hypermutations
skos:notation
RIV/68407700:21230/10:00176036!RIV11-MSM-21230___
n3:aktivita
n4:P n4:Z
n3:aktivity
P(1ET101210513), Z(MSM6840770038)
n3:dodaniDat
n8:2011
n3:domaciTvurceVysledku
n21:5523036 n21:1775022
n3:druhVysledku
n22:D
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
288567
n3:idVysledku
RIV/68407700:21230/10:00176036
n3:jazykVysledku
n19:eng
n3:klicovaSlova
evolutionary algorithms; iterative local search; shortest common supersequence
n3:klicoveSlovo
n10:iterative%20local%20search n10:shortest%20common%20supersequence n10:evolutionary%20algorithms
n3:kontrolniKodProRIV
[C59011F5D7E1]
n3:mistoKonaniAkce
Vienna
n3:mistoVydani
Vienna
n3:nazevZdroje
Proceedings of the Twentieth European Meeting on Cybernetics and Systems Research
n3:obor
n5:JC
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n20:1ET101210513
n3:rokUplatneniVysledku
n8:2010
n3:tvurceVysledku
Železný, Filip Kubalík, Jiří
n3:typAkce
n12:WRD
n3:zahajeniAkce
2010-04-06+02:00
n3:zamer
n14:MSM6840770038
s:numberOfPages
7
n6:hasPublisher
Austrian Society for Cybernetics Studies
n7:isbn
978-3-85206-178-8
n18:organizacniJednotka
21230