{"title":"有限词的边界因子","authors":"V. Dare, C. Darshini","doi":"10.1109/BIC-TA.2011.22","DOIUrl":null,"url":null,"abstract":"In this paper, we define $\\theta$-bordered factor of a word, the concept of $\\theta$-valence of a bordered factor and $\\theta$-sub word complexity of a word. We study some properties of involutively $\\theta$-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.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bordered Factors of a Finite Word\",\"authors\":\"V. Dare, C. Darshini\",\"doi\":\"10.1109/BIC-TA.2011.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we define $\\\\theta$-bordered factor of a word, the concept of $\\\\theta$-valence of a bordered factor and $\\\\theta$-sub word complexity of a word. We study some properties of involutively $\\\\theta$-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.\",\"PeriodicalId\":211822,\"journal\":{\"name\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIC-TA.2011.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIC-TA.2011.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we define $\theta$-bordered factor of a word, the concept of $\theta$-valence of a bordered factor and $\theta$-sub word complexity of a word. We study some properties of involutively $\theta$-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.