Please wait a minute...
New Technology of Library and Information Service  2006, Vol. 1 Issue (4): 74-76    DOI: 10.11925/infotech.1003-3513.2006.04.18
Current Issue | Archive | Adv Search |
QUASAR: An Algorithm for Searching Biological Sequence Databases
Yu Jun1   Hu Zhiyi2   Wang Jianguo1
1(School of Computer Science and Engineering, Xi’an Institute of Technology, Xi’an 710032,China)
2(Architectural Engineering Institute of the General Logistics Department, Xi’an 710032, China)
Export: BibTeX | EndNote (RIS)      

This paper introduces an algorithm for searching biological sequence databases——QUASAR. It is based on an index suffix array, as well as uses qgram filtration and local alignment to search approximate matches of a query sequence in the databases. And also uses Window shifting and block addressing in order to speed up the retrieval and reduce the space. Finally, compares QUASAR with BLAST which is a popular searching algorithm currently.

Key wordsBiological sequence databases      QUASAR      Databases searching     
Received: 23 January 2006      Published: 25 April 2006


Corresponding Authors: Yu Jun     E-mail:
About author:: Yu Jun,Hu Zhiyi,Wang Jianguo

Cite this article:

Yu Jun,Hu Zhiyi,Wang Jianguo . QUASAR: An Algorithm for Searching Biological Sequence Databases. New Technology of Library and Information Service, 2006, 1(4): 74-76.

URL:     OR

1Cyntbia Gibas, Per Jambeck. Developing Bioinformatics Computer Skills. O’Reilly, 2002
2G.Myers, R.Durbin. Accelerating SmithWaterman Searches. LNCS Vol.2452:331-342, Springer, 2002
3F.Galisson, The Fasta and BLAST programs, Manuscript , 2000
4S.Burkhardt, A.Crauser,P.Ferragina, etal. Q-gram Based Databases Searching Using a Suffix Array (QUASAR). Proc. RECOMB(99): 77-83, ACM press, 1999
5WingKin Sung. Searching biological database . (2005-08). Dec.8,2005)

[1] Chen Yijun,Cai Dong. Patent Novelty Searching and Application of Free Biological Information Science Database on Internet[J]. 现代图书情报技术, 2003, 19(2): 65-67.
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938