Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40854
DC FieldValue
dc.titlePiers: An efficient model for similarity search in DNA sequence databases
dc.contributor.authorCao, X.
dc.contributor.authorLi, S.C.
dc.contributor.authorOoi, B.C.
dc.contributor.authorTung, A.K.H.
dc.date.accessioned2013-07-04T08:13:53Z
dc.date.available2013-07-04T08:13:53Z
dc.date.issued2004
dc.identifier.citationCao, X.,Li, S.C.,Ooi, B.C.,Tung, A.K.H. (2004). Piers: An efficient model for similarity search in DNA sequence databases. SIGMOD Record 33 (2) : 39-44. ScholarBank@NUS Repository.
dc.identifier.issn01635808
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40854
dc.description.abstractGrowing interest in genomic research has resulted in the creation of huge biological sequence databases. In this paper, we present a hash-based pier model for efficient homology search in large DNA sequence databases. In our model, only certain segments in the databases called 'piers' need to be accessed during searches as opposite to other approaches which require a full scan on the biological sequence database. To further improve the search efficiency, the piers are stored in a specially designed hash table which helps to avoid expensive alignment operation. The hash table is small enough to reside in main memory, hence avoiding I/O in the search steps. We show theoretically and empirically that the proposed approach can efficiently detect biological sequences that are similar to a query sequence with very high sensitivity.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleSIGMOD Record
dc.description.volume33
dc.description.issue2
dc.description.page39-44
dc.description.codenSRECD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

74
checked on May 22, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.