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

Pavlos Antoniou*, Costas S. Iliopoulos, Laurent Mouchard, Solon Pissis

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Computational Biology
EditorsHR Arabnia
Place of PublicationBERLIN
PublisherSpringer-Verlag Berlin Heidelberg
Pages399-403
Number of pages5
ISBN (Print)978-1-4419-5912-6
DOIs
Publication statusPublished - 2010

Publication series

NameAdvances in Experimental Medicine and Biology
PublisherSPRINGER-VERLAG BERLIN
Volume680
ISSN (Print)0065-2598

Keywords

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

Fingerprint

Dive into the research topics of 'A Fast and Efficient Algorithm for Mapping Short Sequences to a Reference Genome'. Together they form a unique fingerprint.

Cite this