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
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n14http://purl.org/net/nknouf/ns/bibtex#
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n20http://linked.opendata.cz/ontology/domain/vavai/
n13https://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F04%3A00109860%21RIV12-MSM-21230___/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F04%3A00109860%21RIV12-MSM-21230___
rdf:type
skos:Concept n20:Vysledek
dcterms:description
Generalized and weighted strings are special strings capable of expressing variability and uncertainity of appearance of a symbol in a given position. These types of strings are mainly used in molecular biology. In this paper we present a finite state automata approach for solving various pattern matching problems. We present the Generalized Factor Automaton (GFA), a novel structure for indexing generalized strings. We show how to use GFA for substring searching and searching maximum repeating factors in generalized strings. Finally, we show how to transform the finite automaton for a given pattern matching problem on strings to an automaton for the pattern matching problem on generalized strings. Generalized and weighted strings are special strings capable of expressing variability and uncertainity of appearance of a symbol in a given position. These types of strings are mainly used in molecular biology. In this paper we present a finite state automata approach for solving various pattern matching problems. We present the Generalized Factor Automaton (GFA), a novel structure for indexing generalized strings. We show how to use GFA for substring searching and searching maximum repeating factors in generalized strings. Finally, we show how to transform the finite automaton for a given pattern matching problem on strings to an automaton for the pattern matching problem on generalized strings.
dcterms:title
Generalized and Weighted Strings: Repetitions and Pattern Matching Generalized and Weighted Strings: Repetitions and Pattern Matching
skos:prefLabel
Generalized and Weighted Strings: Repetitions and Pattern Matching Generalized and Weighted Strings: Repetitions and Pattern Matching
skos:notation
RIV/68407700:21230/04:00109860!RIV12-MSM-21230___
n4:aktivita
n11:Z
n4:aktivity
Z(MSM 212300014)
n4:dodaniDat
n5:2012
n4:domaciTvurceVysledku
n10:9708111 n10:3764818
n4:druhVysledku
n16:C
n4:duvernostUdaju
n8:S
n4:entitaPredkladatele
n18:predkladatel
n4:idSjednocenehoVysledku
565265
n4:idVysledku
RIV/68407700:21230/04:00109860
n4:jazykVysledku
n17:eng
n4:klicovaSlova
DNA; generalized factor automaton; generalized strings; pattern matching; repetitions; weighted strings
n4:klicoveSlovo
n7:generalized%20factor%20automaton n7:generalized%20strings n7:pattern%20matching n7:weighted%20strings n7:DNA n7:repetitions
n4:kontrolniKodProRIV
[365963C83882]
n4:mistoVydani
London
n4:nazevZdroje
Texts in Algorithmics, Volume 2 - String Algorithmics
n4:obor
n15:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetStranKnihy
251
n4:pocetTvurcuVysledku
3
n4:rokUplatneniVysledku
n5:2004
n4:tvurceVysledku
Christodoulakis, M. Melichar, Bořivoj Voráček, Michal
n4:zamer
n12:MSM%20212300014
s:numberOfPages
24
n14:hasPublisher
King's College
n13:isbn
1-904987-02-8
n19:organizacniJednotka
21230