A Fast and Efficient Algorithm for Mapping Short Sequences to a Reference Genome

作者：Antoniou Pavlos^*; Iliopoulos Costas S; Mouchard Laurent; Pissis Solon P

来源：ADVANCES IN COMPUTATIONAL BIOLOGY, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 399-403, 2010.

DOI：10.1007/978-1-4419-5913-3_45

• DNA sequences
• Genome sequencing
• Mapping sequences
• Pattern matching
• SBS

Novel high-throughput (Deep) sequencing technology methods have redefined the way genome sequencing is performed. They are able to produce tens of millions of short sequences (reads) in a single experiment and with a much lower cost than previous sequencing methods. In this paper, we present a new algorithm for addressing the problem of efficiently mapping millions of short reads to a reference genome. In particular, we define and solve the Massive Approximate Pattern Matching problem for mapping short sequences to a reference genome.

• 出版日期2010