{"title":"生物序列的SCP和压缩域分析","authors":"D. Adjeroh, Jianan Feng","doi":"10.1109/CSB.2003.1227416","DOIUrl":null,"url":null,"abstract":"We introduce the SCP - the sorted common prefix, and study some of its properties. Based on the internal representations used by a class of new compression schemes, we show how the SCP table can be constructed using an O(u+| /spl Sigma/ |K/sub max/) number of comparisons on average, and O(u | /spl Sigma/ |) worst case, where u is the size of the sequence, | /spl Sigma/ | is the number of symbols, and K/sub max/ is the maximum SCP value. We describe one application of the SCP to the problem of anchor points in multiple sequence alignment.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"210 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"The SCP and compressed domain analysis of biological sequences\",\"authors\":\"D. Adjeroh, Jianan Feng\",\"doi\":\"10.1109/CSB.2003.1227416\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce the SCP - the sorted common prefix, and study some of its properties. Based on the internal representations used by a class of new compression schemes, we show how the SCP table can be constructed using an O(u+| /spl Sigma/ |K/sub max/) number of comparisons on average, and O(u | /spl Sigma/ |) worst case, where u is the size of the sequence, | /spl Sigma/ | is the number of symbols, and K/sub max/ is the maximum SCP value. We describe one application of the SCP to the problem of anchor points in multiple sequence alignment.\",\"PeriodicalId\":147883,\"journal\":{\"name\":\"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003\",\"volume\":\"210 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSB.2003.1227416\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSB.2003.1227416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The SCP and compressed domain analysis of biological sequences
We introduce the SCP - the sorted common prefix, and study some of its properties. Based on the internal representations used by a class of new compression schemes, we show how the SCP table can be constructed using an O(u+| /spl Sigma/ |K/sub max/) number of comparisons on average, and O(u | /spl Sigma/ |) worst case, where u is the size of the sequence, | /spl Sigma/ | is the number of symbols, and K/sub max/ is the maximum SCP value. We describe one application of the SCP to the problem of anchor points in multiple sequence alignment.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
