1 Ocak 2013 Konferans bildirisi Açık Erişim

Akgun, Mete; Sagiroglu, Mahmut Samil

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Sagiroglu, Mahmut Samil</subfield>
    <subfield code="u">Tubitak BILGEM, TR-41470 Gebze, Kocaeli, Turkey</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-adresli-yayinlar</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.81043/aperta.92060</subfield>
    <subfield code="n">doi</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.81043/aperta.92061</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">A New PPM Model for Quality Score Compression</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Akgun, Mete</subfield>
    <subfield code="u">Tubitak BILGEM, TR-41470 Gebze, Kocaeli, Turkey</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:92061</subfield>
    <subfield code="p">user-tubitak-adresli-yayinlar</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2013-01-01</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/92061/files/bib-d04be611-ec6d-4c8e-ae53-635eb332e713.txt</subfield>
    <subfield code="z">md5:26e289fd2b91fce6bace2ffa2cb23049</subfield>
    <subfield code="s">157</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <controlfield tag="005">20210316122944.0</controlfield>
  <controlfield tag="001">92061</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="a">2013 21ST SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU)</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Next Generation Sequencing (NGS) platforms generate nucleotide sequences with header data and quality information. These platforms may produce gigabyte-scale datasets. The biggest problem of NGS technology is the storage of these datasets. Nucleotide sequences, supporting information and quality scores are stored in FASTQ format. In this paper, we consider the compression of quality scores and propose an algorithm for lossless compression of quality scores. We try to find a model that gives the lowest entropy on quality score data. We combine our powerful statistical model with arithmetic coding to compress the quality score data the smallest. We compare its performance to text compression utilities such as bzip2, gzip and ppmd and existing compression algorithms for quality scores. We show that the performance of our compression algorithm is superior to that of both systems.</subfield>
  </datafield>
</record>