CoMRI: A compressed multiresolution index structure for sequence similarity queries

Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003

Volumn , Issue , 2003, Pages 553-558

  Sun, H ^a   Ozturk, O ^a   Ferhatosmanoglu H ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DIGITAL STORAGE; LEARNING ALGORITHMS;

DNA SEQUENCE DATABASE; GRID INDEX STRUCTURE; HUMAN CHROMOSOMES; LOCATION INFORMATION; MINIMUM BOUNDING RECTANGLE; MULTIRESOLUTION; SEARCH ALGORITHMS; SEQUENCE SIMILARITY;

CHROMOSOMES;

EID: 84883284555     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2003.1227406     Document Type: Conference Paper

References (7)

1. S. Altschul, W. Gish, W. Miller, and J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
2. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R∗ tree: An efficient and robust access method for points and rectangles. pages 322-331, May 23-25 1990.
3. A. Guttman. R-trees: A dynamic index structure for spatial searching. pages 47-57, 1984.
4. T. Kahveci and A. Singh. An efficient index structure for string databases. pages 351-360, Roma, Italy, September 2001.
5. Hakan Ferhatosmanoglu Ozgur Ozturk. Effective indexing and filtering for similarity search in large biosequence databases. In International Symposium on Bioinformatics and Bioengineering BIBE 2003, Washington, DC, march 2003. IEEE.
6. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The a-tree: An index structure for high-dimensional spaces using relative approximation. In Proceedings of 26th International Conference on Very Large Data Bases, September 10-14, 2000, pages 516-526, Cairo, Egypt, 2000.
7. D. White and R. Jain. Similarity indexing with the SS-tree. pages 516-523, 1996.