期刊文献+

串联重复序列识别方法研究 被引量:1

The Research of Methods for Identifying Tandem Repeat
下载PDF
导出
摘要 非编码区重复序列分析在基因组研究中起着重要作用,其基础就是在非编码DNA序列中识别和定位所有的重复结构。重复序列识别问题在计算机科学中主要体现为字符串匹配问题。在分析了后缀树和后缀数组字符串匹配算法的基础上,详细阐述了基于后缀数组的精确串联重复序列识别方法。实验表明,该方法适合用于非编码DNA序列分析。 The repeat sequences analysis of non-coding area plays an important role in the research of genomes, its foundation is to identify and locate the periodic patterns. It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching. The experiment indicates that the method adapts to non-coding DNA sequence analysis.
作者 陈昌平 刘自伟 周文鹃 彭春艳 CHEN Chang-ping, LIU Zi-wei, ZHOU Wen-juan, PENG Chun-yan (Southwest University of Science and Technology, College of Computer Science and Technology, Mianyang 621000, China)
出处 《电脑知识与技术》 2008年第11期930-931,937,共3页 Computer Knowledge and Technology
关键词 串联重复序列 后缀树 应缀数组 最大串联重复序列 tandem repeat suffix tree suffix array longest tandem repeat
  • 相关文献

参考文献2

二级参考文献12

  • 1[1]E.S.Lander,L.M.Linton,B.Birren,C.Nusbaum,M.C.Zody,J.Baldwin,K.Devon,and K.Dewar,et.al.Initial Sequencing and Analysis of the Human Genome[J].Nature,2001,409:860-921.
  • 2[2]R.R.Sinden,Trinucleotide repeats biological implications of the DNA structures associated with disease-causing triplet repeats[J].Human Genetics,2000,vol.64,346-353.
  • 3[3]Achaz,G.,Rocha,E.P.C.,Netter,P.and Coissac,E..Origin and fate of repeats in bacteria[J].Nucleic Acids Res.,2002,30:2987-2994.
  • 4[4]Kolpakov,R.and Kucherov,G.Finding maximal repetitions in a word in linear time[R].In Proceedings of the 1999 Symposium on Foundations of Computer Science,New York (USA) 1999,596-604.
  • 5[5]Lothaire,M.Algebraic Combinatorics on Words[M].Cambridge University Press.2002.
  • 6[6]U.Manber and E.W.Myers.Suffix Arrays:A New Method for On -Line String Searches[J].SIAM Journal on Computing,1993,22(5):935-948.
  • 7[7]Peter M.McIlroy and M.Douglas McIlroy,ssort.c,Source Code,1997,http://cm.bell-labs.com/cm/cs/who/doug/source.html.
  • 8[8]T.Kasai,G.Lee,H.Arimura,S.Arikawa,and K.Park.Linear-Time Longest-Common-Prffix Computation in Suffix Arrays and its Applications[R].In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching,pp.181-192.Lecture Notes in Computer Science 2089,Springer-Verlag,2001.
  • 9[9]Benson,G.Tandem repeats finder:a program to analyze DNA sequences[J].Nucleic Acid Research,vol.1998,27:573-580.
  • 10[10]Valerio Parisi,Valeria De Fonzo and Filippo Aluffi-Pentini,STRING:finding tandem repeats in DNA sequences[J].Bioinformatics 2003,19(14):1733-1738.

共引文献3

同被引文献8

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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