<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/32905?offset=240</link>
	<atom:link href="https://bioinformaticsonline.com/related/32905?offset=240" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36842/gap-filling-or-contigs-extensions-tools</guid>
	<pubDate>Fri, 01 Jun 2018 08:07:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36842/gap-filling-or-contigs-extensions-tools</link>
	<title><![CDATA[Gap filling or Contigs extensions tools !]]></title>
	<description><![CDATA[
<p>There are many tools to perform gap filling using Illumina short reads, for example "GapFiller: a de novo assembly approach to fill the gap within paired reads" or "Toward almost closed genomes with GapFiller". There are also some tools like GAPresolution that can help to perform local re-assemblies using 454 reads. We used GAPresolution but it is not a very good software, it is useful only in some specific situations.</p>

<p>Take a look at the PRICE software from the DeRisi lab. Its meant to do something very similar. http://derisilab.ucsf.edu/index.php?page=software</p>

<p>You could also look at SSPACE (http://www.baseclear.com/landingpages/basetools-a-wide-range-of-bioinformatics-solutions/sspacev12/), ATLAS tools (http://www.hgsc.bcm.tmc.edu/content/bcm-hgsc-software), and SCARPA (http://compbio.cs.toronto.edu/hapsembler/scarpa.html).</p>

<p>See the PAGIT protocol: http://www.sanger.ac.uk/resources/software/pagit/ </p>

<p>In particular, take a look at the IMAGE tool: http://genomebiology.com/2010/11/4/R41 </p>

<p>Also SOAPdenovo has ha function for scaffolding. Not sure about ABYSS</p>

<p>Here there is a useful explanation of several tools.</p>

<p>https://bioinformaticsonline.com/search?q=scaffolding&amp;entity_type=object&amp;entity_subtype=bookmarks&amp;offset=0&amp;search_type=entities</p>

<p>I could be wrong, but the above answers to your hypothetical scenario appear to miss the point that you aren't interested in assembling the full genome, just the 100 kb part you're interested in. I suggest the following algorithm:</p>

<p>1. Start with the initial assembly C0 of the contigs you have identified as overlapping your region of interest, and the set S of reads those contigs contain. Let C = C0.</p>

<p>2. Repeat:<br />a. Identify paired-end reads (not in C) for which one or both ends align within, or extending, contigs in C.<br />b. Identify unpaired reads that align extending these new paired-end reads.<br />c. Construct a new assembly C' from C and the new reads identified in (a) and (b).<br />d. Trim C' so it does not extend more than 100 kb to either end of C0. Set C = C'.<br />e. Let S' denote the reads that contribute to C'. If S' does not contain any reads not present in S, stop. Otherwise, Set S = S'.</p>

<p>3. If you don't have a complete assembly of the region of interest, generate an STS for each end of each contig, probe a library for clones including these STSes, subclone these clones into a paired-end sequencing vector, and generate paired-end reads for this library; then try steps (1) and (2) again, adding these new sequencing reads to what you had before.</p>

<p>4. If your average sequencing depth for the region of interest exceeds 25 or so without filling all gaps, it is likely that the remaining gaps represent sequences that are not getting cloned in your sequencing vectors. Try different sequencing vectors.</p>
]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/13522/yannick-wurm-lab</guid>
  <pubDate>Thu, 07 Aug 2014 18:02:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[Yannick Wurm Lab]]></title>
  <description><![CDATA[
<p>Evolutionary genomics of social insects. Extensive theoretical work has explained how and why complex societies evolve. However, only little is known about the genes and molecular mechanisms responsible for social phenotypes. We have been identifying genes and mechanisms involved in the evolution of insect societies using modern genomics tools (Illumina, RNAseq, RADseq...). For example we recently:</p>

<p>1. sequenced and analyzed the genome of the invasive red fire ant Solenopsis invicta (PNAS 2011)</p>

<p>2. discovered that a fundamental social trait in this species (how many queens are accepted in the colony) is determined by variants of a social chromosome (Nature 2013).</p>

<p>3. described the gene expression changes that occur in a virgin queen when she is given the opportunity of replacing her mother (Mol Ecol 2010).</p>

<p>Homepage: http://yannick.poulet.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</guid>
	<pubDate>Wed, 26 Jul 2017 07:49:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33976/goldgenomes-online-database</link>
	<title><![CDATA[GOLD:Genomes Online Database]]></title>
	<description><![CDATA[<p><span>GOLD</span><span>:Genomes Online Database, is a World Wide Web resource for comprehensive access to information regarding genome and metagenome sequencing projects, and their associated metadata, around the world.</span></p>
<p>https://gold.jgi.doe.gov/</p><p>Address of the bookmark: <a href="https://gold.jgi.doe.gov/" rel="nofollow">https://gold.jgi.doe.gov/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44599/p10k-the-protist-10000-genomes</guid>
	<pubDate>Sat, 06 Jul 2024 08:29:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44599/p10k-the-protist-10000-genomes</link>
	<title><![CDATA[P10K: The Protist 10,000 Genomes]]></title>
	<description><![CDATA[<p><span>The Protist 10,000 Genomes (P10K) Project aims to decipher the genome sequences and construct a comprehensive database resource containing over 10,000 species of protists, encompassing representatives from every major clade. Samples were collected from diverse habitats, and the genome information was acquired through de novo sequencing, genome re-annotation, and integration of publicly available data. Serving as a centralized data portal for the project, the P10K database primarily focuses on delivering high-quality curation and facilitating efficient retrieval of protist genome data.</span></p><p>Address of the bookmark: <a href="https://ngdc.cncb.ac.cn/p10k/" rel="nofollow">https://ngdc.cncb.ac.cn/p10k/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33887/gview-a-java-application-for-viewing-and-examining-prokaryotic-genomes-in-a-circular-or-linear-context</guid>
	<pubDate>Fri, 14 Jul 2017 07:47:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33887/gview-a-java-application-for-viewing-and-examining-prokaryotic-genomes-in-a-circular-or-linear-context</link>
	<title><![CDATA[GView: A Java application for viewing and examining prokaryotic genomes in a circular or linear context]]></title>
	<description><![CDATA[<p>GView is a Java application for viewing and examining prokaryotic genomes in a circular or linear context. It accepts standard sequence file formats and an optional style specification file to generate customizable, publication quality genome maps in bitmap and scalable vector graphics formats. GView features an interactive pan-and-zoom interface, a command-line interface for incorporation in genome analysis pipelines, and a public Application Programming Interface for incorporation in other Java applications.</p>
<p><strong>Availability:</strong>&nbsp;GView is a freely available application licensed under the GNU Public License. The application, source code, documentation, file specifications, tutorials and image galleries are available at&nbsp;<a href="http://gview.ca/" target="pmc_ext">http://gview.ca</a></p>
<p><strong>Contact:</strong>&nbsp;<a href="mailto:dev@null">ac.cg.cpsa-cahp@raalesmod.nav.yrag</a></p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</guid>
	<pubDate>Wed, 27 Dec 2017 00:04:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</link>
	<title><![CDATA[Recovery of complete genomes from metagenomes]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p><strong>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</strong></p>
<p><a href="http://personprofil.aau.dk/120257">Mads Albertsen</a>,&nbsp;<a href="http://ecogenomic.org/users/phil-hugenholtz">Philip Hugenholtz</a>,&nbsp;<a href="http://ecogenomic.org/users/adam-skarshewski">Adam Skarshewski</a>,&nbsp;<a href="http://www.ecogenomic.org/users/gene-tyson">Gene W. Tyson</a>,&nbsp;<a href="http://personprofil.aau.dk/103057">K&aring;re L. Nielsen</a>&nbsp;and&nbsp;<a href="http://personprofil.aau.dk/105842">Per .H. Nielsen</a></p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p><p>Address of the bookmark: <a href="http://madsalbertsen.github.io/multi-metagenome/" rel="nofollow">http://madsalbertsen.github.io/multi-metagenome/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</guid>
	<pubDate>Mon, 14 May 2018 04:02:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</link>
	<title><![CDATA[Digest: In silico restriction digest of complete genomes]]></title>
	<description><![CDATA[<p><span>This tool allows to retrieve number of cleavages yielded by commercially available endonucleases in up-to-date sequenced prokaryotic genomes. When the number of fragments is bellow 50, Pulse Field gel Electrophoresis (PFGE) is simulated.</span></p>
<p>A tool for restriction digest of&nbsp;<a href="http://insilico.ehu.eus/restriction/long_seq/">long</a>user's sequences is available.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://insilico.ehu.es/digest/" rel="nofollow">http://insilico.ehu.es/digest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37572/gtdb-tk-a-toolkit-for-assigning-objective-taxonomic-classifications-to-bacterial-and-archaeal-genomes</guid>
	<pubDate>Wed, 22 Aug 2018 03:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37572/gtdb-tk-a-toolkit-for-assigning-objective-taxonomic-classifications-to-bacterial-and-archaeal-genomes</link>
	<title><![CDATA[GTDB-Tk: A toolkit for assigning objective taxonomic classifications to bacterial and archaeal genomes.]]></title>
	<description><![CDATA[<p>GTDB-Tk is a software toolkit for assigning objective taxonomic classifications to bacterial and archaeal genomes. It is computationally efficient and designed to work with recent advances that allow hundreds or thousands of metagenome-assembled genomes (MAGs) to be obtained directly from environmental samples. It can also be applied to isolate and single-cell genomes. The GTDB-Tk is open source and released under the GNU General Public License (Version 3).</p>
<p>GTDB-Tk is&nbsp;<span>under active development and validation</span>. Please independently confirm the GTDB-Tk predictions by manually inspecting the tree and bringing any discrepencies to our attention. Notifications about GTDB-Tk releases will be available through the ACE Twitter account (<a href="https://twitter.com/ace_uq">https://twitter.com/ace_uq</a>).</p><p>Address of the bookmark: <a href="https://github.com/Ecogenomics/GTDBTk" rel="nofollow">https://github.com/Ecogenomics/GTDBTk</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39869/mfannot-a-program-for-the-annotation-of-mitochondrial-and-plastid-genomes</guid>
	<pubDate>Mon, 26 Aug 2019 11:47:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39869/mfannot-a-program-for-the-annotation-of-mitochondrial-and-plastid-genomes</link>
	<title><![CDATA[MFannot : a program for the annotation of mitochondrial and plastid genomes]]></title>
	<description><![CDATA[<p><span>MFannot is a program for the annotation of mitochondrial and plastid genomes</span></p>
<p>MFannot is a program for the annotation of mitochondrial and plastid genomes. It is a PERL wrapper around a set of diverse, external independent tools.</p>
<p>It makes intense use of RNA/intron detection tools including&nbsp;<a href="http://hmmer.org/">HMMER</a>,&nbsp;<a href="https://github.com/nathanweeks/exonerate">Exonerate</a>,&nbsp;<a href="https://bioinformatics.ca/links_directory/tool/9822/erpin">Erpin</a>&nbsp;and others.</p>
<p><a href="http://megasun.bch.umontreal.ca/cgi-bin/mfannot/mfannotInterface.pl">http://megasun.bch.umontreal.ca/cgi-bin/mfannot/mfannotInterface.pl</a></p><p>Address of the bookmark: <a href="https://github.com/BFL-lab/Mfannot" rel="nofollow">https://github.com/BFL-lab/Mfannot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41918/phispy-phispy-identifies-prophages-in-bacterial-and-probably-archaeal-genomes</guid>
	<pubDate>Tue, 30 Jun 2020 21:36:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41918/phispy-phispy-identifies-prophages-in-bacterial-and-probably-archaeal-genomes</link>
	<title><![CDATA[PhiSpy: PhiSpy identifies prophages in Bacterial (and probably Archaeal) genomes]]></title>
	<description><![CDATA[<p>PhiSpy identifies prophages in Bacterial (and probably Archaeal) genomes. Given an annotated genome it will use several approaches to identify the most likely prophage regions.</p>
<p>Initial versions of PhiSpy were written by</p>
<p>Sajia Akhter (<a href="mailto:sajia@stanford.edu">sajia@stanford.edu</a>)&nbsp;<a href="http://edwards.sdsu.edu/research/">Edwards Bioinformatics Lab</a></p>
<p>Improvements, bug fixes, and other changes were made by</p>
<p>Katelyn McNair&nbsp;<a href="http://edwards.sdsu.edu/research/">Edwards Bioinformatics Lab</a>&nbsp;and Przemyslaw Decewicz&nbsp;<a href="http://ddlemb.com/">DEMB at the University of Warsaw</a></p><p>Address of the bookmark: <a href="https://github.com/linsalrob/PhiSpy" rel="nofollow">https://github.com/linsalrob/PhiSpy</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>