Add to ORKGThis work discusses problematics of exact and approximate palindrome searching. In relation with exact palindrome searching, native algorithm and algorithm using suffix trees, which construction is also analyzed, is presented. Approximate palindrome search is implemented with application of dynamic programming principles. The search itself is dividded into three parts: palidnrome search, result filter and reconstruction of palindromes. Each part is described by an algorithm and implemented in a program, contained in attachment
This work discusses problems of suffix trees implementation and their use in bioinformatics. There a...
Abslract- DNA matching is an important key to understanding genomes, evolution, relationships betwee...
some alphabet Σ = {a1... aK} and a pattern or query string P = p1... pm, m < n in the same alphab...
This work deals with conception and implemetation of tools for finding approximate palindromes in DN...
[[abstract]]Palindromes are strings of symbols that read the same forward and backward. Palindromes ...
Background/Objectives: In the biological sequences, palindromes can create structures that differ fr...
Genetic information of all living organisms is stored in DNA. Exploring of its structure and functio...
A palindrome is a set of characters that reads the same forwards and backwards. Since the discovery ...
Following string matching, two more string analysis problems occur commonly in bioinformatics applic...
The base-pairing of a nucleic acid secondary structure is a sort of biological palindrome. The base ...
We propose a new linear-size data structure which provides a fast access to all palindromic substrin...
The detection of palindromes is a classical and well-studied problem in computer science, language t...
[[abstract]]In this paper, a novel algorithm for approximate pattern matching fom multiple DNA or am...
This work describes perspective data structure called suffix array. This data structure is described...
A theory for the derivation of on-line algorithms is presented. The algorithms are derived in the B...
This work discusses problems of suffix trees implementation and their use in bioinformatics. There a...
Abslract- DNA matching is an important key to understanding genomes, evolution, relationships betwee...
some alphabet Σ = {a1... aK} and a pattern or query string P = p1... pm, m < n in the same alphab...
This work deals with conception and implemetation of tools for finding approximate palindromes in DN...
[[abstract]]Palindromes are strings of symbols that read the same forward and backward. Palindromes ...
Background/Objectives: In the biological sequences, palindromes can create structures that differ fr...
Genetic information of all living organisms is stored in DNA. Exploring of its structure and functio...
A palindrome is a set of characters that reads the same forwards and backwards. Since the discovery ...
Following string matching, two more string analysis problems occur commonly in bioinformatics applic...
The base-pairing of a nucleic acid secondary structure is a sort of biological palindrome. The base ...
We propose a new linear-size data structure which provides a fast access to all palindromic substrin...
The detection of palindromes is a classical and well-studied problem in computer science, language t...
[[abstract]]In this paper, a novel algorithm for approximate pattern matching fom multiple DNA or am...
This work describes perspective data structure called suffix array. This data structure is described...
A theory for the derivation of on-line algorithms is presented. The algorithms are derived in the B...
This work discusses problems of suffix trees implementation and their use in bioinformatics. There a...
Abslract- DNA matching is an important key to understanding genomes, evolution, relationships betwee...
some alphabet Σ = {a1... aK} and a pattern or query string P = p1... pm, m < n in the same alphab...