1 Ocak 2018 Dergi makalesi Açık Erişim

Voges, Jan; Fotouhi, Ali; Ostermann, Joern; Kulekci, Muhammed Oguzhan

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:zenodo.org:29337</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Previous studies on quality score compression can be classified into two main lines: lossy schemes and lossless schemes. Lossy schemes enable a better management of computational resources. Thus, in practice, and for preliminary analyses, bioinformaticians may prefer to work with a lossy quality score representation. However, the original quality scores might be required for a deeper analysis of the data. Hence, it might be necessary to keep them; in addition to lossy compression this requires lossless compression as well. We developed a space-efficient hierarchical representation of quality scores, QScomp, which allows the users to work with lossy quality scores in routine analysis, without sacrificing the capability of reaching the original quality scores when further investigations are required. Each quality score is represented by a tuple through a novel decomposition. The first and second dimensions of these tuples are separately compressed such that the first-level compression is a lossy scheme. The compressed information of the second dimension allows the users to extract the original quality scores. Experiments on real data reveal that the downstream analysis with the lossy part-spending only 0.49 bits per quality score on average-shows a competitive performance, and that the total space usage with the inclusion of the compressed second dimension is comparable to the performance of competing lossless schemes.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</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="100" ind1=" " ind2=" ">
    <subfield code="a">Voges, Jan</subfield>
    <subfield code="u">Leibniz Univ Hannover, Inst Informat Verarbeitung, Appelstr 9A, D-30167 Hannover, Germany</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:babf2a0939f85d6c0847500ca4311a7f</subfield>
    <subfield code="s">162</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/29337/files/bib-cdbb4ffc-434b-4edf-82eb-5eb72857c4c1.txt</subfield>
  </datafield>
  <controlfield tag="005">20210315124843.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2018-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1089/cmb.2018.0065</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">A Two-Level Scheme for Quality Score Compression</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">25</subfield>
    <subfield code="p">JOURNAL OF COMPUTATIONAL BIOLOGY</subfield>
    <subfield code="c">1141-1151</subfield>
    <subfield code="n">10</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Fotouhi, Ali</subfield>
    <subfield code="u">Istanbul Tech Univ, Elect &amp; Commun Engn Dept, Istanbul, Turkey</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Ostermann, Joern</subfield>
    <subfield code="u">Leibniz Univ Hannover, Inst Informat Verarbeitung, Appelstr 9A, D-30167 Hannover, Germany</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Kulekci, Muhammed Oguzhan</subfield>
    <subfield code="u">Istanbul Tech Univ, Informat Inst, TR-34469 Istanbul, Turkey</subfield>
  </datafield>
  <controlfield tag="001">29337</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>