Attributes | Values |
---|
rdf:type
| |
Description
| - Hranice textu je poedpona, která je zároveo poíponou. Jedná se o jeden ze základních stringologických pojmu, vyu3ívaných v rámci slo3itij1ích algoritmu vyhledávání, analýzy DNA sekvencí, hudby a dal1ích. Elánek popisuje algoritmus ALL_BORDERS Iliopoulose a jeho kolegu na základi teorie koneených automatu. Tento algoritmus vyhledá v1echny hranice v1ech poedpon textu s don't care symboly. Ukazujeme, 3e algoritmus ALL_BORDERS simuluje einnost koneeného automatu. Zároveo vysvitlujeme princip einnosti tohoto automatu. S vyu3itím znalosti souvislosti algoritmu a koneených automatu zobecníme algoritmus ALL_BORDERS pro vyhledávání poibli3ných hranic textu. (cs)
- A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper discusses automata-theoretical background of Iliopoulos's ALL_BORDERS algorithm that finds all borders of a string with don't care symbols. We show that ALL_BORDERS algorithm is a simulator of a finite automaton together with explaining the function of the automaton. We show that the simulated automaton accepts intersection of sets of prefixes and suffixes of the input string. Last but not least we define approximate borders. Based on the knowledge of the automata background of ALL_BORDERS algorithm we offer an automata-based algorithm that finds approximate borders with Hamming distance.
- A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper discusses automata-theoretical background of Iliopoulos's ALL_BORDERS algorithm that finds all borders of a string with don't care symbols. We show that ALL_BORDERS algorithm is a simulator of a finite automaton together with explaining the function of the automaton. We show that the simulated automaton accepts intersection of sets of prefixes and suffixes of the input string. Last but not least we define approximate borders. Based on the knowledge of the automata background of ALL_BORDERS algorithm we offer an automata-based algorithm that finds approximate borders with Hamming distance. (en)
|
Title
| - Borders and Finite Automata
- Borders and Finite Automata (en)
- Hranice v textu a koneené automaty (cs)
|
skos:prefLabel
| - Borders and Finite Automata
- Borders and Finite Automata (en)
- Hranice v textu a koneené automaty (cs)
|
skos:notation
| - RIV/68407700:21230/06:03120554!RIV07-GA0-21230___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA201/06/1039), S, 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
| |
http://linked.open...ai/riv/idVysledku
| - RIV/68407700:21230/06:03120554
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Hamming distance; border; finite automaton (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Implementation and Application of Automata
|
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
| - Šimunek, Martin
- Melichar, Booivoj
|
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
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |