有限词的边界因子

V. Dare, C. Darshini
{"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}
引用次数: 0

摘要

在本文中,我们定义了一个词的$\theta$-边界因子,$\theta$-边界因子的价和一个词的$\theta$-子词复杂度的概念。我们研究了一个词的对边因子的一些性质。这项研究可以应用于DNA计算,因为它提供了DNA链中可以相互结合影响后续计算的位点数量的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bordered Factors of a Finite Word
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信