Please use this identifier to cite or link to this item:
|Title:||Indexing DNA sequences using q-grams|
|Citation:||Cao, X.,Li, S.C.,Tung, A.K.H. (2005). Indexing DNA sequences using q-grams. Lecture Notes in Computer Science 3453 : 4-16. ScholarBank@NUS Repository.|
|Abstract:||We have observed in recent years a growing interest in similarity search on large collections of biological sequences. Contributing to the interest, this paper presents a method for indexing the DNA sequences efficiently based on q-grams to facilitate similarity search in a DNA database and sidestep the need for linear scan of the entire database. Two level index - hash table and c-trees - are proposed based on the q-grams of DNA sequences. The proposed data structures allow the quick detection of sequences within a certain distance to the query sequence. Experimental results show that our method is efficient in detecting similarity regions in a DNA sequence database with high sensitivity. © Springer-Verlag Berlin Heidelberg 2005.|
|Source Title:||Lecture Notes in Computer Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.