期刊文献+

生物信息学案例在《数据结构》教学中的应用

Application of Bio-Informatics Case in the Course of Data Structure
下载PDF
导出
摘要 为了改善《数据结构》课程的教学效果,提高学生的学习兴趣,将生物信息学中的一些案例按照其涉及的数据结构原理,引入到《数据结构》教学之中。其中,典型案例包括串联重复序列中的基因识别问题、双序列比对的动态规划算法和多序列比对中寻找折中序列的问题。教学实践表明,引入生物信息学案例能使学生加深对相关算法的理解。 In order to improve the course of Data Structure teaching efficiency, and to stimulate the students' interesting in learning. Ac-cording to the principle of data structure, introducing some bioinformatics cases into the teaching of data structure course. Typical cases including tandem repeat sequence in the gene identification algorithm of the dynamic programming, pair sequence alignment and seek compromise sequences from the multiple sequence alignment problem. Teaching practice shows that the introduction of bioinformatics case can make the students deepen the understanding of related algorithms.
出处 《安康学院学报》 2013年第3期96-98,共3页 Journal of Ankang University
基金 衡阳师范学院南岳学院教学研究基金资助项目(jykt1203)
关键词 生物信息学 案例 数据结构 教学实践 Bioinformatics case Data Structure teaching practice
  • 相关文献

参考文献3

二级参考文献29

  • 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.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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