Filters
Architecture model for approximate palindrome detection
to create a model of hardware architecture for approximate palindrome detection and, the time complexity of algorithms for palindrome detection increases when mutations occurring in DNA is a palindrom...
JC - Počítačový hardware a software
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
Hardware Acceleration of Approximate Palindromes Searching
We present FPGA-based hardware architecture for approximate palindrome searching...
JC - Počítačový hardware a software
- 2008 •
- D
Rok uplatnění
D - Stať ve sborníku
Identification of palindrome-forming sequences
This software is focused on detection of specific secondary structures forming palindromes in DNA. The program is based on dynamic programming technique. In comparison to other approaches it is able to detect palindrome...
JC - Počítačový hardware a software
- 2010 •
- R
Rok uplatnění
R - Software
On Palindromic Length of Sturmian Sequences
Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word w as the minimal number of palindromes whose concatenation is equal to w. For an infinite word ......
Pure mathematics
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On highly palindromic words
The paper studies some properties of palindromic (scattered) subwords of binary words. We construct a family of words with the highest possible degree of palindromicity....
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On Words with the Zero Palindromic Defect
We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors ...
Pure mathematics
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Palindromic length of words and morphisms in class P
We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class P introduced by Hof, Knill and Simon. We show that it grows at most logarithmically with the length of the factor. For the Fibonacci word ...
Pure mathematics
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Factor and Palindromic Complexity of The-Morse's Avatars
Two infinite words that are connected with some significant univoque numbers are studied. It is shown that their factor and palindromic complexities almost coincide with the factor and palindromic complexities of the famous Thue-Mor...
BA - Obecná matematika
- 2013 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Palindromic richness for languages invariant under more symmetries
in generalized palindromic factors, i.e., in factors $w$ satisfying $Theta(w) = w$ for some palindromes) and show two examples of $G$-rich words....
BA - Obecná matematika
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Evaluation of Biological Sequence Similarity Using FPGA Technology
Understanding structure and function of DNA sequences represents one of the most important goals in area of modern biology research. However, algorithms for DNA analysis are usually complicated by mutations caused by an evolution process, which are u...
IN - Informatika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 81 076