<?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/26322?offset=900</link>
	<atom:link href="https://bioinformaticsonline.com/related/26322?offset=900" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/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/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/file/view/29654/randomness-and-probability</guid>
	<pubDate>Tue, 08 Nov 2016 07:17:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29654/randomness-and-probability</link>
	<title><![CDATA[Randomness and Probability]]></title>
	<description><![CDATA[<p>Randomness and Probability</p><p>Randomness and probability are two differnet concepts: probaility is a measure (according to measure theory) which measures the randomness. Randomness is the object to be measured by probability.&nbsp;For example, probability is a mapping from randomness to the real number between 0 and 1. The similar examples are that the entropy measures the uncertanity; product of length and width measures the area of rectangle etc.</p><p><strong>Please see &ldquo;A mathematical theory of ability measure&rdquo; by N. Kong ets for more examples to answer&nbsp;this question.</strong></p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29654" length="598559" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43057/hapsolo-an-optimization-approach-for-removing-secondary-haplotigs-during-diploid-genome-assembly-and-scaffolding</guid>
	<pubDate>Sat, 08 May 2021 21:25:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43057/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>HapSolo, that identifies secondary contigs and defines a primary assembly based on multiple pairwise contig alignment metrics. HapSolo evaluates candidate primary assemblies using BUSCO scores and then distinguishes among candidate assemblies using a cost function. The cost function can be defined by the user but by default considers the number of missing, duplicated and single BUSCO genes within the assembly. HapSolo performs hill climbing to minimize cost over thousands of candidate assemblies.&nbsp;</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/blog/view/43634/illumina-based-assembly-pipeline-steps</guid>
	<pubDate>Fri, 10 Dec 2021 06:22:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43634/illumina-based-assembly-pipeline-steps</link>
	<title><![CDATA[Illumina based assembly pipeline steps !]]></title>
	<description><![CDATA[<h3 id="illumina">Illumina<a href="https://nf-co.re/viralrecon#illumina"><span></span></a></h3><ol>
<li>Merge re-sequenced FastQ files (<a href="http://www.linfo.org/cat.html"><code>cat</code></a>)</li>
<li>Read QC (<a href="https://www.bioinformatics.babraham.ac.uk/projects/fastqc/"><code>FastQC</code></a>)</li>
<li>Adapter trimming (<a href="https://github.com/OpenGene/fastp"><code>fastp</code></a>)</li>
<li>Removal of host reads (<a href="http://ccb.jhu.edu/software/kraken2/"><code>Kraken 2</code></a>; <em>optional</em>)</li>
<li>Variant calling<ol>
<li>Read alignment (<a href="http://bowtie-bio.sourceforge.net/bowtie2/index.shtml"><code>Bowtie 2</code></a>)</li>
<li>Sort and index alignments (<a href="https://sourceforge.net/projects/samtools/files/samtools/"><code>SAMtools</code></a>)</li>
<li>Primer sequence removal (<a href="https://github.com/andersen-lab/ivar"><code>iVar</code></a>; <em>amplicon data only</em>)</li>
<li>Duplicate read marking (<a href="https://broadinstitute.github.io/picard/"><code>picard</code></a>; <em>optional</em>)</li>
<li>Alignment-level QC (<a href="https://broadinstitute.github.io/picard/"><code>picard</code></a>, <a href="https://sourceforge.net/projects/samtools/files/samtools/"><code>SAMtools</code></a>)</li>
<li>Genome-wide and amplicon coverage QC plots (<a href="https://github.com/brentp/mosdepth/"><code>mosdepth</code></a>)</li>
<li>Choice of multiple variant calling and consensus sequence generation routes (<a href="https://github.com/andersen-lab/ivar"><code>iVar variants and consensus</code></a>; <em>default for amplicon data</em> <em>||</em> <a href="http://samtools.github.io/bcftools/bcftools.html"><code>BCFTools</code></a>, <a href="https://github.com/arq5x/bedtools2/"><code>BEDTools</code></a>; <em>default for metagenomics data</em>)
<ul>
<li>Variant annotation (<a href="http://snpeff.sourceforge.net/SnpEff.html"><code>SnpEff</code></a>, <a href="http://snpeff.sourceforge.net/SnpSift.html"><code>SnpSift</code></a>)</li>
<li>Consensus assessment report (<a href="http://quast.sourceforge.net/quast"><code>QUAST</code></a>)</li>
<li>Lineage analysis (<a href="https://github.com/cov-lineages/pangolin"><code>Pangolin</code></a>)</li>
<li>Clade assignment, mutation calling and sequence quality checks (<a href="https://github.com/nextstrain/nextclade"><code>Nextclade</code></a>)</li>
<li>Individual variant screenshots with annotation tracks (<a href="https://asciigenome.readthedocs.io/en/latest/"><code>ASCIIGenome</code></a>)</li>
</ul>
</li>
<li>Intersect variants across callers (<a href="http://samtools.github.io/bcftools/bcftools.html"><code>BCFTools</code></a>)</li>
</ol></li>
<li><em>De novo</em> assembly<ol>
<li>Primer trimming (<a href="https://cutadapt.readthedocs.io/en/stable/guide.html"><code>Cutadapt</code></a>; <em>amplicon data only</em>)</li>
<li>Choice of multiple assembly tools (<a href="http://cab.spbu.ru/software/spades/"><code>SPAdes</code></a> <em>||</em> <a href="https://github.com/rrwick/Unicycler"><code>Unicycler</code></a> <em>||</em> <a href="https://github.com/GATB/minia"><code>minia</code></a>)
<ul>
<li>Blast to reference genome (<a href="https://blast.ncbi.nlm.nih.gov/Blast.cgi?PAGE_TYPE=BlastSearch"><code>blastn</code></a>)</li>
<li>Contiguate assembly (<a href="https://www.sanger.ac.uk/science/tools/pagit"><code>ABACAS</code></a>)</li>
<li>Assembly report (<a href="https://github.com/BU-ISCIII/plasmidID"><code>PlasmidID</code></a>)</li>
<li>Assembly assessment report (<a href="http://quast.sourceforge.net/quast"><code>QUAST</code></a>)</li>
</ul>
</li>
</ol></li>
<li>Present QC and visualisation for raw read, alignment, assembly and variant calling results (<a href="http://multiqc.info/"><code>MultiQC</code></a>)</li>
</ol>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29883/ra-bioinformatics-at-school-of-computational-integrative-sciences-jnu-india</guid>
  <pubDate>Fri, 18 Nov 2016 03:57:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at School of Computational &amp; Integrative Sciences, JNU, India]]></title>
  <description><![CDATA[
<p>School of Computational &amp; Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi – 110067</p>

<p>Date: Nov 11th. 2016                                                            Last Date:  Nov 25th. 2016</p>

<p>PROJECT ID: 632</p>

<p>The following posts are urgently required to be filled for the Department of Biotechnology, Government of India funded project entitled "Computational Core for Plant Metabolomics" administrated by Prof Indira Ghosh,  School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi-110 067</p>

<p>NB:For all Bioinformatics posts, preference will be given to candidates with a good knowledge of Python and/or R. Knowledge of JAVA will also get a special consideration.</p>

<p>RA / Research Associate (Metabolic engineering/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA<br />Vacancy: 1<br />Essential Qualifications: PhD in  Bioinformatics /Mathematics/Computer Science with experience in analyzing high throughput omics-based data/ system Biology/ Analysis of Network Biology. Published paper in the field is a must to prove the experience.<br />Desired Skills: Prior experience in handling and guiding bioinformatics, metabolomics data, planning of new research area in metabolic driven network , managing the project portal, preparing and filing reports etc. Will be expected to communicate with user groups and coordinate with LIMS group in Hyderabad and the Cheminformatics group in Delhi.</p>

<p>RA / Research Associate (Chemo-informatics/Computational Biologist)</p>

<p>Salary: Rs. 36000/- + HRA<br />Vacancy: 1<br />Essential Qualifications: PhD in Bioinformatics/ computational biology/ Biophysics/Computer Science. Computational and Chemical structure related experience is a necessary qualification proven by paper published and program developed. <br />Desired Skills:  Research experience in Chemical scaffold mapping, in silico Spectral analysis, Biological Database Designing &amp; Integration is required. Individual is responsible to develop methods related to metabolite identification, Testing and refining and integrate LIMS with IIIT Hyderabad and will be expected to communicate with user groups.</p>

<p>Project SRF (Bioinformatics/Programming)</p>

<p>Salary: As per DBT rules<br />Vacancy: 1<br />Essential Qualifications: Masters/B Tech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Computational Biology related to Database /portal building &amp; maintenance ,high throughput data handling and analysis etc. For M.Sc/B.Tec, Published paper  in peer-reviewed Journal and for M.Tech, thesis submission in computational biology is a must.</p>

<p>More at http://www.jnu.ac.in/Career/currentjobs.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</guid>
	<pubDate>Sun, 03 Apr 2022 20:35:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43850/merfin-improved-variant-filtering-assembly-evaluation-and-polishing-via-k-mer-validation</link>
	<title><![CDATA[Merfin: improved variant filtering, assembly evaluation and polishing via k-mer validation]]></title>
	<description><![CDATA[<p><span>Merfin, a&nbsp;</span><em>k</em><span>-mer based variant-filtering algorithm for improved accuracy in genotyping and genome assembly polishing. Merfin evaluates each variant based on the expected&nbsp;</span><em>k</em><span>-mer multiplicity in the reads, independently of the quality of the read alignment and variant caller&rsquo;s internal score. Merfin increased the precision of genotyped calls in several benchmarks, improved consensus accuracy and reduced frameshift errors when applied to human and nonhuman assemblies built from Pacific Biosciences HiFi and continuous long reads or Oxford Nanopore reads, including the first complete human genome. Moreover, we introduce assembly quality and completeness metrics that account for the expected genomic copy numbers.</span></p>
<p><span>More at&nbsp;https://www.nature.com/articles/s41592-022-01445-y</span></p>
<p><img src="https://media.springernature.com/full/springer-static/image/art%3A10.1038%2Fs41592-022-01445-y/MediaObjects/41592_2022_1445_Fig1_HTML.png" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/arangrhie/merfin" rel="nofollow">https://github.com/arangrhie/merfin</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29917/gojs</guid>
	<pubDate>Tue, 22 Nov 2016 08:25:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29917/gojs</link>
	<title><![CDATA[GoJS]]></title>
	<description><![CDATA[<p><strong>GoJS</strong> is a feature-rich JavaScript library for implementing custom interactive diagrams and complex visualizations across modern web browsers and platforms. <strong>GoJS</strong> makes constructing JavaScript diagrams of complex nodes, links, and groups easy with customizable templates and layouts.</p>
<p><strong>GoJS</strong> offers many advanced features for user interactivity such as drag-and-drop, copy-and-paste, in-place text editing, tooltips, context menus, automatic layouts, templates, data binding and models, transactional state and undo management, palettes, overviews, event handlers, commands, and an extensible tool system for custom operations.</p>
<p><strong>GoJS</strong> is pure JavaScript, so users get interactivity without requiring round-trips to servers and without plugins. <strong>GoJS</strong> normally runs completely in the browser, rendering to an HTML5 Canvas element or SVG without any server-side requirements. <strong>GoJS</strong> does not depend on any JavaScript libraries or frameworks, so it should work with any HTML or JavaScript framework or with no framework at all. &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</p>
<p>More at&nbsp;http://gojs.net/latest/index.html</p><p>Address of the bookmark: <a href="http://gojs.net/latest/index.html" rel="nofollow">http://gojs.net/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>