Filters
String Suffix Automata and Subtree Pushdown Automata
String suffix automata accept all suffixes of a given string and belong to the fundamental stringology principles. Extending their transitions by specific pushdown operations results in new subtree pushd...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Searching for Regularities in Generalized Strings using Finite Automata
Searching for Regularities in Generalized Strings using Finite Automata.
IN - Informatika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Suffix Automata and Parallel String Matching
We present a parallel string matching methodology. The methodology allows exact and approximate string matching using any edit distance preserving the length of string. Hamming,Delta, Gamma, and DeltaGamma distances are exa...
IN - Informatika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Searching for Regularities in Strings using Finite Automata
New algorithms for searching repetetive structures and for pattern matching in DNA are presented. Methods are based on use of finite automata ....
IN - Informatika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Borders and Finite Automata
of sets of prefixes and suffixes of the input string. Last but not least we defineA border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keyst...
IN - Informatika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Finite Automata Approach to Computing All Seeds of Strings with the Smallest Hamming Distance
for eachfound seed. The solution is based on a finite (suffix) automata approachSeed is a type of a regularity of strings. A restricted approximate seed w of string T is a factor of T such that w covers a superstr...
IN - Informatika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The Finite Automata Approaches in Stringology
of finite automata solutions. We also show how the finite automata can process stringsWe present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, determinis...
IN - Informatika
- 2012 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Searching All Seeds of Strings with Hamming Distance using Finite Automata
for eachfound seed. The solution is based on a finite (suffix) automata approachSeed is a type of a regularity of strings. A restricted approximate seed w of string T is a factor of T such that w covers a superstr...
IN - Informatika
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Tree Indexing by Pushdown Automata and Repeats of Subtrees
to the relationship between string deterministic suffix automata and factor repeats in agiven string.
IN - Informatika
- 2011 •
- O •
- Link
Rok uplatnění
O - Ostatní výsledky
Výsledek na webu
Using Finite Automata Approach for Searching Approximate Seeds of Strings
Seed is a type of a regularity of strings. A restricted approximate seed w of string T is a factor of T such that w covers a superstring of T under some distance of a string with given limited approximation using Hamming di...
IN - Informatika
- 2010 •
- C •
- Link
Rok uplatnění
C - Kapitola v odborné knize
Výsledek na webu
- 1 - 10 out of 3 471