<?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/36880?offset=1120</link>
	<atom:link href="https://bioinformaticsonline.com/related/36880?offset=1120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40946/free-genomics-data</guid>
	<pubDate>Fri, 07 Feb 2020 14:08:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40946/free-genomics-data</link>
	<title><![CDATA[Free Genomics data !]]></title>
	<description><![CDATA[<p><span>The specimens were collected by the Oxford Wytham Woods and Edinburgh Lohse lab teams. DNA extraction and sequencing was carried out by the Sanger Institute Scientific Operations teams. Assemblies were carried out by the Tree of Life team (Shane McCarthy) and colleagues in Pacific Biosciences (Jonas Korlach).</span></p>
<p><a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p><p>Address of the bookmark: <a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/" rel="nofollow">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25095/jrf-bioinformatics</guid>
  <pubDate>Mon, 02 Nov 2015 03:24:50 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics]]></title>
  <description><![CDATA[
<p>JRF Bioinformatics</p>

<p>Eligibility : ME/M.Tech, MSc(Bio-Chemistry, Bio-Informatics, Bio-Tech, Microbiology), BE/B.Tech</p>

<p>Location : Gandhinagar</p>

<p>Last Date : 05 Nov 2015</p>

<p>Hiring Process : Face to Face Interview</p>

<p>Junior Research Fellow (JRF) Job vacancies in Gujarat State Biotechnology Mission (GSBTM)</p>

<p>Project : “Establishing a network in computational and system biology”</p>

<p>No. of Post : 01</p>

<p>Qualification : MSc. /M.Tech. /B.E. /B.Tech. in Biotechnology/Bioinformatics /Life Sciences /Microbiology /Biochemistry /Genetics from recognized University. Preference would be given to the candidates having NET/GATE.</p>

<p>Fellowship : Rs. 12,000 + 20% HRA<br />How to apply</p>

<p>Applications should be filled Online. The last date for submission of application is 5th November, 2015.</p>

<p>More at http://btm.gujarat.gov.in/btm/recruitment2.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</guid>
	<pubDate>Wed, 13 May 2020 10:23:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</link>
	<title><![CDATA[Filtlong: quality filtering tool for long reads]]></title>
	<description><![CDATA[<p>Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the filter.</p>
<p>Filtlong builds into a stand-alone executable:</p>
<pre><code>git clone https://github.com/rrwick/Filtlong.git
cd Filtlong
make -j
bin/filtlong -h
</code></pre><p>Address of the bookmark: <a href="https://github.com/rrwick/Filtlong" rel="nofollow">https://github.com/rrwick/Filtlong</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25149/project-assistant-ii-job-vacancies-in-national-institute-of-oceanography-nio-goa</guid>
  <pubDate>Fri, 06 Nov 2015 01:33:22 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Assistant-II job vacancies in National Institute of Oceanography (NIO Goa)]]></title>
  <description><![CDATA[
<p>Vacancy no : GAP0423/1509-15</p>

<p>Project Assistant-II job vacancies in National Institute of Oceanography (NIO Goa)</p>

<p>Project Title and Code : Biotechnology Information System. -- GAP0423</p>

<p>Qualification : M.Sc Bioinformatics / Zoology / Botany / Environmental Science. Desirable : Basic understanding of biodiversity concept is desirable</p>

<p>No. of Post : 01</p>

<p>Age : 28 Years</p>

<p>Place of Posting : Goa</p>

<p>Consolidated Stipend Per Month : Rs.16000/-</p>

<p>Job Requirement : Collection and handling of biodiversity data as assigned by the scientists and working with in-house biodiversity data management applications and software<br />How to apply</p>

<p>Candidates satisfying requirements may attend the Walk-in-interview on 12.11.2015, 10.00 AM at NIO Dona Paula, Goa-403004 along with their bio-data, attested copies of certificates &amp; mark lists in proof of qualification (SSC onwards), age, experience and testimonials. Candidates should bring a photo identity proof at the time of registration</p>

<p>More at http://www.nio.org/index/option/com_vacgoa/task/show/title/Goa/tid/6/sid/28/thid/64</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</guid>
	<pubDate>Thu, 24 Dec 2020 10:03:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42477/hifiasm-a-haplotype-resolved-assembler-for-accurate-hifi-reads</link>
	<title><![CDATA[Hifiasm: a haplotype-resolved assembler for accurate Hifi reads]]></title>
	<description><![CDATA[<p><span>Hifiasm is a fast haplotype-resolved de novo assembler for PacBio Hifi reads. It can assemble a human genome in several hours and works with the California redwood genome, one of the most complex genomes sequenced so far. Hifiasm can produce primary/alternate assemblies of quality competitive with the best assemblers. It also introduces a new graph binning algorithm and achieves the best haplotype-resolved assembly given trio data.</span></p><p>Address of the bookmark: <a href="https://github.com/chhylp123/hifiasm" rel="nofollow">https://github.com/chhylp123/hifiasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</guid>
	<pubDate>Tue, 17 Aug 2021 13:17:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43260/bioinformatics-tools-for-telomere-to-telomere-assembly</link>
	<title><![CDATA[Bioinformatics tools for telomere to telomere assembly !]]></title>
	<description><![CDATA[<p>●&nbsp;<a href="https://github.com/arangrhie/merfin" target="_blank">Merfin</a>&nbsp;&ndash; k-mer-based assembly and variant calling evaluation for improved consensus accuracy (Arang Rhie)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.11.11.378133v1" target="_blank">PanGenie</a>&nbsp;&ndash; algorithm that leverages a pangenome reference built from haplotype-resolved genome assemblies in conjunction with k-mer count information from raw, short-read sequencing data to genotype a wide spectrum of genetic variation (Tobias Marschall)<br />●&nbsp;<a href="https://github.com/ConesaLab/SQANTI3" target="_blank">SQANTI3</a>&nbsp;&ndash; an automated pipeline for the classification of long-read transcripts that can assess the quality of data and the preprocessing pipeline (Roc&iacute;o Amor&iacute;n de Heged&uuml;s&nbsp;<a href="https://twitter.com/rocioadh" target="_blank">@rocioadh</a>)<br />●&nbsp;<a href="https://github.com/GenomeRIK/tama" target="_blank">tama</a>&nbsp;(Transcriptome Annotation by Modular Algorithms) &ndash; software designed for processing Iso-Seq data and other long-read transcriptome data (Richard Kuo&nbsp;<a href="https://twitter.com/GenomeRIK" target="_blank">@GenomeRIK</a>)<br />●&nbsp;<a href="https://github.com/PacificBiosciences/pbAA" target="_blank">pbaa</a>&nbsp;(PacBio Amplicon Analysis) &ndash; separates complex mixtures of amplicon targets from genomic samples to cluster and generate high-quality consensus sequences from HiFi reads (Zev Kronenberg&nbsp;<a href="https://twitter.com/zevkronenberg" target="_blank">@zevkronenberg</a>)<br />●&nbsp;<a href="https://github.com/yuanyuan929/bellerophon" target="_blank">bellerophon</a>&nbsp;&ndash; analyzes MHC typing and other low-complexity gene amplicon data; performs allele calling while detecting polymorphic sites within the sequences and removing potential chimeric sequence variants (Yuanyuan Cheng&nbsp;<a href="https://twitter.com/Yuanyuan929" target="_blank">@Yuanyuan929</a>)<br />●&nbsp;<a href="https://github.com/amwenger/svpack" target="_blank">svpack</a>&nbsp;&ndash; tools for filtering, comparing, and annotating structural variant (SV) calls in VCF format (Aaron Wenger)<br />●&nbsp;<a href="https://github.com/AntonBankevich/jumboDB" target="_blank">JumboDB</a>&nbsp;&ndash; tool for de Bruijn graph construction (Anton Bankevich&nbsp;<a href="https://twitter.com/AntonBankevich" target="_blank">@AntonBankevich</a>)<br />●&nbsp;<a href="https://github.com/ksahlin/ultra" target="_blank">uLTRA</a>&nbsp;&ndash; tool for splice alignment of long transcriptomic reads to a genome, guided by a database of exon annotations. (Kristoffer Sahlin&nbsp;<a href="https://twitter.com/krsahlin" target="_blank">@krsahlin</a>)<br />●&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2021.01.25.428044v1.full.pdf" target="_blank">LeafGo</a>&nbsp;&ndash; workflow to rapidly produce high-quality de novo plant genomes (Luca Ermini&nbsp;<a href="https://twitter.com/ermini_luca" target="_blank">@ermini_luca</a>)</p><p>Reference:</p><p>https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/</p><p>&nbsp;</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25293/srfjrf-bioinformatics-at-national-bureau-of-animal-genetic-resources</guid>
  <pubDate>Thu, 26 Nov 2015 01:54:07 -0600</pubDate>
  <link></link>
  <title><![CDATA[SRF/JRF Bioinformatics at National Bureau of Animal Genetic Resources]]></title>
  <description><![CDATA[
<p>National Bureau of Animal Genetic Resources </p>

<p>SRF Job vacancies in National Bureau of Animal Genetic Resources (NBAGR) on contractual basis</p>

<p>No. of Posts : 03</p>

<p>Qualifications : Master degree in any one of discipline/ Subjects Biotechnology/Bioinformatics/Life Sciences/ Computer Applications with 4 years/5 years of Bachelor’s degree. Candidates having post graduate degree in above mentioned subjects with 3 years Bachelor’s degree should be NET qualified.</p>

<p>Note : i. The Ph.D. Degree holders are eligible for the posts. ii. The Master’s degree holders with the integrated degrees like B.Tech. &amp; M. Tech. (5 years) are eligible. iii. Graduates with three years Bachelor’s degree, who have acquired professional Master’s degree (3 years) like M.Sc. (Ag.), Masters in Computer Applications, M. Tech., etc., are eligible.</p>

<p>Desirable : The candidates should have zeal to work in R environment and NGS data analysis</p>

<p>Emolument : Rs. 28,000/- </p>

<p>Age Limit : 35 year for Men and 40 years for Women in case of SRF on the date of Interview.<br />How to apply</p>

<p>Walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132 001 at 10:30 AM on 02.12.2015. Interested candidates may attend Walk-in-Interview at 10:30 AM on 02.12.2015 alongwith original certificates and typed bio-data with one set of attested copies of each their certificates with passport size photograph.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Wed, 08 Nov 2017 11:40:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span><span>Illumina Sequencing data can provide high coverage of a genome by relatively short (most often 100 bp to 150 bp) reads at a low cost. Even with low (advertised 1%) error rate, 100 &times; coverage Illumina data on average has an error in some read at every base in the genome. These errors make handling the data more complicated because they result in a large number of low-count erroneous&nbsp;</span><em>k</em><span>-mers in the reads. However, there is enough information in the reads to correct most of the sequencing errors, thus making subsequent use of the data (e.g. for mapping or assembly) easier. Here we use the term &ldquo;error correction&rdquo; to denote the reduction in errors due to both changes in individual bases and trimming of unusable sequence. We developed an error correction software called QuorUM. QuorUM is mainly aimed at error correcting Illumina reads for subsequent assembly. It is designed around the novel idea of minimizing the number of distinct erroneous&nbsp;</span><em>k</em><span>-mers in the output reads and preserving the most true&nbsp;</span><em>k</em><span>-mers, and we introduce a composite statistic &pi; that measures how successful we are at achieving this dual goal. We evaluate the performance of QuorUM by correcting actual Illumina reads from genomes for which a reference assembly is available.</span></span></p>
<p><span>QuorUM is distributed as an independent software package and as a module of the MaSuRCA assembly software. Both are available under the GPL open source license at&nbsp;</span><a href="http://www.genome.umd.edu/">http://www.genome.umd.edu</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25303/ciab-recruits-scientist-engineer-informatics-officer</guid>
  <pubDate>Sat, 28 Nov 2015 03:40:28 -0600</pubDate>
  <link></link>
  <title><![CDATA[CIAB Recruits Scientist, Engineer, Informatics Officer]]></title>
  <description><![CDATA[
<p>Center of Innovative and Applied Bioprocessing (CIAB) - Punjab</p>

<p>Center of Innovative and Applied Bioprocessing (CIAB) invites applications to recruit on vacant posts of Scientist, Associate Plant Manager/ Plant Engineer, Informatics Officer. Applications against these Government Jobs can be submitted on or before 7th January 2016.<br />CIAB Vacancy 2015 Details</p>

<p>9. Research &amp; Development – Informatics Officer<br />Qualification: M. Tech or M.E. in computer science or information technology or bioinformatics with 4 years of R&amp;D experience (after Master’s Degree) in an R&amp;D organization with work profile of large data assembly, analysis.<br />Age Limit: 45 years<br />How to Apply : Duly filled-in applications in prescribed application format along with copies of required documents should be reach to: Chief Exec</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span>We produce trimmed and error-corrected reads that result in assemblies with longer contigs and fewer errors. We compared QuorUM against several published error correctors and found that it is the best performer in most metrics we use. QuorUM is efficiently implemented making use of current multi-core computing architectures and it is suitable for large data sets (1 billion bases checked and corrected per day per core)</span></p><p>Address of the bookmark: <a href="http://www.genome.umd.edu/" rel="nofollow">http://www.genome.umd.edu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>