期刊文献+

布尔逻辑DNA序列比对系统的软件平台设计

Design of Software Platform of DNA Sequences Alignment System Based on Booleanlogic
下载PDF
导出
摘要 针对目前基于动态规划的DNA序列全局比对算法时间复杂度较高,设计了一个DNA序列全局比对系统。该系统用FPGA进行序列的比对,并配备一个软件平台存储数据、发送命令以及发送和接收数据。测试数据表明,该系统的DNA序列比对时间在序列相似度较低情况下,为Needleman的42%;在序列相似度较高的情况下,为Needleman的6%。 Present DNA sequence alignment algorithms based on dynamic programming have a high time complexity.A global alignment system is introduced to address this problem.The system aligns sequences in FPGA and store sequences and aligning results in PC memory.The system also send commands to FPGA.The experiment results show compared to Needleman algorithm,the aligning time decreases by 58 when the sequences have a low similarity,and by 94 when the sequences have a high similarity.
出处 《科学技术与工程》 2011年第7期1468-1473,1479,共7页 Science Technology and Engineering
关键词 FPGA DNA序列 软件平台 动态规划 FPGA DNA sequences software platform dynamic programming
  • 相关文献

参考文献9

  • 1Needlman S B, Wunsch C D. A genera method application to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 1970,48 (3) :443-453.
  • 2Smith T F, Waterman M S. Identification of common molecular sequence. Journall of Molecular Biology, 1981 ; 147 : 195-197.
  • 3Altschul S F, Gish W, Miller W, et al. Basic local alignment search tool. Joumall of Molecular Biology, 1990 ;215 (3) :403-410.
  • 4Kent W J. BLAT-the BLAST-like alignment tool. Gennme Res, 2002 ; 10:656-664.
  • 5张阳,窦勇,夏飞.生物信息学双序列比对算法加速器设计与实现[J].计算机科学与探索,2008,2(5):519-528. 被引量:7
  • 6郭静,王超,陈崚.基于遗传算法的系统发生树构建方法[J].计算机工程与应用,2009,45(16):72-76. 被引量:1
  • 7[美]ShephendG,WingoS.深入解析MFC.赵剑云,卿瑾,译.北京:中国电力出版社,2003:5-17.
  • 8Sokal R R, Michener C D. A statistical method for evaluating systematic relationships. University of Kansas Scientific Bulletin, 1958 ;28 : 1409-1438.
  • 9Kimura M. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. Journal of Molecular Evolution, 1980 ; 16 ( 2 ) : 111-120.

二级参考文献8

  • 1张佩珩,刘新春,江先阳.一种面向生物信息学的可重构加速卡的设计与实现[J].计算机研究与发展,2005,42(6):930-937. 被引量:5
  • 2Bodlaender H L,Fellows M R,Warnow T J.Two strikes against perfect phylogeny [C]//Proc of 19th International Colloguium on Automata Languages and Programming, 1992,8(3) :56-67.
  • 3Sokal R R,Michener C D.A statistical method for evaluating systematic relationships[J].University of Kansas Scientific Bulletin, 1958,28 : 1409-1438
  • 4Saitou N,Nei M.The neighbor-joining method:A new method for reconstructing phylogenetic trees[J].Molecular Biology and Evolution, 1987,4:406-425.
  • 5Holland J H.Adaptation in natural and artificial systems[M].Ann Arbor:The University of Michigan Press,1975.
  • 6Rohlf F J.Classification of Aedes by numerical taxonomic methods ( Diptera: Culicidae ) [J].Ann Entomol Soc Am, 1963,56: 798-804.
  • 7Chen Yang,Sami Khuri.PTC:An interactive tool for phylogenetic tree eonstruction[C]//Proeeedings of the IEEE Computer Society Bioinformations Conference CSB'03,2003.
  • 8汪冬,唐志敏.Smith-Waterman算法在脉动阵列上的实现及分析[J].计算机学报,2004,27(1):12-20. 被引量:6

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部