{"title":"解决生物序列和生物结构问题","authors":"Xiuzhen Huang","doi":"10.1109/IMSCCS.2008.26","DOIUrl":null,"url":null,"abstract":"In computational biology, many fundamental bio-sequence and bio-structure problems are computationally intractable, which call for the development of algorithmic techniques and complexity analysis methods in theory of computing. This paper presents a review of our work on developing novel algorithmic techniques and new complexity analysis methodology and applying them to address bio-sequence and bio-structure problems. This research also demonstrate beautiful theoretical properties and important practical applications.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Addressing Bio-sequence and Bio-structure Problems\",\"authors\":\"Xiuzhen Huang\",\"doi\":\"10.1109/IMSCCS.2008.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In computational biology, many fundamental bio-sequence and bio-structure problems are computationally intractable, which call for the development of algorithmic techniques and complexity analysis methods in theory of computing. This paper presents a review of our work on developing novel algorithmic techniques and new complexity analysis methodology and applying them to address bio-sequence and bio-structure problems. This research also demonstrate beautiful theoretical properties and important practical applications.\",\"PeriodicalId\":122953,\"journal\":{\"name\":\"2008 International Multi-symposiums on Computer and Computational Sciences\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Multi-symposiums on Computer and Computational Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2008.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Multi-symposiums on Computer and Computational Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2008.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Addressing Bio-sequence and Bio-structure Problems
In computational biology, many fundamental bio-sequence and bio-structure problems are computationally intractable, which call for the development of algorithmic techniques and complexity analysis methods in theory of computing. This paper presents a review of our work on developing novel algorithmic techniques and new complexity analysis methodology and applying them to address bio-sequence and bio-structure problems. This research also demonstrate beautiful theoretical properties and important practical applications.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
