Loading [MathJax]/extensions/MathMenu.js
CoMRI: a compressed multiresolution index structure for sequence similarity queries | IEEE Conference Publication | IEEE Xplore

CoMRI: a compressed multiresolution index structure for sequence similarity queries


Abstract:

In this paper, we present CoMRI, compressed multiresolution index, our system for fast sequence similarity search in DNA sequence databases. We employ virtual bounding re...Show More

Abstract:

In this paper, we present CoMRI, compressed multiresolution index, our system for fast sequence similarity search in DNA sequence databases. We employ virtual bounding rectangle (VBR) concept to build a compressed, grid style index structure. An advantage of grid format over trees is subsequence location information is given by the order of corresponding VBR in the VBR list. Taking advantage of VBRs, our index structure fits into a reasonable size of memory easily. Together with a new optimized multiresolution search algorithm, the query speed is improved significantly. Extensive performance evaluations on human chromosome sequence data show that VBRs save 80%-93% index storage size compared to MBRs (minimum bounding rectangles) and new search algorithm prunes almost all unnecessary VBRs which guarantees efficient disk I/O and CPU cost. According to the results of our experiments, the performance of CoMRI is at least 100 times faster than MRS which is another grid index structure introduced very recently.
Date of Conference: 11-14 August 2003
Date Added to IEEE Xplore: 08 September 2003
Print ISBN:0-7695-2000-6
Conference Location: Stanford, CA, USA

Contact IEEE to Subscribe

References

References is not available for this document.