期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

数据压缩在序列比对中的应用

Data compression’s application in alignment
下载PDF
导出
摘要 同源或非同源长基因组序列的分析比较需要高效率的比对算法。开发出一个新的两两比对工具"超级压缩比对"(简称SCA),该系统是建立在Sequitur编码理论专为长基因组序列的两两比对设计。SCA是一个线性算法,并且能够处理序列重排。实验证明SCA算法能够准确快速的完成长基因组序列的比对。 To compare and analyze large genomic DNA sequences of related organisms and of different species,researchers need efficient methods to align long sequences.A new tool Super Compression Alignment（SCA） is developed,a new system specially for rapid global alignment of genomic sequences.The new system is based on Sequitur coding theory.SCA is a linear algorithm and it can deal with rearrangements.SCA has been proved to align genomic sequences efficiently and accurately.
作者 杜娟 呼广跃
机构地区 天津城市建设学院
出处 《计算机工程与应用》 CSCD 北大核心 2008年第22期241-243,共3页 Computer Engineering and Applications
关键词 序列比对 Sequitur码 锚定 sequence alignment Sequitur code anchor
分类号 TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献6

  • 1Needleman S B,Wunsch C D.A general method applicable to the search for similarities in the amino acid sequence of two proteins[J]. J Mol Biol, 1970,48(3) :443-453.
  • 2Smith T F,Waterman M S.Identification of common molecular subsequences[J].J Mol Biol, 1981,147( 1 ) : 195-197.
  • 3Nevill-Manning C,Witten I H.Compression and explanation using hierarchical grammars[J].Computer J, 1997,40( 3 ) : 103-116.
  • 4Shen S Y,Yang J,Yao A,et al.Super Pairwise Alignment(SPA):an efficient approach to global alignment for homologous sequences[J]. J Comput Biol, 2002,9 ( 3 ) : 477-486.
  • 5Hu Guang-yue,Shen Shi-yi.A fast algorithm aligning multiple microbial genomic sequences[C]//The 27th Annual IEEE Engineering in Medicine and Biology Conference, Shanghai, China, 2005.
  • 6呼广跃,沈世镒.超级多重基因组序列比对算法[J].计算机工程与应用,2005,41(27):13-15. 被引量：2

二级参考文献15

  • 1Aaron C E Darling et al. Mauve:Multiple Alignment of Conserved Genomic Sequence With Rearrangements[J].Genome Res,2004;14(7):1394～1403
  • 2Batzoglu S,Pachter L et al. Human and mouse gene structure:comparative analysis and application to exon prediction[J].Genome Res,2000; 10 (7): 950～958
  • 3Bray N,Pachter L. MAVID :multiple alignment server[J].Nucleic Acids Res, 2003; 31 ( 13 ): 3525～3526
  • 4Bray N,Dubchak I,Pachter L.AVID:A global alignment program[J].Genome Res ,2003; 13( 1 ) :97～102
  • 5Brudno M,Do C B,Cooper G M et al. LAGAN and Multi-LAGAN:Efficient tools for large-scale multiple alignment of genomic DNA[J].Genome Res ,2003; 13 (4) :721～731
  • 6D Gusfield. Algorithms on Strings,Trees,and Sequences[M].New York:Cambridge University Press, 1997
  • 7Delcher A L,Kasif S Fleischmann et al.Alignment of whole genomes[J].Nucleic Acids Res, 1999; 27 ( 11 ): 2369～2376
  • 8E M McCreight.A space-econonical suffix tree construction algorithm[J].Journal of the ACM,1976;23(2):262～272
  • 9Felsenstein J.PHYLIP: Phylogeny inference package ( version 3.2 ) [J].Cladistics, 1989;5(2): 164～166
  • 10Hohl M,Kurtz S,Ohlebusch E.Efficient multiple genome alignment[J].Bioinformatics, 2002; 18 ( 1 ): S312～S320

共引文献1

计算机工程与应用
2008年 第22期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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