期刊文献+

基于后缀树思想构造Web生物数据搜索的数据模型 被引量:1

Creating a data model based on suffix trees for searching biological databases on the web
在线阅读 下载PDF
导出
摘要 针对Web上的公共生物学数据资源,提出一种适合于在线搜索生物学数据的数据模型.该模型基于后缀树思想,通过建立生物体的DNA、RNA、蛋白质序列数据的后缀树结构,并将之转化为更加空间有效的后缀数组,然后搜索数组以找到查询序列的近似匹配.结果表明,这种数据模型比常规的线性搜索模型在时间和空间开销上更加高效. One data model used for searching public biological databases on the web is proposed. It is based on an idea of suffix trees. In order to find out approximate matches of a query sequence within a sequence database of DNA, RNA or protein, a suffix tree of the database is created, as well as converted into a suffix array. As a result, this kind of data model is more time efficiency and more space reduction than nomal linear model.
出处 《西安工程科技学院学报》 2006年第2期206-209,共4页 Journal of Xi an University of Engineering Science and Technology
关键词 生物学数据库 搜索 后缀树 后缀数组 biological database searching suffix tree suffix array
作者简介 喻钧(1970-), 女,重庆市人,西安工业学院讲师,硕士,主要从事Web数据挖掘、信息系统和生物信息学等方面的研究. E-mail: jyu0117@163.com 通讯作者
  • 相关文献

参考文献4

  • 1UDI Manber,GENE Myers,SUFFIX Arrays.A new method for on-line string searches[J].SIAM Journal on Computing,1993,22(5):935-948.
  • 2DAN Gusfield.Algorithms on Strings,Trees and Sequences:Computer Science and Computational Biology[M].Cambridge:Cambridge University Press,1998.
  • 3CYNTBIA Gibas,PER Jambeck.Developing Bioinformatics Computer Skills[M].USA:O'Reilly Media Inc,2002.
  • 4SUNG Wing-kin.Searching biological database[EB/OL].(2005-08)[2005-12-20].http://www.comp.nus.edu.sg/~ksung/cs5238/note/Lect3-database_2005.pdf.

同被引文献10

  • 1申展,江宝林,张谧,唐磊,胡运发.互关联后继树模型及其实现[J].计算机应用与软件,2005,22(3):7-9. 被引量:10
  • 2U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches [J]. SIAM Journal on Computing, 1993, (22):935-948.
  • 3Paolo Ferragina , Giovanni Manzini, Veli Makinen, Conzalo Navarro. An Alphabet-Friendly FM-Index[C]. SPIRE,2004: 150-160.
  • 4Chen M S, Park J S, Yu P S. Efficient Data Mining for Path Travsersal Patems[J]. IEEE Trans. Knowledge Data Engineer, 1998,10 (2) : 209-211.
  • 5Pei J, Han J, Mortazavi B, et al. Mining Access Patterns Efficiently from Web Logs[C]. In: Proceedings 2000 Pacific-Asia Conference on Knowledge Discovery and Data Mining, Kyoto, Japan(PAKDD00), 2000:4.
  • 6R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching [C]. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
  • 7G.Gonnet, R. Baeza-Yates, T. Snider, New indices for text: PAT trees and PAT arrays [C]. in: W. Frakes, R.A. Baeza- Yates (Eds.),Information Retrieval: Algorithms and Data Structures,Prentice-Hall, Englewood Cliffs, NJ, 1992:66- 82.
  • 8G. Jacobson. Succinct static data structures [T]. Technical Report CMU-CS-89-112, Dept. of Computer Science, Carnegie-Mellon University, Jan. 1989.
  • 9K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix arrays[C]. In Proceedings of the 11th International Symposium on Algorithms and Computation . Springer-Verlag LNCS 1969, 2000:410-421.
  • 10刘学文,陶晓鹏,于玉,胡运发.一种全新的全文索引模型——后继数组模型[J].软件学报,2002,13(1):150-158. 被引量:11

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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