Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies

Title: Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies
Creator: Iliopoulos, Costas S.; Miller, Mirka; Pissis, Solon P.
Relation: Prague Stringology Conference 2009 (PSC 2009). Proceedings of the Prague Stringology Conference 2009 (Prague, Czech Republic 31 August - 2 September, 2009) p. 249-262
Relation: http://www.stringology.org/event/2009/p23.html
Publisher: Prague Stringology Club / Czech Technical University in Prague
Resource Type: conference paper
Date: 2009
Description: Novel high throughput sequencing technologies have redefined the way genome sequencing is performed. They are able to produce millions of short sequences in a single experiment and with a much lower cost than previous methods. In this paper, we address the problem of efficiently mapping and classifying millions of degenerate and weighted sequences to a reference genome, based on whether they occur exactly once in the genome or not, and by taking into consideration probability scores. In particular, we design parallel algorithms for Massive Exact and Approximate Unique Pattern Matching for degenerate and weighted sequences derived from high throughput sequencing technologies.
Subject: parallel algorithms; string algorithms; high throughput sequencing technologies
Identifier: http://hdl.handle.net/1959.13/920405
Identifier: uon:9144
Identifier: ISBN:9788001044032
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format