{"title":"DNA分类的无限串块匹配特征","authors":"D. Ashlock, Sierra Gillis, W. Ashlock","doi":"10.1109/CIBCB.2017.8058529","DOIUrl":null,"url":null,"abstract":"Automatic classification of DNA can be performed in a number of ways using a variety of features. This study introduces a novel technique for generating global features for DNA classification. Based on a new technique, the “do what's possible” representation, infinite string generators are evolved to produce strings with a maximized collection of matching blocks above a critical length in the target DNA. Most global DNA features, such as GC-content or those in spectrum string kernels, capture diffuse statistical information about the target DNA. Infinite string matching is based on multiple loci, and thus finds a different type of global feature than most techniques now in use. It is discovered that the block-matching score for evolved infinite string generators is able to cleanly separate high-entropy synthetic DNA data sets using a single feature threshold classifier. Preliminary evaluation on human endogenous retrovirus sequences shows that evolved infinite string generators locate promising features on biological data as well.","PeriodicalId":283115,"journal":{"name":"2017 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Infinite string block matching features for DNA classification\",\"authors\":\"D. Ashlock, Sierra Gillis, W. Ashlock\",\"doi\":\"10.1109/CIBCB.2017.8058529\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Automatic classification of DNA can be performed in a number of ways using a variety of features. This study introduces a novel technique for generating global features for DNA classification. Based on a new technique, the “do what's possible” representation, infinite string generators are evolved to produce strings with a maximized collection of matching blocks above a critical length in the target DNA. Most global DNA features, such as GC-content or those in spectrum string kernels, capture diffuse statistical information about the target DNA. Infinite string matching is based on multiple loci, and thus finds a different type of global feature than most techniques now in use. It is discovered that the block-matching score for evolved infinite string generators is able to cleanly separate high-entropy synthetic DNA data sets using a single feature threshold classifier. Preliminary evaluation on human endogenous retrovirus sequences shows that evolved infinite string generators locate promising features on biological data as well.\",\"PeriodicalId\":283115,\"journal\":{\"name\":\"2017 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIBCB.2017.8058529\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBCB.2017.8058529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Infinite string block matching features for DNA classification
Automatic classification of DNA can be performed in a number of ways using a variety of features. This study introduces a novel technique for generating global features for DNA classification. Based on a new technique, the “do what's possible” representation, infinite string generators are evolved to produce strings with a maximized collection of matching blocks above a critical length in the target DNA. Most global DNA features, such as GC-content or those in spectrum string kernels, capture diffuse statistical information about the target DNA. Infinite string matching is based on multiple loci, and thus finds a different type of global feature than most techniques now in use. It is discovered that the block-matching score for evolved infinite string generators is able to cleanly separate high-entropy synthetic DNA data sets using a single feature threshold classifier. Preliminary evaluation on human endogenous retrovirus sequences shows that evolved infinite string generators locate promising features on biological data as well.