Title :
Bordered Factors of a Finite Word
Author :
Dare, V. Rajkumar ; Darshini, C. Annal Deva Priya
Author_Institution :
Dept. of Math., Madras Christian Coll., Chennai, India
Abstract :
In this paper, we define θ-bordered factor of a word, the concept of θ-valence of a bordered factor and θ sub word complexity of a word. We study some properties of involutively θ-bordered factors of a word. This study can be applied in DNA computation as it gives information on the number of sites in a DNA strand that can bind with each other affecting subsequent computations.
Keywords :
DNA; biocomputing; computational linguistics; molecular biophysics; θ-bordered factor; θ-valence; DNA computation; DNA strand; finite word; word complexity; Complexity theory; Computer science; DNA; DNA computing; Length measurement; $theta$-bordered factor; $theta$-subword complexity; $theta$-valence; involutively $theta$-bordered factor of a finite word;
Conference_Titel :
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2011 Sixth International Conference on
Conference_Location :
Penang
Print_ISBN :
978-1-4577-1092-6
DOI :
10.1109/BIC-TA.2011.22
