<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://bc.itl.waw.pl/style/common/xsl/oai-style.xsl"?>
<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-04-22T14:26:13Z</responseDate>
	<request identifier="oai:bc.itl.waw.pl:1199" metadataPrefix="oai_dc" verb="GetRecord">
	https://bc.itl.waw.pl/oai-pmh-repository.xml</request>
	<GetRecord>
	
  <record>
	<header>
		<identifier>oai:bc.itl.waw.pl:1199</identifier>
	    <datestamp>2026-02-25T10:56:08Z</datestamp>
		  <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:072:0721</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07</setSpec> 	      <setSpec>dLibraDigitalLibrary</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:071:PPIL</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:072</setSpec> 	      <setSpec>dLibraDigitalLibrary:dLibraDigitalLibrary07:071</setSpec> 	    </header>
		<metadata>
	<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" 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 xml:lang="pl"><![CDATA[Evolutionary Algorithm that Designs the DNA Synthesis Procedure, Journal of Telecommunications and Information Technology, 2011, nr 4]]></dc:title>
<dc:creator><![CDATA[Nowak, Robert]]></dc:creator>
<dc:creator><![CDATA[Michalak, Maciej]]></dc:creator>
<dc:subject xml:lang="pl"><![CDATA[bioinformatics]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[gene synthesis]]></dc:subject>
<dc:subject xml:lang="pl"><![CDATA[optimum searching]]></dc:subject>
<dc:description xml:lang="pl"><![CDATA[Chemical synthesis of nucleotide chains is very erroneous for long sequences. Often a gene is constructed from short fragments joined with the use of complementary helper chains. The number of possible potential solutions for a long gene synthesis is very large, therefore a fast automated search is required. In the presented approach a modified method of long DNA construction is proposed. A computer program that searches for an optimal solution in the space of potential synthesis methods has been developed. This software uses an evolutionary algorithm for global optimization and a hill- climbing algorithm for local optimization. The long DNA construction method was tested on random sequences. The results are very promising. The next step is to perform experiments in a biotechnological wet laboratory involving DNA strand synthesis using the method designed by the presented software.]]></dc:description>
<dc:publisher><![CDATA[Instytut Łączności - Państwowy Instytut Badawczy, Warszawa]]></dc:publisher>
<dc:date><![CDATA[2011, nr 4]]></dc:date>
<dc:type xml:lang="pl"><![CDATA[artykuł]]></dc:type>
<dc:format xml:lang="pl"><![CDATA[application/pdf]]></dc:format>
<dc:identifier><![CDATA[ISSN 1509-4553, on-line: ISSN 1899-8852]]></dc:identifier>
<dc:identifier><![CDATA[http://bc.itl.waw.pl/Content/1199/ISSN_1509-4553_4_2011_50.pdf]]></dc:identifier>
<dc:identifier><![CDATA[https://bc.itl.waw.pl/dlibra/publication/edition/1199/content]]></dc:identifier>
<dc:identifier><![CDATA[oai:bc.itl.waw.pl:1199]]></dc:identifier>
<dc:source xml:lang="pl"><![CDATA[Journal of Telecommunications and Information Technology]]></dc:source>
<dc:language><![CDATA[ang]]></dc:language>
<dc:relation><![CDATA[oai:bc.itl.waw.pl:publication:1504]]></dc:relation>
<dc:rights xml:lang="pl"><![CDATA[Biblioteka Naukowa Instytutu Łączności]]></dc:rights>
</oai_dc:dc>

</metadata>
	  </record>	</GetRecord>
</OAI-PMH>
