<?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/26975?offset=460</link>
	<atom:link href="https://bioinformaticsonline.com/related/26975?offset=460" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Mon, 17 Aug 2020 05:25:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p>SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol>
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19690/bioinformatics-scientist-at-icar-labs</guid>
  <pubDate>Sun, 21 Dec 2014 23:47:03 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Scientist at ICAR Labs]]></title>
  <description><![CDATA[
<p>AGRICUL AGRICULTURAL SCIENTISTS RECRUITMENT BOARD TURAL SCIENTISTS RECRUITMENT BOARD<br />KRISHI ANUSANDHAN BHAVAN-I, PUSA, NEW DELHI-110 012</p>

<p>ADVERTISEMENT NO. 03/2014</p>

<p>PRINCIPAL SCIENTIST</p>

<p>Pay Band: Minimum pay of `43,000 in the PB-4 of `37400-67000/- + RGP of `10,000/-.</p>

<p>Age: The candidates must not have attained the age of 52 years as on 19.01.2015. There shall be no age limit for the Council’s employees.</p>

<p>ICAR-Indian Institute for Agricultural Biotechnology, (IIAB) Ranchi (Jharkhand)</p>

<p>151. Principal Scientist (Bioinformatics) (One post)</p>

<p>SENIOR SCIENTIST/PROGRAMME COORDINATOR</p>

<p>Pay Band: PB-4 of ` 37400-67000/- + RGP of ` 9,000/-.</p>

<p>Age: The candidates must not have attained the age of 47 years as on 19.01.2015. There shall be no age limit for the Council’s employees.</p>

<p>National Institute of Biotic Stress Management, Raipur (Chhattishgarh)</p>

<p>166. Senior Scientist (Bioinformatics) (One post)</p>

<p>IMPORTANT NOTE<br />I. (i) CLOSING DATE</p>

<p>THE CLOSING DATE FOR RECEIPT OF APPLICATIONS IN AGRICULTURAL SCIENTISTS RECRUITMENT BOARD IS 19.01.2015 (For applications posted from abroad and in the Andaman and Nicobar Islands, Lakshdweep, Minicoy and Amindivi islands, States/ Union Territories in the North-Eastern Region, Ladakh Division of J &amp; K State, Sikkim, Pangi, Sub-division of Chamba, Lahul and Spiti Districts of Himachal Pradesh, the last date for receipt of application will be 02.02.2015). Non receipt of the application by the closing date will result in rejection of the application.</p>

<p>More Info: http://asrb.org.in/administrator/uploads_dir/1418978057english.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</guid>
	<pubDate>Sun, 14 Mar 2021 09:42:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</link>
	<title><![CDATA[AlignGraph2: similar genome-assisted reassembly pipeline for PacBio long reads]]></title>
	<description><![CDATA[<p><span>AlignGraph2 is the second version of&nbsp;</span><a href="https://github.com/baoe/AlignGraph">AlignGraph</a><span>&nbsp;for PacBio long reads. It extends and refines contigs assembled from the long reads with a published genome similar to the sequencing genome.</span></p>
<p><span>More at&nbsp;https://academic.oup.com/bib/advance-article-abstract/doi/10.1093/bib/bbab022/6146772</span></p><p>Address of the bookmark: <a href="https://github.com/huangs001/AlignGraph2" rel="nofollow">https://github.com/huangs001/AlignGraph2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19786/shrec3d</guid>
	<pubDate>Thu, 25 Dec 2014 23:14:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19786/shrec3d</link>
	<title><![CDATA[ShRec3D]]></title>
	<description><![CDATA[<p><strong>ShRec3D</strong> is a program that aims at reconstructing a genome 3D structure (b) from the sole knowledge of the contacts between different genomic regions (a) as determined by Hi-C (http://www.ncbi.nlm.nih.gov/pubmed/19815776).</p>
<p>There are two options to run ShRec3D (on linuX only so far): the first one uses the Matlab complier runtime environment (MCR), the second one doesn't need any other library to be installed but only works with the latest versions of Linux (equivalent to Fedora 19 and above).</p><p>Address of the bookmark: <a href="https://sites.google.com/site/julienmozziconacci/#TOC-Downloads" rel="nofollow">https://sites.google.com/site/julienmozziconacci/#TOC-Downloads</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/43728/short-read-assembly-using-spades</guid>
	<pubDate>Mon, 31 Jan 2022 07:18:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/43728/short-read-assembly-using-spades</link>
	<title><![CDATA[Short-read assembly using Spades !]]></title>
	<description><![CDATA[<h2 id="short-read-assembly-a-comparison">If we only had Illumina reads, we could also assemble these using the tool Spades.</h2><p>You can try this here, or try it later on your own data.</p><h2 id="get-data">Get data</h2><p>We will use the same Illumina data as we used above:</p><ul>
<li>illumina_R1.fastq.gz: the Illumina forward reads</li>
<li>illumina_R2.fastq.gz: the Illumina reverse reads</li>
</ul><h2 id="assemble">Assemble</h2><p>Run Spades:</p><div><pre>spades.py -1 illumina_R1.fastq.gz -2 illumina_R2.fastq.gz --careful --cov-cutoff auto -o spades_assembly_all_illumina
</pre></div><ul>
<li><code>-1</code>&nbsp;is input file of forward reads</li>
<li><code>-2</code>&nbsp;is input file of reverse reads</li>
<li><code>--careful</code>&nbsp;minimizes mismatches and short indels</li>
<li><code>--cov-cutoff auto</code>&nbsp;computes the coverage threshold (rather than the default setting, &ldquo;off&rdquo;)</li>
<li><code>-o</code>&nbsp;is the output directory</li>
</ul><h2 id="results">Results</h2><p>Move into the output directory and look at the contigs:</p><div><pre>infoseq contigs.fasta</pre></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/19921/which-of-the-followings-are-the-best-place-to-study-bioinformatics</guid>
	<pubDate>Sun, 28 Dec 2014 00:20:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/19921/which-of-the-followings-are-the-best-place-to-study-bioinformatics</link>
	<title><![CDATA[Which of the followings are the best place to study Bioinformatics ?]]></title>
	<description><![CDATA[<p>Bioinformatics is a major growth area and qualified Bioinformaticians are in high demand. An explosion in biological data has resulted from genome projects, next generation sequencing and other 'omics' techniques. Bioinformatics provides the tools to analyse and exploit such data sets.<br /><br />Can you please suggest me the best place to study bioinformatics ( Grad/PostGrad).</p>]]></description>
	<dc:creator>Reshma Khatun</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Sat, 06 Jul 2024 04:29:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p dir="auto">SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol dir="auto">
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/20007/roche-has-acquired-bina-technologies</guid>
	<pubDate>Tue, 30 Dec 2014 09:42:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/20007/roche-has-acquired-bina-technologies</link>
	<title><![CDATA[Roche has acquired Bina Technologies !!!]]></title>
	<description><![CDATA[<p>Bina Technologies is a privately held company that provides a big data platform for centralized management and processing of next generation sequencing (NGS) data for the academic and translational research markets.&nbsp; Bina will be integrated into the Roche Sequencing Unit, and will continue to focus on development of their innovative genomic analysis solution.<br /><br />Roche has acquired Bina Technologies, a privately-owned biotech company based in California. The biotech&rsquo;s first product was the Bina Box, a platform for secondary genomic analysis, sequence alignment, and variant calling, but since 2012, it has developed other products and platforms. <br /><br />It is our shared vision with Roche that informatics and data sciences are critical elements of an end-to-end genomics solution. Fast, easy-to-use, scalable, and robust informatics solutions make a big difference in the quality and impact of the work of scientists and researchers. We believe in the future of data-driven, personalized medicine. We are passionate about accelerating that future together with Roche.<br /><br />Financial details of the deal were not disclosed. For Roche, the move is yet another in a string of acquisitions. Last week (December 18), Roche paid $489 million for antibody maker Dutalys. And earlier this month, Roche bought prenatal testing company Ariosa Diagnostics.</p><p>Reference</p><p>http://blog.bina.com/news/bina-technologies-acquired-by-roche?&amp;__hssc=109677338.1.1419953400266&amp;__hstc=109677338.b8350f2729889b08f1325906d5236cd3.1419953400266.1419953400266.1419953400266.1&amp;hsCtaTracking=96cac941-9372-4bbf-bacb-3ca6f1ff8cfd|3fce0f18-835b-4086-9345-388880861732</p><p>http://www.the-scientist.com/?articles.view/articleNo/41750/title/Roche-Buys-Bioinformatics-Firm/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</guid>
	<pubDate>Tue, 01 Jan 2019 12:01:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</link>
	<title><![CDATA[HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning]]></title>
	<description><![CDATA[<p><span>HECIL&mdash;Hybrid Error Correction with Iterative Learning&mdash;a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.&nbsp;</span></p>
<p><span><span>HECIL&rsquo;s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.</span></span></p><p>Address of the bookmark: <a href="https://github.com/NDBL/HECIL" rel="nofollow">https://github.com/NDBL/HECIL</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/20331/type-hinting</guid>
	<pubDate>Fri, 09 Jan 2015 22:26:13 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/20331/type-hinting</link>
	<title><![CDATA[Type Hinting]]></title>
	<description><![CDATA[<p>Python creator Guido van Rossum&rsquo;s proposal for static type-checking annotations is inching closer to reality, and the feature has taken on a new name: type hinting.</p><p><img src="http://sdtimes.com/wp-content/uploads/2015/01/0107.sdt-python-typehinting.png" alt="image" width="619" height="219" style="border: 0px; border: 0px;"></p><p>Back in August, van Rossum published a proposal on the Python mailing list recommending type-checking annotations as a valuable feature for the next version of Python to improve the performance of editors and IDEs, linter capabilities, standard notation, and refactoring. Van Rossum&rsquo;s <a href="http://lwn.net/Articles/627558/">latest proposal</a>, posted late last month, outlined plans to publish a Python Enhancement Proposal (PEP) in early January to put the feature now known as type hinting on track for inclusion in Python 3.5, slated for release this September.</p><p>Reference</p><p>https://quip.com/r69HA9GhGa7J</p>]]></description>
	<dc:creator>Pranjali Yadav</dc:creator>
</item>

</channel>
</rss>