scientific article

zbMath1255.93146MaRDI QIDQ3165665

Jan Holub

Publication date: 29 October 2012

Full work available at URL: http://www.kybernetika.cz/content/2012/3/386

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingfinite automataapproximate pattern matchingborder arraysuffix automatonexact pattern matchingdegenerate symbolbitwise parallelism

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Dynamic programming in optimal control and differential games (49L20) Pattern recognition, speech recognition (68T10) Identification in stochastic control theory (93E12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient parameterized string matching
• Fast pattern-matching on indeterminate strings
• The smallest automaton recognizing the subwords of a text
• A note on linear precedence functions
• Approximate string matching using factor automata
• Transducers and repetitions
• A fast string searching algorithm
• BORDERS AND FINITE AUTOMATA
• The Constrained Longest Common Subsequence Problem for Degenerate Strings
• Finding approximate patterns in strings
• Generalized String Matching
• The theory and computation of evolutionary distances: Pattern recognition
• Efficient string matching
• Fast Pattern Matching in Strings
• Compression of individual sequences via variable-rate coding
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Algorithms For Computing Approximate Repetitions In Musical Sequences
• A Method for the Construction of Minimum-Redundancy Codes
• Finding Common Motifs with Gaps Using Finite Automata
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: