"Searching Approximate Covers of Strings Using Finite Automata" . "Vyhled\u00E1v\u00E1n\u00ED p\u0159ibli\u017En\u00FDch pokryt\u00ED textu s pou\u017Eit\u00EDm kone\u010Dn\u00FDch automat\u016F"@cs . . "2"^^ . "2009-02-16+01:00"^^ . . "Searching Approximate Covers of Strings Using Finite Automata" . . . . "2"^^ . . "[5F9D9049A492]" . . "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\u00ED (cover) je druhem pravidelnosti textu. Vlastn\u00ED pokryt\u00ED w textu T je faktor T takov\u00FD \u017Ee se ka\u017Ed\u00E1 pozice T nach\u00E1z\u00ED v n\u011Bjak\u00E9m p\u0159ibli\u017En\u00E9m v\u00FDskytu w v T. V tomto \u010Dl\u00E1nku je navr\u017Een algoritmus polynomi\u00E1ln\u00ED v \u010Dase i pam\u011Bti na vyhled\u00E1v\u00E1n\u00ED v\u0161ech p\u0159ibli\u017En\u00FDch pokryt\u00ED s danou maxim\u00E1ln\u00ED Hammingovou vzd\u00E1lenost\u00ED. \u0158e\u0161en\u00ED je zalo\u017Eeno na teorii kone\u010Dn\u00FDch automat\u016F, kter\u00E1 umo\u017E\u0148uje p\u0159\u00EDmo\u010Dar\u00FD n\u00E1vrh algoritm\u016F na mnoho stringologick\u00FDch probl\u00E9m\u016F."@cs . "Melichar, Bo\u0159ivoj" . . "RIV/68407700:21230/09:03152997!RIV09-MSM-21230___" . "Praha" . . "Praha" . "2"^^ . "\u010Cesk\u00E9 vysok\u00E9 u\u010Den\u00ED technick\u00E9 v Praze" . "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." . . "978-80-01-04286-1" . . "21230" . . . . "Workshop 09" . . "regularities of strings; stringology; finite automata; approximate covers"@en . "Guth, Ond\u0159ej" . . . "RIV/68407700:21230/09:03152997" . . "Searching Approximate Covers of Strings Using Finite Automata"@en . "Vyhled\u00E1v\u00E1n\u00ED p\u0159ibli\u017En\u00FDch pokryt\u00ED textu s pou\u017Eit\u00EDm kone\u010Dn\u00FDch automat\u016F"@cs . "340450" . "Searching Approximate Covers of Strings Using Finite Automata"@en . "P(GA201/06/1039), Z(MSM6840770014)" . .