Simsearcher: a local similarity search engine for biological sequence databases

Tian-Haw Tsai, Suh-Yin Lee
{"title":"Simsearcher: a local similarity search engine for biological sequence databases","authors":"Tian-Haw Tsai, Suh-Yin Lee","doi":"10.1109/MMSE.2003.1254456","DOIUrl":null,"url":null,"abstract":"An efficient local similarity search engine is developed by exploiting some techniques of data mining. All frequent patterns in the database are retrieved and recorded in a one-time preprocessing process. Then a query sequence is checked to see whether any pattern from the preprocessing stage is matched to the query. Two regions coming from the query and a database sequence that both match a pattern form a possible seed for local similarity. Finally, we extend and score each such seed region pair to see whether there really exists local similarity with a score high enough for reporting. For computational efficiency, a novel clustering approach is proposed and integrated into the proposed system, which is based on the local similarity search engine - the DELPHI system proposed by IBM. Extensive experiments are demonstrated to show the performance of our system.","PeriodicalId":322357,"journal":{"name":"Fifth International Symposium on Multimedia Software Engineering, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth International Symposium on Multimedia Software Engineering, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSE.2003.1254456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

An efficient local similarity search engine is developed by exploiting some techniques of data mining. All frequent patterns in the database are retrieved and recorded in a one-time preprocessing process. Then a query sequence is checked to see whether any pattern from the preprocessing stage is matched to the query. Two regions coming from the query and a database sequence that both match a pattern form a possible seed for local similarity. Finally, we extend and score each such seed region pair to see whether there really exists local similarity with a score high enough for reporting. For computational efficiency, a novel clustering approach is proposed and integrated into the proposed system, which is based on the local similarity search engine - the DELPHI system proposed by IBM. Extensive experiments are demonstrated to show the performance of our system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Simsearcher:生物序列数据库的局部相似性搜索引擎
利用数据挖掘技术,开发了一种高效的局部相似度搜索引擎。在一次预处理过程中检索和记录数据库中的所有频繁模式。然后检查查询序列,以查看预处理阶段中的任何模式是否与查询匹配。来自查询和数据库序列的两个区域都匹配一个模式,形成了局部相似性的可能种子。最后,我们对每个这样的种子区域对进行扩展和评分,看看是否真的存在足够高的局部相似度来进行报告。为了提高计算效率,提出了一种新的聚类方法,并将其集成到该系统中,该方法基于IBM的局部相似度搜索引擎- DELPHI系统。大量的实验证明了系统的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Searching the regulatory protein binding site by steepest ascent algorithm ConKMeL: a contextual knowledge management framework to support intelligent multimedia e-learning Non-uniform partition strategies for indexing high-dimensional data with different distributions Theories of learning: a computer game perspective Using neuro-fuzzy techniques based on a two-stage mapping model for concept-based image database indexing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1