查找字符串中的结构
感谢您查看我的第一篇文章。我需要在一段相当长的字符串中找到一些模式，使我能够将该字符串分解为结构的各个组成部分。这个问题与生物序列有关，其中 DNA 中有编码基因的区域，也有不编码基因的区域。唯一允许的字符是 A、C、G、T。假设编码区域和非编码区域未知。因此，目标是在字符串中找到允许区分编码区和非编码区的模式。实际上，存在已知的编码区域，但我想弄清楚如何在缺乏此信息的情况下解决这个问题。我有一些想法，但我想看看你们经验丰富的程序员和数学家会如何解决这个问题。我是一名初学者程序员，我没有数学背景，因此我希望向大家学习。 感谢您的关注。
thank you for looking at my first post. I need to find within a string of substantial length, patterns that will allow me to break that string up into components of structure. This question is related to a biological sequence where in DNA there are regions that code for genes, and regions that do not. The only characters permitted are A,C,G,T. Assume that the regions that are coding and non-coding are unknown. Thus the goal is the find a pattern within the string that allows differentiation of coding and non-coding regions. In reality, there are known coding regions but I wanted to figure out how to approach this problem in the absence of this information. I have a few ideas but I wanted to see how you experienced programmers and mathematicians would approach this. I am a beginner programmer and I do not have a background in maths thus I am hoping to learn from you all.
Thank you for your attention.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论