<?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/38381?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/38381?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</guid>
	<pubDate>Mon, 11 Jun 2018 04:52:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</link>
	<title><![CDATA[BEAP: Blast Extension and Assembly Program]]></title>
	<description><![CDATA[The Blast Extension and Assembly Program (BEAP) is a computer program that uses a short starting DNA fragment, often a EST or partial gene segment, as "primer", to recursively blast nucleotide databases in an attempt to obtain all sequences that overlaps, directly or indirectly, with the "primer" therefore help to "extend" the length of the original sequence for constructing a "full length" sequence for functional analysis, or at least to obtain neighboring regions of the segment for SNP discovery and linkage disequilibrium analysis. The confidence of assembling the resulting sequences is achieved by using a known genome, such as human genome, as a reference.
 
https://www.animalgenome.org/tools/beap/<p>Address of the bookmark: <a href="https://www.animalgenome.org/tools/beap/" rel="nofollow">https://www.animalgenome.org/tools/beap/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/8317/new-version-of-modeller-913</guid>
	<pubDate>Thu, 13 Feb 2014 09:07:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/8317/new-version-of-modeller-913</link>
	<title><![CDATA[New version of Modeller, 9.13]]></title>
	<description><![CDATA[<p>The new version of Modeller, 9.13, is now available for download! Please see the download page at <a href="http://www.facebook.com/l.php?u=http%3A%2F%2Fsalilab.org%2Fmodeller%2F&amp;h=mAQG5wo_Z&amp;enc=AZOoq2B7BxT95AT3Mw3za3VlbmRFke43YMI5vAjCAbBlIcf3bptn8pmFC1Idxrssy98117S03IgdcNmEWcQBi9bmi8Or_ut1D1yybt1ZonvPoCT3_LOglcYV7o6bEaa442_6LhbjefEaelkq0aq6dl0w&amp;s=1" target="_blank">http://salilab.org/modeller/</a> for more information.</p><p><img src="http://salilab.org/modeller/gifs/modeller.jpg" alt="image" width="848" height="272" style="border: 0px; border: 0px;"><br /> <br /> If you have a license key for Modeller 8 or 9, there is no need to reregister for Modeller 9.13 - the same license key will work. (It won't <span>do any harm to reregister if you want to, though!)<br /> <br /> 9.13 is primarily a bugfix release relative to the last public release(9.12). Major user-visible changes include:<br /> <br /> # Modeller now includes a variety of SOAP (statistically optimized atomic potential) scores for assessing proteins, loops, and interfaces.<br /> <br /> # The Lennard-Jones interaction energy is now artificially truncated at very short distance; this makes simulations with poor starting conditions much less likely to 'blow up'.<br /> <br /> # model.get_insertions(), model.get_deletions() and model.loops() now have an include_termini option; if False, residue ranges that include chain termini are excluded from the output.<br /> <br /> See the Modeller manual for a full change log: <a href="http://salilab.org/modeller/9.13/manual/node39.html" target="_blank">http://salilab.org/modeller/9.13/manual/node39.html</a><br /> <br /> If you encounter bugs in Modeller 9.13, please see <a href="http://salilab.org/modeller/9.13/manual/node10.html" target="_blank">http://salilab.org/modeller/9.13/manual/node10.html</a> for information on how to report them.</span></p><p><span>Reference:</span></p><p><span>http://salilab.org/modeller/</span></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43376/hisat2-index-files-download</guid>
	<pubDate>Wed, 15 Sep 2021 22:17:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43376/hisat2-index-files-download</link>
	<title><![CDATA[HISAT2 Index Files Download !]]></title>
	<description><![CDATA[<p>Resource for downloading all the HISAT2 related files&nbsp;</p>
<p>Please cite:</p>
<blockquote>
<p>Kim, D., Paggi, J.M., Park, C.&nbsp;<em>et al.</em>&nbsp;Graph-based genome alignment and genotyping with HISAT2 and HISAT-genotype.&nbsp;<em>Nat Biotechnol</em>&nbsp;<strong>37</strong>, 907&ndash;915 (2019).&nbsp;<a href="https://doi.org/10.1038/s41587-019-0201-4" target="_blank">https://doi.org/10.1038/s41587-019-0201-4</a></p>
</blockquote><p>Address of the bookmark: <a href="http://daehwankimlab.github.io/hisat2/download/#h-sapiens" rel="nofollow">http://daehwankimlab.github.io/hisat2/download/#h-sapiens</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40994/biological-databases</guid>
	<pubDate>Wed, 12 Feb 2020 01:16:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40994/biological-databases</link>
	<title><![CDATA[Biological databases !]]></title>
	<description><![CDATA[<p>Now a days there are a lots of genomics databases available around the world. This bookmark is created to provide all links in one place ...</p>
<p>ftp://ftp.ncbi.nih.gov/genomes/</p>
<p>https://hgdownload.soe.ucsc.edu/downloads.html</p><p>Address of the bookmark: <a href="ftp://ftp.ncbi.nih.gov/genomes/" rel="nofollow">ftp://ftp.ncbi.nih.gov/genomes/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</guid>
	<pubDate>Wed, 07 Feb 2018 09:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</link>
	<title><![CDATA[HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution]]></title>
	<description><![CDATA[<p>Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"</p>
<ul>
<li>
<p>Preprint:&nbsp;<a href="http://biorxiv.org/content/early/2016/08/01/062117">http://biorxiv.org/content/early/2016/08/01/062117</a></p>
</li>
<li>
<p>Paper:&nbsp;<a href="http://genome.cshlp.org/content/27/5/747.full">http://genome.cshlp.org/content/27/5/747.full</a></p>
</li>
<li>
<p>An ipython notebook to reproduce results in the paper can be found in this&nbsp;<a href="https://github.com/govinda-kamath/HINGE-analyses">repository</a>.</p>
</li>
</ul>
<p>HINGE is an OLC(Overlap-Layout-Consensus) assembler. The idea of the pipeline is shown below.</p>
<p><a href="https://github.com/HingeAssembler/HINGE/blob/master/misc/High_level_overview.png" target="_blank"><img src="https://github.com/HingeAssembler/HINGE/raw/master/misc/High_level_overview.png" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/HingeAssembler/HINGE" rel="nofollow">https://github.com/HingeAssembler/HINGE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>