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}
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.