Abstract
High throughput, (or next generation) sequencing technologies have opened new and exciting opportunities in the use of DNA sequences. The new emerging technologies mark the beginning of a new era of high throughput short read sequencing: they have the potential to assemble a bacterial genome during a single experiment and at a moderate cost. In this paper we address the problem of efficiently mapping millions of degenerate and weighted sequences to a reference genome with respect to whether they occur exactly once in the genome or not, and by taking probability scores into consideration In particular we define and solve the Massive Exact and Approximate Unique Pattern Matching problem for degenerate and weighted sequences derived from high throughput sequencing technologies.
Original language | English |
---|---|
Title of host publication | IJCBS 2009 |
Subtitle of host publication | International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing, 2009 |
Editors | Joe Zhang, Guozheng Li, Y Jack |
Place of Publication | Los Alamitos |
Publisher | IEEE Computer Society |
Pages | 174-180 |
Number of pages | 7 |
Volume | N/A |
Edition | N/A |
ISBN (Print) | 9780769537399 |
DOIs | |
Publication status | Published - 2009 |
Event | International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing - Shanghai, China Duration: 3 Aug 2009 → 5 Aug 2009 |
Conference
Conference | International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing |
---|---|
Country/Territory | China |
City | Shanghai |
Period | 3/08/2009 → 5/08/2009 |