<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 07:09:39 BST</pubDate>


	<title>CiteULike: fqzhao's Zhao</title>
	<description>CiteULike: fqzhao's Zhao</description>


	<link>http://www.citeulike.org/user/fqzhao/author/Zhao</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/fqzhao/article/2767287"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/fqzhao/article/2767287">
    <title>A new pheromone trail-based genetic algorithm for comparative genome assembly</title>
    <link>http://www.citeulike.org/user/fqzhao/article/2767287</link>
    <description>&lt;i&gt;Nucl. Acids Res. (29 April 2008), gkn168.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Gap closing is considered one of the most challenging and time-consuming tasks in bacterial genome sequencing projects, especially with the emergence of new sequencing technologies, such as pyrosequencing, which may result in large amounts of data without the benefit of large insert libraries for contig scaffolding. We propose a novel algorithm to align contigs with more than one reference genome at a time. This approach can successfully overcome the limitations of low degrees of conserved gene order for the reference and target genomes. A pheromone trail-based genetic algorithm (PGA) was used to search globally for the optimal placement for each contig. Extensive testing on simulated and real data sets shows that PGA significantly outperforms previous methods, especially when assembling genomes that are only moderately related. An extended version of PGA can predict additional candidate connections for each contig and can thus increase the likelihood of identifying the correct arrangement of each contig. The software and test data sets can be accessed at http://sourceforge.net/projects/pga4genomics/. 10.1093/nar/gkn168</description>
    <dc:title>A new pheromone trail-based genetic algorithm for comparative genome assembly</dc:title>

    <dc:creator>Fangqing Zhao</dc:creator>
    <dc:creator>Fanggeng Zhao</dc:creator>
    <dc:creator>Tao Li</dc:creator>
    <dc:creator>Donald Bryant</dc:creator>
    <dc:identifier>doi:10.1093/nar/gkn168</dc:identifier>
    <dc:source>Nucl. Acids Res. (29 April 2008), gkn168.</dc:source>
    <dc:date>2008-05-07T20:27:15-00:00</dc:date>
    <prism:publicationYear>2008</prism:publicationYear>
    <prism:publicationName>Nucl. Acids Res.</prism:publicationName>
    <prism:startingPage>gkn168</prism:startingPage>
    <prism:category>assembly</prism:category>
    <prism:category>bioinformatics</prism:category>
    <prism:category>genome</prism:category>
    <prism:category>genomics</prism:category>
</item>



</rdf:RDF>

