About: Searching Approximate Covers of Strings Using Finite Automata     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
  • Cover is a type of a regularity of strings. A restricted approximate cover w of string T is a factor of T such that every position of T lies within some approximate occurrence of w in T. In this paper, a polynomial time and space algorithm for solving the problem of searching all approximate covers is presented. It searches for all restricted approximate covers of a string with given limited approximation using Hamming distance and it computes the smallest distance for each found cover. The solution is based on a finite automata approach, that provides a straightforward way to design algorithms to many problems in stringology. Therefore it is shown that the set of problems solvable using finite automata includes the one studied in this paper.
  • Cover is a type of a regularity of strings. A restricted approximate cover w of string T is a factor of T such that every position of T lies within some approximate occurrence of w in T. In this paper, a polynomial time and space algorithm for solving the problem of searching all approximate covers is presented. It searches for all restricted approximate covers of a string with given limited approximation using Hamming distance and it computes the smallest distance for each found cover. The solution is based on a finite automata approach, that provides a straightforward way to design algorithms to many problems in stringology. Therefore it is shown that the set of problems solvable using finite automata includes the one studied in this paper. (en)
  • Pokrytí (cover) je druhem pravidelnosti textu. Vlastní pokrytí w textu T je faktor T takový že se každá pozice T nachází v nějakém přibližném výskytu w v T. V tomto článku je navržen algoritmus polynomiální v čase i paměti na vyhledávání všech přibližných pokrytí s danou maximální Hammingovou vzdáleností. Řešení je založeno na teorii konečných automatů, která umožňuje přímočarý návrh algoritmů na mnoho stringologických problémů. (cs)
Title
  • Searching Approximate Covers of Strings Using Finite Automata
  • Searching Approximate Covers of Strings Using Finite Automata (en)
  • Vyhledávání přibližných pokrytí textu s použitím konečných automatů (cs)
skos:prefLabel
  • Searching Approximate Covers of Strings Using Finite Automata
  • Searching Approximate Covers of Strings Using Finite Automata (en)
  • Vyhledávání přibližných pokrytí textu s použitím konečných automatů (cs)
skos:notation
  • RIV/68407700:21230/09:03152997!RIV09-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/06/1039), Z(MSM6840770014)
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
  • 340450
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/09:03152997
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • regularities of strings; stringology; finite automata; approximate covers (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [5F9D9049A492]
http://linked.open...v/mistoKonaniAkce
  • Praha
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...i/riv/nazevZdroje
  • Workshop 09
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
  • Melichar, Bořivoj
  • Guth, Ondřej
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
  • České vysoké učení technické v Praze
https://schema.org/isbn
  • 978-80-01-04286-1
http://localhost/t...ganizacniJednotka
  • 21230
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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software