PDA to Identify Palindrome Subsequence Problem in DNA Sequence

Authors

  • Anupama B S Information Science and Engineering, Channabasaveshwara Institute of Technology, Tumkur, India Author
  • Prasanna K B Computer Science and Engineering, Channabasaveshwara Institute of Technology, Tumkur, India Author

Keywords:

The PushDown Automata, subsequence algorithm, DNA base sequence.

Abstract

DNA molecules contains the strings consisting of four symbols namely 1) A-adenine,2)C-cytosine , 3) G - guanine and 4 ) T –thymine. Since the bio-molecular structures can be defined in terms of sequence of symbols (i.e., strings) there exists a correlation between formal model and bi-molecular structure. DNA palindromes appear frequently and are widespread in human cancers. Identifying them could help advance the understanding of genomic instability (Choi Charles Q, 2005; Tanaka, Hisashi; et al, 2003). The Palindrome subsequences detection problem is therefore an important issue in computational biology. In this paper we presented a Push down Automata Model (PDA) to identify all palindrome subsequence that is present in the DNA sequence.

References

Downloads

Published

2014-12-31

Issue

Section

Articles

How to Cite

PDA to Identify Palindrome Subsequence Problem in DNA Sequence. (2014). International Journal of Current Engineering and Technology, 4(6), 4263-4265. https://ijcet.evegenis.org/index.php/ijcet/article/view/1603