DSIM: A Distance-Based Indexing Method for Genomic Sequences

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 substring...

Full description

Saved in:
Bibliographic Details
Main Authors: CAO, Xia, OOI, Beng-Chin, PANG, Hwee Hwa, TAN, Kian-Lee, TUNG, Anthony K. H.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2005
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/276
https://ink.library.smu.edu.sg/context/sis_research/article/1275/viewcontent/DSIM_edited_.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1275
record_format dspace
spelling sg-smu-ink.sis_research-12752017-07-11T08:14:19Z DSIM: A Distance-Based Indexing Method for Genomic Sequences CAO, Xia OOI, Beng-Chin PANG, Hwee Hwa TAN, Kian-Lee TUNG, Anthony K. H. 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.62 GB of DNA sequence letters show that the new algorithm achieves significantly faster response time than BLAST, while maintaining comparable accuracy. 2005-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/276 info:doi/10.1109/BIBE.2005.24 https://ink.library.smu.edu.sg/context/sis_research/article/1275/viewcontent/DSIM_edited_.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Computation methods data compression data structures database systems indexing Data sequences Distance based Sequence Indexing Method (DSIM) Genomic sequences Human genome Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Computation methods
data compression
data structures
database systems
indexing
Data sequences
Distance based Sequence Indexing Method (DSIM)
Genomic sequences
Human genome
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Computation methods
data compression
data structures
database systems
indexing
Data sequences
Distance based Sequence Indexing Method (DSIM)
Genomic sequences
Human genome
Databases and Information Systems
Numerical Analysis and Scientific Computing
CAO, Xia
OOI, Beng-Chin
PANG, Hwee Hwa
TAN, Kian-Lee
TUNG, Anthony K. H.
DSIM: A Distance-Based Indexing Method for Genomic Sequences
description 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.62 GB of DNA sequence letters show that the new algorithm achieves significantly faster response time than BLAST, while maintaining comparable accuracy.
format text
author CAO, Xia
OOI, Beng-Chin
PANG, Hwee Hwa
TAN, Kian-Lee
TUNG, Anthony K. H.
author_facet CAO, Xia
OOI, Beng-Chin
PANG, Hwee Hwa
TAN, Kian-Lee
TUNG, Anthony K. H.
author_sort CAO, Xia
title DSIM: A Distance-Based Indexing Method for Genomic Sequences
title_short DSIM: A Distance-Based Indexing Method for Genomic Sequences
title_full DSIM: A Distance-Based Indexing Method for Genomic Sequences
title_fullStr DSIM: A Distance-Based Indexing Method for Genomic Sequences
title_full_unstemmed DSIM: A Distance-Based Indexing Method for Genomic Sequences
title_sort dsim: a distance-based indexing method for genomic sequences
publisher Institutional Knowledge at Singapore Management University
publishDate 2005
url https://ink.library.smu.edu.sg/sis_research/276
https://ink.library.smu.edu.sg/context/sis_research/article/1275/viewcontent/DSIM_edited_.pdf
_version_ 1770570367958515712