"978-3-540-76335-2" . . "Significant Subpatterns Matching"@en . "Springer-Verlag" . "Vyhled\u00E1v\u00E1n\u00ED v\u00FDznamn\u00FDch podvzork\u016F v textu"@cs . . "Significant Subpatterns Matching" . "Berlin" . . "21230" . . "RIV/68407700:21230/07:03133334" . "We present an algorithm for matching significant subpatterns of a given pattern in a text. The significant subpattern is any subpattern of the pattern which is at least of some specified length. We use bit-parallel simulation of an automaton for matching all subpatterns. The bit-parallel approach enables us to count the length of the longest subpatterns." . "NFA simulation; finite automata; pattern matching; subpattern"@en . . "[E579F4CAB5F2]" . "Significant Subpatterns Matching"@en . "RIV/68407700:21230/07:03133334!RIV08-GA0-21230___" . . "449771" . "Vyhled\u00E1v\u00E1n\u00ED v\u00FDznamn\u00FDch podvzork\u016F v textu"@cs . "317;319" . "\u0160upol, Jan" . "Prague" . . "Twelfth International Conference on Implementation and Application of Automata" . . . "3"^^ . "1"^^ . "Significant Subpatterns Matching" . . "We present an algorithm for matching significant subpatterns of a given pattern in a text. The significant subpattern is any subpattern of the pattern which is at least of some specified length. We use bit-parallel simulation of an automaton for matching all subpatterns. The bit-parallel approach enables us to count the length of the longest subpatterns."@en . "Nen\u00ED k dispozici"@cs . . . . "2007-07-16+02:00"^^ . "P(GA201/06/1039), Z(MSM6840770014)" . . . . "1"^^ . . . .