Please use this identifier to cite or link to this item:
|Title:||DSIM: A distance-based indexing method for genomic sequences|
|Citation:||Cao, X.,Ooi, B.C.,Pang, H.H.,Tan, K.-L.,Tung, A.K.H. (2005). DSIM: A distance-based indexing method for genomic sequences. Proceedings - BIBE 2005: 5th IEEE Symposium on Bioinformatics and Bioengineering 2005 : 97-104. ScholarBank@NUS Repository. https://doi.org/10.1109/BIBE.2005.24|
|Abstract:||In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the genomic sequence database around a set of automatically selected reference words, formed from high-frequency data substrings and substrings in past queries. The compression captures the distance of each non-reference word in the database to some reference word. At runtime, a query is processed by comparing its substrings with the compressed data strings, through their distances to the reference words. We also propose an efficient scheme to incrementally update the reference words and the compressed data sequences as more data sequences are added and new queries come along. Extensive experiments on a human genome database with 2.62GB of DNA sequence letters show that the new algorithm achieves significantly faster response time than BLAST, while maintaining comparable accuracy. © 2005 IEEE.|
|Source Title:||Proceedings - BIBE 2005: 5th IEEE Symposium on Bioinformatics and Bioengineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2018
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.