A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations
[chapter]
2012
IFIP Advances in Information and Communication Technology
In the post-genomic era there has been an explosion in the amount of genomic data available and the primary research problems have moved from being able to produce interesting biological data to being able to efficiently process and store this information. In this paper we present efficient data structures and algorithms for the High Similarity Sequencing Problem. In the High Similarity Sequencing Problem we are given the sequences S0, S1, . . . , S k where Sj = ej 1 Iσ 1 ej 2 Iσ 2 ej 3 Iσ 3 ,
doi:10.1007/978-3-642-33412-2_60
fatcat:h2o2brxqynhvflhpqiucrwn74y