PDA to Identify Palindrome Subsequence Problem in DNA Sequence
Pages : 4263-4265
Download PDF
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.
Keywords: The PushDown Automata, subsequence algorithm, DNA base sequence.
Article published in International Journal of Current Engineering and Technology, Vol.4, No.6 (Dec-2014)