{"title":"一种新的DNA测序全局比对算法","authors":"V. Anitha, B. Poorna","doi":"10.18000/IJISAC.50052","DOIUrl":null,"url":null,"abstract":"Alignment is the most basic component of biological sequence manipulation and has diverse applications in sequence assembly, sequence annotation, structural and functional predictions for genes and proteins, phylogeny and evolutionary analysis. Classical methods like Needleman Wunsch ( for global alignment) in 1970 and Smith-Waterman (for local alignment) in 1981 suffer from the drawback that it involves a large number of computational steps and has a statically allocate a large section of memory for computer implementation. This paper suggests an alternate method to obtain global alignment between two sequences using logic gates and compare the performance of our algorithm with that of the classical method.","PeriodicalId":121456,"journal":{"name":"International Journal on Information Sciences and Computing","volume":"286 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A NEW ALGORITHM FOR GLOBAL ALIGNMENT IN DNA SEQUENCING\",\"authors\":\"V. Anitha, B. Poorna\",\"doi\":\"10.18000/IJISAC.50052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Alignment is the most basic component of biological sequence manipulation and has diverse applications in sequence assembly, sequence annotation, structural and functional predictions for genes and proteins, phylogeny and evolutionary analysis. Classical methods like Needleman Wunsch ( for global alignment) in 1970 and Smith-Waterman (for local alignment) in 1981 suffer from the drawback that it involves a large number of computational steps and has a statically allocate a large section of memory for computer implementation. This paper suggests an alternate method to obtain global alignment between two sequences using logic gates and compare the performance of our algorithm with that of the classical method.\",\"PeriodicalId\":121456,\"journal\":{\"name\":\"International Journal on Information Sciences and Computing\",\"volume\":\"286 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal on Information Sciences and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18000/IJISAC.50052\",\"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 Journal on Information Sciences and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18000/IJISAC.50052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A NEW ALGORITHM FOR GLOBAL ALIGNMENT IN DNA SEQUENCING
Alignment is the most basic component of biological sequence manipulation and has diverse applications in sequence assembly, sequence annotation, structural and functional predictions for genes and proteins, phylogeny and evolutionary analysis. Classical methods like Needleman Wunsch ( for global alignment) in 1970 and Smith-Waterman (for local alignment) in 1981 suffer from the drawback that it involves a large number of computational steps and has a statically allocate a large section of memory for computer implementation. This paper suggests an alternate method to obtain global alignment between two sequences using logic gates and compare the performance of our algorithm with that of the classical method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
