<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605470340</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100327.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150501xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00500-014-1338-1</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00500-014-1338-1</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A hybrid particle swarm optimization based memetic algorithm for DNA sequence compression</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Li Tan, Jifeng Sun, Xueke Tong]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Due to the recent advancements in high- throughput sequencing technologies, biomedical research is faced with ever increasing quantities of data, and the storage or transmission of the huge amount of data is one of the concerns. So, we presented a novel hybrid particle swarm optimization based memetic algorithm (HPMA) for DNA sequence compression. In HPMA, within the framework of the memetic algorithm, dynamic comprehensive learning particle swarm optimization method is used for global search, and two adaptive local search operators including center symmetry mutation differential evolution operator and adaptive chaotic search operator work in a cooperative way. HPMA looks for the global optimal code book based on extended approximate repeat vector, by which the DNA sequence will be compressed. Experiments were conducted on 19 high-dimensional functions and 11 real DNA sequences. The results show that HPMA is more competitive in both the performance and scalability, and also attains better compression ability than other representative DNA-specific algorithms on DNA sequence data.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Extended approximate repeat vector</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Center symmetry mutation differential evolution operator</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Adaptive chaotic search operator</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">DNA sequence compression</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Tan</subfield>
   <subfield code="D">Li</subfield>
   <subfield code="u">School of Electronic and Information Engineering, South China University of Technology, 510641, Guangzhou, People's Republic of China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Sun</subfield>
   <subfield code="D">Jifeng</subfield>
   <subfield code="u">School of Electronic and Information Engineering, South China University of Technology, 510641, Guangzhou, People's Republic of China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Tong</subfield>
   <subfield code="D">Xueke</subfield>
   <subfield code="u">School of Electronic and Information Engineering, South China University of Technology, 510641, Guangzhou, People's Republic of China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/5(2015-05-01), 1255-1268</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:5&lt;1255</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00500-014-1338-1</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00500-014-1338-1</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Tan</subfield>
   <subfield code="D">Li</subfield>
   <subfield code="u">School of Electronic and Information Engineering, South China University of Technology, 510641, Guangzhou, People's Republic of China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Sun</subfield>
   <subfield code="D">Jifeng</subfield>
   <subfield code="u">School of Electronic and Information Engineering, South China University of Technology, 510641, Guangzhou, People's Republic of China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Tong</subfield>
   <subfield code="D">Xueke</subfield>
   <subfield code="u">School of Electronic and Information Engineering, South China University of Technology, 510641, Guangzhou, People's Republic of China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/5(2015-05-01), 1255-1268</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:5&lt;1255</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
 </record>
</collection>
