<?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/40613?offset=190</link>
	<atom:link href="https://bioinformaticsonline.com/related/40613?offset=190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</guid>
	<pubDate>Fri, 15 Jun 2018 04:01:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</link>
	<title><![CDATA[SALSA: A tool to scaffold long read assemblies with Hi-C]]></title>
	<description><![CDATA[This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch.

To use the latest version, first run the following commands:

  cd SALSA
  make
To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2).

If you consider using this tool, please cite our publication which describes the methods used for scaffolding.

Ghurye, J., Pop, M., Koren, S., Bickhart, D., &amp; Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link

Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link

For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).<p>Address of the bookmark: <a href="https://github.com/machinegun/SALSA" rel="nofollow">https://github.com/machinegun/SALSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/37927/you-cant-hide-from-genome-hackers</guid>
	<pubDate>Sat, 13 Oct 2018 14:17:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/37927/you-cant-hide-from-genome-hackers</link>
	<title><![CDATA[You can't hide from Genome Hackers]]></title>
	<description><![CDATA[<p><span>Young computational biologist named Yaniv Erlich shocked the research world by showing it was possible to&nbsp;</span><a href="https://www.wired.com/2013/01/your-genome-could-reveal-your-identity/">unmask the identities</a><span>&nbsp;of people listed in anonymous genetic databases using&nbsp;</span><a href="http://science.sciencemag.org/content/339/6117/321" target="_blank">only an Internet connection</a></p><p>Paper: http://science.sciencemag.org/content/early/2018/10/10/science.aau4832</p><p>More at&nbsp;https://www.wired.com/story/genome-hackers-show-no-ones-dna-is-anonymous-anymore/</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38215/pwhatshap-a-parallel-high-performance-version-of-whatshap</guid>
	<pubDate>Wed, 14 Nov 2018 08:20:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38215/pwhatshap-a-parallel-high-performance-version-of-whatshap</link>
	<title><![CDATA[pWhatsHap: a parallel, high-performance version of WhatsHap]]></title>
	<description><![CDATA[<div id="ASec4">
<p>Given the potential relevance of efficient haplotyping in several analysis pipelines, we have designed and engineered&nbsp;pWhatsHap, a parallel, high-performance version of&nbsp;WhatsHap.&nbsp;pWhatsHap&nbsp;is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building on&nbsp;WhatsHap,&nbsp;pWhatsHap&nbsp;exhibits the same complexity exploring a number of possible solutions which is exponential in the coverage of the dataset. The parallel implementation on multi-core architectures allows for a relevant reduction of the execution time for haplotyping, while the provided results enjoy the same high accuracy as that provided by&nbsp;WhatsHap, which increases with coverage.</p>
</div>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1170-y</p><p>Address of the bookmark: <a href="https://bitbucket.org/whatshap/whatshap" rel="nofollow">https://bitbucket.org/whatshap/whatshap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38515/genome-annotation-using-maker-tutorial</guid>
	<pubDate>Thu, 20 Dec 2018 17:39:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38515/genome-annotation-using-maker-tutorial</link>
	<title><![CDATA[Genome Annotation using MAKER tutorial !]]></title>
	<description><![CDATA[<p><a href="http://www.yandell-lab.org/software/maker.html">MAKER</a><span>&nbsp;is a great tool for annotating a reference genome using empirical and&nbsp;</span><em>ab initio</em><span>gene predictions.&nbsp;</span><a href="http://gmod.org/wiki/Main_Page">GMOD</a><span>, the umbrella organization that includes MAKER, has some nice tutorials online for running MAKER. However, these were quite simplified examples and it took a bit of effort to wrap my head completely around everything. Here I will describe a&nbsp;</span><em>de novo</em><span>&nbsp;genome annotation for&nbsp;</span><em>Boa constrictor</em><span>&nbsp;in detail, so that there is a record and that it is easy to use this as a guide to annotate any genome.</span></p><p>Address of the bookmark: <a href="https://www.biostars.org/p/261203/" rel="nofollow">https://www.biostars.org/p/261203/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38801/genome-assembly-forensics-finding-the-elusive-mis-assembly</guid>
	<pubDate>Sat, 26 Jan 2019 18:02:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38801/genome-assembly-forensics-finding-the-elusive-mis-assembly</link>
	<title><![CDATA[Genome assembly forensics: finding the elusive mis-assembly]]></title>
	<description><![CDATA[<p><span>We present the first collection of tools aimed at automated genome assembly validation. This work formalizes several mechanisms for detecting mis-assemblies, and describes their implementation in our automated validation pipeline, called&nbsp;</span><em>amosvalidate</em><span>. We demonstrate the application of our pipeline in both bacterial and eukaryotic genome assemblies, and highlight several assembly errors in both draft and finished genomes. The software described is compatible with common assembly formats and is released, open-source, at&nbsp;</span><a href="http://amos.sourceforge.net/" target="_blank">http://amos.sourceforge.net</a><span>.</span></p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2397507/&nbsp;</p>
<p>http://amos.sourceforge.net/wiki/index.php/AMOS</p><p>Address of the bookmark: <a href="http://amos.sourceforge.net/wiki/index.php/AMOS" rel="nofollow">http://amos.sourceforge.net/wiki/index.php/AMOS</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39626/geval-genome-evaluation-browser</guid>
	<pubDate>Tue, 18 Jun 2019 05:39:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39626/geval-genome-evaluation-browser</link>
	<title><![CDATA[gEVAL: Genome Evaluation Browser]]></title>
	<description><![CDATA[<p>The&nbsp;<strong>gEVAL Browser</strong>&nbsp;allows the evaluation of genome assemblies through its tools and pre-computed analyses.</p>
<p>The strength of this browser is the ability to navigate an up to date assembly and identify problematic regions and assist in strategizing potential solutions for these issues.</p>
<p>This facilitates the improvement of overall assemblies to a &ldquo;gold&rdquo; standard for release as reference genomes</p><p>Address of the bookmark: <a href="https://geval.sanger.ac.uk/index.html" rel="nofollow">https://geval.sanger.ac.uk/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/40609/genome-informatics-section-lab</guid>
  <pubDate>Sat, 25 Jan 2020 06:38:23 -0600</pubDate>
  <link></link>
  <title><![CDATA[Genome Informatics Section Lab !]]></title>
  <description><![CDATA[
<p>Our section develops and applies computational methods for the analysis of massive genomics datasets, focusing on the challenges of genome sequencing and comparative genomics. We aim to improve such foundational processes and translate emerging genomic technologies into practice.</p>

<p>The Genome Informatics Section is hiring! Come join our outstanding team at the NIH’s National Human Genome Research Institute and contribute to the development of new reference genomes and computational methods for DNA sequencing and analysis. Both postdoc and PhD students positions are available. More information and application instructions follow below.</p>

<p>More at https://genomeinformatics.github.io/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/42326/edanchin-lab</guid>
  <pubDate>Thu, 19 Nov 2020 08:00:07 -0600</pubDate>
  <link></link>
  <title><![CDATA[Edanchin Lab]]></title>
  <description><![CDATA[
<p>My main topics of interest are:</p>

<p>The impact of non tree-like evolution such as horizontal gene transfers and hybridization on species biology<br />Evolution and adaptation of animals in the absence of sexual reproduction and the underlying mechanisms<br />Genomic signatures of adaptation to a parasitic life-style</p>

<p>More at https://edanchin.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44366/mitofinder</guid>
	<pubDate>Tue, 29 Aug 2023 02:13:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44366/mitofinder</link>
	<title><![CDATA[MitoFinder]]></title>
	<description><![CDATA[<p dir="auto">Allio, R., Schomaker-Bastos, A., Romiguier, J., Prosdocimi, F., Nabholz, B., &amp; Delsuc, F. (2020) Mol Ecol Resour. 20, 892-905. (<a href="https://doi.org/10.1111/1755-0998.13160">publication link</a>)</p>
<p dir="auto" style="text-align: center;"><a href="https://github.com/RemiAllio/MitoFinder/blob/master/image/logo.png" target="_blank"><img src="https://github.com/RemiAllio/MitoFinder/raw/master/image/logo.png" alt="Drawing" width="250" style="border: 0px;"></a></p>
<p dir="auto"><span>Mitofinder</span>&nbsp;is a pipeline to&nbsp;<span>assemble</span>&nbsp;mitochondrial genomes and&nbsp;<span>annotate</span>&nbsp;mitochondrial genes from trimmed read sequencing data.</p>
<p dir="auto"><span>MitoFinder</span>&nbsp;is also designed to&nbsp;<span>find</span>&nbsp;and&nbsp;<span>annotate</span>&nbsp;mitochondrial sequences in existing genomic assemblies (generated from Hifi/PacBio/Nanopore/Illumina sequencing data...)</p>
<p dir="auto"><span>MitoFinder</span>&nbsp;is distributed under the&nbsp;<a href="https://github.com/RemiAllio/MitoFinder/blob/master/License/LICENSE">license</a>.</p><p>Address of the bookmark: <a href="https://github.com/RemiAllio/MitoFinder" rel="nofollow">https://github.com/RemiAllio/MitoFinder</a></p>]]></description>
	<dc:creator>Neel</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>

</channel>
</rss>