基于时频的生物序列查询

L. Ravichandran, A. Papandreou-Suppappola, A. Spanias, Z. Lacroix, C. Legendre
{"title":"基于时频的生物序列查询","authors":"L. Ravichandran, A. Papandreou-Suppappola, A. Spanias, Z. Lacroix, C. Legendre","doi":"10.1109/ICASSP.2010.5495708","DOIUrl":null,"url":null,"abstract":"We investigate the use of time-frequency (TF) methods to query biological sequences in search of regions of similarity or critical relationships among the sequences. Existing querying approaches are insensitive to repeats, especially in low-complexity regions, and do not provide much support for efficiently querying sub-sequences with inserts and deletes (or gaps). Our approach uses highly-localized basis functions and multiple transformations in the TF plane to map characters in a sequence as well as different properties of a sub-sequence, such as its position in the sequence or number of gaps between sub-sequences. We analyze gapped query-based alignment methods using transformations in the TF plane while demonstrating the method's possible operation in real-time without pre-processing. The algorithm's performance is compared to the widely-accepted BLAST alignment approach, and a significance improvement is observed for queries with repetitive segments.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Time-frequency based biological sequence querying\",\"authors\":\"L. Ravichandran, A. Papandreou-Suppappola, A. Spanias, Z. Lacroix, C. Legendre\",\"doi\":\"10.1109/ICASSP.2010.5495708\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the use of time-frequency (TF) methods to query biological sequences in search of regions of similarity or critical relationships among the sequences. Existing querying approaches are insensitive to repeats, especially in low-complexity regions, and do not provide much support for efficiently querying sub-sequences with inserts and deletes (or gaps). Our approach uses highly-localized basis functions and multiple transformations in the TF plane to map characters in a sequence as well as different properties of a sub-sequence, such as its position in the sequence or number of gaps between sub-sequences. We analyze gapped query-based alignment methods using transformations in the TF plane while demonstrating the method's possible operation in real-time without pre-processing. The algorithm's performance is compared to the widely-accepted BLAST alignment approach, and a significance improvement is observed for queries with repetitive segments.\",\"PeriodicalId\":293333,\"journal\":{\"name\":\"2010 IEEE International Conference on Acoustics, Speech and Signal Processing\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Acoustics, Speech and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.2010.5495708\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.2010.5495708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

我们研究了使用时频(TF)方法来查询生物序列,以寻找序列之间的相似区域或关键关系。现有的查询方法对重复不敏感,特别是在低复杂度区域,并且不支持有效地查询具有插入和删除(或间隙)的子序列。我们的方法使用高度局域基函数和TF平面上的多重变换来映射序列中的字符以及子序列的不同属性,例如其在序列中的位置或子序列之间的间隙数量。我们使用TF平面中的转换分析了基于间隙查询的对齐方法,同时演示了该方法在没有预处理的情况下实时操作的可能性。将该算法的性能与广泛接受的BLAST对齐方法进行了比较,并在具有重复段的查询中观察到显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Time-frequency based biological sequence querying
We investigate the use of time-frequency (TF) methods to query biological sequences in search of regions of similarity or critical relationships among the sequences. Existing querying approaches are insensitive to repeats, especially in low-complexity regions, and do not provide much support for efficiently querying sub-sequences with inserts and deletes (or gaps). Our approach uses highly-localized basis functions and multiple transformations in the TF plane to map characters in a sequence as well as different properties of a sub-sequence, such as its position in the sequence or number of gaps between sub-sequences. We analyze gapped query-based alignment methods using transformations in the TF plane while demonstrating the method's possible operation in real-time without pre-processing. The algorithm's performance is compared to the widely-accepted BLAST alignment approach, and a significance improvement is observed for queries with repetitive segments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信