<?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/26332?offset=850</link>
	<atom:link href="https://bioinformaticsonline.com/related/26332?offset=850" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</guid>
	<pubDate>Thu, 24 Jan 2019 10:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</link>
	<title><![CDATA[NxRepair: error correction in de novo assemblies using Nextera Mate Pair Reads]]></title>
	<description><![CDATA[<p>NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file containing both the corrected contigs and the correct, unaffected contigs.</p>
<p>https://nxrepair.readthedocs.io/en/latest/tutorial.html</p>
<div>
<div>
<div id="js-repo-pjax-container">
<div>
<div>
<div id="readme">
<div>
<div>
<pre>nxrepair aligned_matepairs.bam assemblyfasta.fasta error_locations.csv new_fasta.fasta</pre>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://github.com/rebeccaroisin/nxrepair" rel="nofollow">https://github.com/rebeccaroisin/nxrepair</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</guid>
	<pubDate>Tue, 05 Mar 2019 10:00:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</link>
	<title><![CDATA[SDA: Long-read sequence and assembly of segmental duplications]]></title>
	<description><![CDATA[<p><span><span>Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of long reads corresponding to distinct paralogs.<br></span></span></p>
<p><span><span>https://github.com/mvollger/SDA</span></span></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/s41592-018-0236-3" rel="nofollow">https://www.nature.com/articles/s41592-018-0236-3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40099/contiguator</guid>
	<pubDate>Fri, 04 Oct 2019 01:27:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40099/contiguator</link>
	<title><![CDATA[CONTIGuator !]]></title>
	<description><![CDATA[<p><span>CONTIGuator is a Python script for Linux environments whose purpose is to speed-up the bacterial genome assembly process and to obtain a first insight of the genome structure using the well-known artemis comparison tool (ACT).</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/contiguator/" rel="nofollow">https://sourceforge.net/projects/contiguator/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40792/haslr-a-tool-for-rapid-genome-assembly-of-long-sequencing-reads</guid>
	<pubDate>Fri, 31 Jan 2020 05:50:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40792/haslr-a-tool-for-rapid-genome-assembly-of-long-sequencing-reads</link>
	<title><![CDATA[HASLR: a tool for rapid genome assembly of long sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR is a tool for rapid genome assembly of long sequencing reads. HASLR is a hybrid tool which means it requires long reads generated by Third Generation Sequencing technologies (such as PacBio or Oxford Nanopore) together with Next Generation Sequencing reads (such as Illumina) from the same sample.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29576/impute2</guid>
	<pubDate>Thu, 27 Oct 2016 11:21:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29576/impute2</link>
	<title><![CDATA[IMPUTE2]]></title>
	<description><![CDATA[<p><strong>IMPUTE2</strong>&nbsp;is a computer program for phasing observed genotypes and imputing missing genotypes. Most people use just a couple of the program's basic functions, but we have also built up a collection of specialized and powerful options. If you are new to&nbsp;<strong>IMPUTE2</strong>, or indeed to phasing and imputation in general, we suggest that you start by learning the basics.</p>
<p>You should begin by downloading the program from&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#download">here</a>. You will need to choose the link that matches your computing platform and then follow the instructions for opening the download package.</p>
<p>Once you have done this, you will be ready to try some example analyses on the test data that are provided with the download. The section on&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#examples">Examples</a>&nbsp;shows how to use the most common&nbsp;<strong>IMPUTE2</strong>&nbsp;functions. We suggest that you work through these examples and try to understand what the elements of each command are doing. If you don't understand something or would like to know if the program can perform a function that isn't listed, you can read our&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#faq">FAQ</a>&nbsp;or submit a question to our&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#mail_list">mail list</a>.</p>
<p>When you have learned the basic functionality of the program, you can use several features of this website to prepare your own analysis:</p>
<ul>
<li>Learn about&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#best_practices">best practices</a>&nbsp;for imputation.</li>
<li>Download&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#reference">reference data</a>&nbsp;that you can use to impute genotypes in your study.</li>
<li>Look through a complete list of&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html#options">program options</a>.</li>
</ul><p>Address of the bookmark: <a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html" rel="nofollow">https://mathgen.stats.ox.ac.uk/impute/impute_v2.html</a></p>]]></description>
	<dc:creator>Jit</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/opportunity/view/29588/research-associate-and-junior-research-fellow-at-north-eastern-hill-university-tura-meghalaya</guid>
  <pubDate>Fri, 28 Oct 2016 09:54:43 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate and Junior Research Fellow at North-Eastern Hill University - Tura, Meghalaya]]></title>
  <description><![CDATA[
<p>Research Associate and Junior Research Fellow <br />North-Eastern Hill University - Tura, Meghalaya <br />₹18,000 a month<br />Applications are invited for the post of Research Associate and JRF in the DBT sponsored Bioinformatics Infrastructure Facility (BIF), posts are purely temporary and terminable at anytime without prior notice or assigning any reason thereof. </p>

<p>Research Associate : <br />Essential Qualification: Ph.D in Bioinformatics/Biotechnology/Life Science from a reocngised univeristy/institute <br />Pay: Rs.36000-/- + Admissible 10% HRA per month <br />Age: Below 35 years </p>

<p>Junior Research Fellow <br />Essential Qualification: M.Sc in Bioinformatics/Biotechnology/Life Science from a reocngised univeristy/institute <br />Pay: Rs.18000-/- + per month <br />Age: Below 35 years </p>

<p>Last date for receving application by mail or post is 08.11.2016 </p>

<p>Company Info. <br />North-Eastern Hill University </p>

<p>Bioinformatics Infrastructure Facility (BIF) Department of RDAP North-Eastern Hill University, Tura Campus Tura-794002, Meghalaya</p>

<p>More at http://www.nehu.ac.in/Advertisements/BIFTuraManpowerAdvt_25102016.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/42559/sample-bandage-input-file-for-visual-analysis</guid>
	<pubDate>Wed, 06 Jan 2021 03:51:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/42559/sample-bandage-input-file-for-visual-analysis</link>
	<title><![CDATA[Sample bandage input file for visual analysis]]></title>
	<description><![CDATA[<p>Sample bandage input file for visual analysis ...</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/42559" length="112199" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Mon, 26 Oct 2020 21:23:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42267/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</link>
	<title><![CDATA[HapSolo: An optimization approach for removing secondary haplotigs during diploid genome assembly and scaffolding.]]></title>
	<description><![CDATA[<p><span>Despite marked recent improvements in long-read sequencing technology, the assembly of diploid genomes remains a difficult task. A major obstacle is distinguishing between alternative contigs that represent highly heterozygous regions. If primary and secondary contigs are not properly identified, the primary assembly will overrepresent both the size and complexity of the genome, which complicates downstream analysis such as scaffolding.</span></p>
<p><span>More at&nbsp;https://github.com/esolares/HapSolo</span></p><p>Address of the bookmark: <a href="https://github.com/esolares/HapSolo" rel="nofollow">https://github.com/esolares/HapSolo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29656/statistics-and-probability</guid>
	<pubDate>Tue, 08 Nov 2016 07:34:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29656/statistics-and-probability</link>
	<title><![CDATA[Statistics and probability]]></title>
	<description><![CDATA[<h3><span>Topics</span></h3>
<div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/displaying-describing-data">Displaying and describing data</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/modeling-distributions-of-data">Modeling distributions of data</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/describing-relationships-quantitative-data">Describing relationships in quantitative data</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/designing-studies">Designing studies</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/probability-library">Probability</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/random-variables-stats-library">Random variables</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/sampling-distributions-library">Sampling distributions</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/confidence-intervals-one-sample">Confidence intervals (one sample)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/significance-tests-one-sample">Significance tests (one sample)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/significance-tests-confidence-intervals-two-samples">Significance tests and confidence intervals (two samples)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/inference-categorical-data-chi-square-tests">Inference for categorical data (chi-square tests)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/advanced-regression-inference-transforming">Advanced regression (inference and tran</a></div>
</div><p>Address of the bookmark: <a href="https://www.khanacademy.org/math/statistics-probability" rel="nofollow">https://www.khanacademy.org/math/statistics-probability</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>