Efficient mining structural motifs for biosequences with intra- and inter-block gap constraints

Vance Chiang-Chi Liao, Ming-Syan Chen
{"title":"Efficient mining structural motifs for biosequences with intra- and inter-block gap constraints","authors":"Vance Chiang-Chi Liao, Ming-Syan Chen","doi":"10.1109/ISI.2012.6284272","DOIUrl":null,"url":null,"abstract":"Among the biological sequences, sequential pattern mining reveals implicit motifs/patterns, which are of functional significance and have specific structures. Small alphabets and long sequences, such as DNA and protein sequences, are difficult to handle by traditional sequential pattern mining algorithms. Furthermore, the intra- and inter-blocked gap constraints can deal with the substitutions, insertions, loops, and deletions in evolution process. Hence we propose an approach called Depth-first spelling algorithm for mining structural motifs with Intra- and inter-Block gap constraints in biological sequences (referred to as DIB). DIB has two execution steps. First, it constructs a three-dimensional table of sequences by scanning the given dataset once. Second, DIB-Exuberance generates intra- and inter-blocked gap sequential patterns. Candidate intra- and inter-blocked gap sequential pattern spelling and pattern verification are carried out by DIB-Exuberance in a depth-first manner. Intra and inter gap constraints are handled by the intra- and inter-block counting matrices. The block size matrix deals with intra- and inter-block size constraints. In biological sequences, DIB's runtime is much shorter than BASIC.","PeriodicalId":199734,"journal":{"name":"2012 IEEE International Conference on Intelligence and Security Informatics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Intelligence and Security Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISI.2012.6284272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Among the biological sequences, sequential pattern mining reveals implicit motifs/patterns, which are of functional significance and have specific structures. Small alphabets and long sequences, such as DNA and protein sequences, are difficult to handle by traditional sequential pattern mining algorithms. Furthermore, the intra- and inter-blocked gap constraints can deal with the substitutions, insertions, loops, and deletions in evolution process. Hence we propose an approach called Depth-first spelling algorithm for mining structural motifs with Intra- and inter-Block gap constraints in biological sequences (referred to as DIB). DIB has two execution steps. First, it constructs a three-dimensional table of sequences by scanning the given dataset once. Second, DIB-Exuberance generates intra- and inter-blocked gap sequential patterns. Candidate intra- and inter-blocked gap sequential pattern spelling and pattern verification are carried out by DIB-Exuberance in a depth-first manner. Intra and inter gap constraints are handled by the intra- and inter-block counting matrices. The block size matrix deals with intra- and inter-block size constraints. In biological sequences, DIB's runtime is much shorter than BASIC.
有效挖掘具有块内和块间间隙约束的生物序列结构基序
在生物序列中,序列模式挖掘揭示了具有特定结构和功能意义的隐性基序/模式。传统的序列模式挖掘算法难以处理小字母和长序列,如DNA和蛋白质序列。此外,内部和内部封闭的间隙约束可以处理进化过程中的替换、插入、循环和缺失。因此,我们提出了一种称为深度优先拼写算法的方法,用于挖掘生物序列中具有块内和块间间隙约束的结构基序(称为DIB)。DIB有两个执行步骤。首先,对给定数据集进行一次扫描,构建三维序列表。其次,DIB-Exuberance生成了阻塞内和阻塞间的间隙序列模式。DIB-Exuberance以深度优先的方式完成候选块内和块间间隙的顺序模式拼写和模式验证。隙内和隙间约束由块内和块间计数矩阵处理。块大小矩阵处理块内部和块之间的大小约束。在生物序列中,DIB的运行时间比BASIC短得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信