<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445842539</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145349.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11047-010-9232-y</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11047-010-9232-y</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">DNA chips for species identification and biological phylogenies</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Max Garzon, Tit-Yee Wong]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The codeword design problem is an important problem in DNA computing and its applications. Several theoretical analyses as well as practical solutions for short oligonucleotides (up to 20-mers) have been generated recently. These solutions have, in turn, suggested new applications to DNA-based indexing and natural language processing, in addition to the obvious applications to the problems of reliability and scalability that generated them. Here we continue the exploration of this type of DNA-based indexing for biological applications and show that DNA noncrosshybridizing (nxh) sets can be successfully applied to infer ab initio phylogenetic trees by providing a way to measure distances among different genomes indexed by sets of short oligonucleotides selected so as to minimize crosshybridization. These phylogenies are solidly established and well accepted in biology. The new technique is much more effective in terms of signal-to-noise ratio, cost and time than current methods. Second, it is demonstrated that DNA indexing does provide novel and principled insights into the phylogenesis of organisms hitherto inaccessible by current methods, such as a prediction of the origin of the Salmonella plasmid 50 as being acquired horizontally, likely from some bacteria somewhat related to Yesinia. Finally, DNA indexing can be scaled up to newly available universal DNA chips readily available both in vitro and in silico. In particular, we show how a recently obtained such set of nxh 16-mers can be used as a universal coordinate system in DNA spaces to characterize very large groups (families, genera, and even phylla) of organisms on a uniform biomarker reference system, a veritable and comprehensive &quot;Atlas of Life”, as it is or as it could be on earth.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media B.V., 2010</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">DNA codeword design</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Noncrosshybridizing oligonucleotide bases</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Phylogenetic analysis</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Genomic signatures</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">DNA chips</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">16S rRNA tree of life</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Garzon</subfield>
   <subfield code="D">Max</subfield>
   <subfield code="u">Department of Computer Science, The University of Memphis, 38152, Memphis, TN, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wong</subfield>
   <subfield code="D">Tit-Yee</subfield>
   <subfield code="u">Department of Biology, The University of Memphis, 38152, Memphis, TN, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Natural Computing</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">10/1(2011-03-01), 375-389</subfield>
   <subfield code="x">1567-7818</subfield>
   <subfield code="q">10:1&lt;375</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">10</subfield>
   <subfield code="o">11047</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11047-010-9232-y</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</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="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/s11047-010-9232-y</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">Garzon</subfield>
   <subfield code="D">Max</subfield>
   <subfield code="u">Department of Computer Science, The University of Memphis, 38152, Memphis, TN, USA</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">Wong</subfield>
   <subfield code="D">Tit-Yee</subfield>
   <subfield code="u">Department of Biology, The University of Memphis, 38152, Memphis, TN, USA</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">Natural Computing</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">10/1(2011-03-01), 375-389</subfield>
   <subfield code="x">1567-7818</subfield>
   <subfield code="q">10:1&lt;375</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">10</subfield>
   <subfield code="o">11047</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="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
