下一代测序中最优读切边及其复杂度研究

{"title":"下一代测序中最优读切边及其复杂度研究","authors":"Ivo Hedtke, Ioana M. Lemnian, M. Müller-Hannemann, I. Grosse","doi":"10.1007/978-3-319-07953-0_7","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":371010,"journal":{"name":"International Conference on Algorithms for Computational Biology","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On Optimal Read Trimming in Next Generation Sequencing and Its Complexity\",\"authors\":\"Ivo Hedtke, Ioana M. Lemnian, M. Müller-Hannemann, I. Grosse\",\"doi\":\"10.1007/978-3-319-07953-0_7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":371010,\"journal\":{\"name\":\"International Conference on Algorithms for Computational Biology\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Algorithms for Computational Biology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-07953-0_7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Algorithms for Computational Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-07953-0_7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}