<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T05:59:31Z</responseDate>
  <request identifier="2129" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2129</identifier>
        <datestamp>2024-03-06T11:08:35Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Parallelization of Mapping Algorithms for Next Generation Sequencing Applications</dc:title>
          <dc:creator>Bozdag, Doruk</dc:creator>
          <dc:creator>Barbacioru, Catalin C.</dc:creator>
          <dc:creator>Catalyurek, Umit V.</dc:creator>
          <dc:subject>Genome sequencing</dc:subject>
          <dc:subject>sequence mapping</dc:subject>
          <dc:description>With the advent of next-generation high throughput sequencing&#13;
instruments, large volumes of short sequence data are generated at an&#13;
unprecedented rate. Processing and analyzing these massive data&#13;
requires overcoming several challenges.  A particular challenge&#13;
addressed in this abstract is the mapping of short sequences (reads)&#13;
to a reference genome by allowing mismatches. This is a significantly&#13;
time consuming combinatorial problem in many applications including&#13;
whole-genome resequencing, targeted sequencing, transcriptome/small&#13;
RNA, DNA methylation and ChiP sequencing, and takes time on the order&#13;
of days using existing sequential techniques on large scale&#13;
datasets. In this work, we introduce six parallelization methods each&#13;
having different scalability characteristics to speedup short sequence&#13;
mapping.  We also address an associated load balancing problem that&#13;
involves grouping nodes of a tree from different levels. This problem&#13;
arises due to a trade-off between computational cost and granularity&#13;
while partitioning the workload.  We comparatively present the&#13;
proposed parallelization methods and give theoretical cost models for&#13;
each of them. Experimental results on real datasets demonstrate the&#13;
effectiveness of the methods and indicate that they are successful at&#13;
reducing the execution time from the order of days to under just a few&#13;
hours for large datasets.&#13;
To the best of our knowledge this is the first study on&#13;
parallelization of short sequence mapping problem.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Doruk Bozdag and Catalin C. Barbacioru and Umit V. Catalyurek</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09061.14</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21294</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.14</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
