Jan Supol - Academia.edu (original) (raw)
Related Authors
Università degli Studi di Firenze (University of Florence)
Uploads
Papers by Jan Supol
We present an algorithm for matching significant subpatterns of a given pattern in a text. The si... more 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 longest subpatterns.
We present an algorithm for matching significant subpatterns of a given pattern in a text. The si... more 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 longest subpatterns.
International Journal of Foundations of Computer Science, 2005
We present a new approach to the determinisation process of specified types of automata using bit... more We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively.
focused on stringology and related topics. Stringology is a discipline concerned with algorithmic... more focused on stringology and related topics. Stringology is a discipline concerned with algorithmic processing of strings and sequences.
We present an algorithm for matching significant subpatterns of a given pattern in a text. The si... more 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 longest subpatterns.
We present an algorithm for matching significant subpatterns of a given pattern in a text. The si... more 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 longest subpatterns.
International Journal of Foundations of Computer Science, 2005
We present a new approach to the determinisation process of specified types of automata using bit... more We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively.
focused on stringology and related topics. Stringology is a discipline concerned with algorithmic... more focused on stringology and related topics. Stringology is a discipline concerned with algorithmic processing of strings and sequences.