<?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/29384?offset=1230</link>
	<atom:link href="https://bioinformaticsonline.com/related/29384?offset=1230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21893/postdoctoral-fellowship-in-bioinformatics-and-evolutionary-genomics</guid>
  <pubDate>Wed, 01 Apr 2015 21:36:42 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Fellowship in Bioinformatics and Evolutionary Genomics]]></title>
  <description><![CDATA[
<p>Postdoctoral Fellowship in Bioinformatics and Evolutionary Genomics<br />Organization<br />National Human Genome Research Institute, National Institutes of Health<br />http://genome.gov/Staff/Baxevanis<br />Job Location<br />Bethesda, MD<br />Job Description</p>

<p>A postdoctoral training position is currently available in the Computational and Statistical Genomics Branch (CSGB) of the National Human Genome Research Institute (NHGRI). The position is located in the laboratory of Andy Baxevanis, Ph.D., whose research group uses comparative genomics approaches to better-understand the molecular innovations that drove the surge of diversity in early animal evolution. The overarching theme of Dr. Baxevanis’ research program is focused on how non-traditional animal models convey critical insights into human disease research.</p>

<p>Candidates should have or be close to obtaining a Ph.D. or equivalent degree in bioinformatics, computational biology, computer science, molecular biology, or a closely related field. Candidates with a background in evolutionary biology are particularly encouraged to apply. Programming skills and experience in the application of computational methods to genomic data are highly desirable. Applicants must possess good communication skills and be fluent in both spoken and written English. The ability to learn how to use new software and quickly become expert in its use, critical thinking, problem-solving abilities, and the ability to work semi-independently are required.<br />How to Apply</p>

<p>Interested applicants should submit a curriculum vitae, a detailed letter of interest, and the names of three potential referees to Dr. Baxevanis at andy@mail.nih.gov.<br />About Our Organization</p>

<p>The NIH Intramural Research Program is on the Bethesda, Maryland campus and offers a wide array of training opportunities for scientists early in their careers. The funding for this position is stable and offers the trainee wide latitude in the design and pursuit of their research project. The successful candidate will have access to NHGRI’s established and robust bioinformatics infrastructure, as well as resources made available through NIH’s Center for Information Technology (CIT) and the National Center for Biotechnology Information (NCBI).</p>

<p>For more information on CSGB and NHGRI’s Intramural Research Program, please see http://genome.gov/DIR/.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40889/rcorrector-efficient-and-accurate-error-correction-for-illumina-rna-seq-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:23:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40889/rcorrector-efficient-and-accurate-error-correction-for-illumina-rna-seq-reads</link>
	<title><![CDATA[Rcorrector: efficient and accurate error correction for Illumina RNA-seq reads]]></title>
	<description><![CDATA[<p><span>Rcorrector has an accuracy higher than or comparable to existing methods, including the only other method (SEECER) designed for RNA-seq reads, and is more time and memory efficient. With a 5 GB memory footprint for 100 million reads, it can be run on virtually any desktop or server. The software is available free of charge under the GNU General Public License from&nbsp;</span><a href="https://github.com/mourisl/Rcorrector/" target="_blank">https://github.com/mourisl/Rcorrector/</a><span>.</span></p>
<pre><code>Usage: perl run_rcorrector.pl [OPTIONS]
OPTIONS:
	Required
	-s seq_files: comma separated files for single-end data sets
	-1 seq_files_left: comma separated files for the first mate in the paried-end data sets
	-2 seq_files_right: comma separated files for the second mate in the paired-end data sets
	-i seq_files_interleaved: comma sperated files for interleaved paired-end data sets
	Optional
	-k INT: kmer_length (&lt;=32, default: 23)
	-od STRING: output_file_directory (default: ./)
	-t INT: number of threads to use (default: 1)
	-trim : allow trimming (default: false)
	-maxcorK INT: the maximum number of correction within k-bp window (default: 4)
	-wk FLOAT: the proportion of kmers that are used to estimate weak kmer count threshold, lower for more divergent genome (default: 0.95)
	-ek INT: expected number of kmers; does not affect the correctness of program but affects the memory usage (default: 100000000)
	-stdout: output the corrected reads to stdout (default: not used)
	-verbose: output some correction information to stdout (default: not used)
	-stage INT: start from which stage (default: 0)
		0-start from begining(storing kmers in bloom filter) ;
		1-start from count kmers showed up in bloom filter;
		2-start from dumping kmer counts into a jf_dump file;
		3-start from error correction.</code></pre><p>Address of the bookmark: <a href="https://github.com/mourisl/Rcorrector/" rel="nofollow">https://github.com/mourisl/Rcorrector/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21934/ra-bioinformatics-at-bose-institute</guid>
  <pubDate>Tue, 07 Apr 2015 03:30:25 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Bose Institute]]></title>
  <description><![CDATA[
<p>Bose Institute, Kolkata, invites online applications from Indian Citizens for recruitment of Research Associate (05 posts) under Institute Plan Programmes : Improvement of Plants : Biotechnological, Genomic and Proteomic Approaches (programme No. – I), Bioinformatics and Computational Biology (programme No. – III), Microbial Genomics and Infection Biology (programme No. – V) and Basic &amp; Applied Problems in Physical and Environmental Sciences (programme No. – VII). All the posts are tenable for one (01) year.</p>

<p>ESSENTIAL QUALIFICATION: PH.D. DEGREE IN LIFE SCIENCES / PHYSICAL SCIENCE.</p>

<p>Research Associate for Programme No. –I Specialization in the area of plant molecular biology or plant proteomic study or plant pathogen interaction.<br />Research Associate for Programme No. –I Specialization in the area of plant / fungal Biotechnology, tissue culture and molecular biology<br />Research Associate for Programme No. –III Specialization in the area of structural biology and protein crystallography.<br />Research Associate for Programme No. – V Specialization in the area of microbial physiology (metabolism) or environmental microbiology, with experience in microbial genomics and proteomics.<br />Research Associate for Programme No. – VII Specialization in the area of Theoretical High Energy Astrophysics or Astroparticle Physics. Proven record of independent research experience in Astrophysical<br />Radiation Magnetohydrodynamics or Cosmic Ray Astrophysics. Experience in numerical techniques and /or date analysis would be additional advantage.<br />Associateship : 22,000/- p.m., plus admissible H.R.A. and Medical benefit.<br />Age: Below 3 Age : Below 35 years (Relaxable in case of SC/ST/OBC/Women candidates only as per rule).<br />SELECTION PROCEDURE FOR BOSE INSTITUTE- RESEARCH ASSOCIATE POST:</p>

<p>Candidates can apply on or before 13/4/2015.<br />No detailed information about the selection procedure is mentioned in the recruitment notification.<br />HOW TO APPLY FOR RESEARCH ASSOCIATE VACANCY IN BOSE INSTITUTE:</p>

<p>Interested and eligible candidates may read the application procedures and instructions carefully before applying through online as well as submitting the hard copy of the same. Candidates those who has submitted their Ph.D. Thesis and can produce Provisional Ph.D. Certificate at the time of Interview may also apply </p>

<p>Ref<br />Bose Institute Recruitment 2015 –  ADVT. NO. : BI/IF/35/2014-15.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</guid>
	<pubDate>Fri, 27 Mar 2020 22:49:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</link>
	<title><![CDATA[HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads]]></title>
	<description><![CDATA[<p><span>HiCanu, a significant modification of the Canu assembler designed to leverage the full potential of HiFi reads via homopolymer compression, overlap-based error correction, and aggressive false overlap filtering.&nbsp;</span></p>
<p>More at&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3?fbclid=IwAR2PaN4GLjvAZpWmCE2q0EWk2dtwY7wiKxVlXn9PPG7OBSP06PP2gcCrv3A">https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3</a></p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/21982/which-bioinformatics-journals-do-you-follow</guid>
	<pubDate>Fri, 10 Apr 2015 12:10:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/21982/which-bioinformatics-journals-do-you-follow</link>
	<title><![CDATA[Which Bioinformatics Journals Do You Follow?]]></title>
	<description><![CDATA[<p><span><span>Which are your favorite bioinformatics journals? The ones that you check every month or so, or that you are subscribed to?</span></span></p>]]></description>
	<dc:creator>Tenzin Paul</dc:creator>
</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/opportunity/view/22028/walk-in-for-research-asst-programmer-enterovirus-research-centre-mumbai-india</guid>
  <pubDate>Tue, 14 Apr 2015 12:36:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk in for Research Asst &amp; Programmer Enterovirus Research Centre Mumbai - India]]></title>
  <description><![CDATA[
<p>Enterovirus Research Centre Mumbai Jobs 2015 –</p>

<p>Walk in for Research Asst &amp; Programmer Posts: Enterovirus Research Centre, Mumbai, Indian Council of Medical Research has issued notification for the recruitment of Research Asst &amp; Programmer vacancies on temporary basis for the project entitled “An Atlas of Non-Polio Enterovirus Types Isolated from Cases of Acute Flaccid Paralysis in India”. Eligible candidates may walk in on 20-04-2015 from 10:00 AM to 12:00 Noon. Other details like age limit, educational qualification, how to apply are given below…</p>

<p>Enterovirus Research Centre Mumbai Vacancy Details:<br />Total No. of Posts: 04<br />Name of the Posts:<br />1. Research Assistant: 03 Posts<br />2. Programmer: 01 Post</p>

<p>Age Limit: Candidates age should below 28 years. Age relaxations are applicable as per rules.</p>

<p>Educational Qualification: Candidates should have M.Sc (1st Class) in Microbiology/ Bioinformatics/ Biotechnology/ Life Science for post 1, BE/ B.Tech/ MCA for post 2.</p>

<p>Selection Process: Candidates are selected based on their performance in interview.</p>

<p>How to Apply: Eligible candidates may attend for interview along with original certificates, CV, attested copies of relevant certificates, one recent passport size photograph duly affixed on right side of application at Enterovirus Research Centre, Mumbai, Indian Council of Medical Research, Haffkine Institute Cmpound, Acharya Donde Marg, Parel, Mumbai-400012 on 20-04-2015 from 10:00 AM to 12:00 Noon.</p>

<p>Important Dates:<br />Date &amp; Time of Interview: 20-04-2015 from 10:00 AM to 12:00 Noon.<br />Registration Time: 12:00 Noon.</p>
]]></description>
</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/file/view/22050/binc-sample-question-paper</guid>
	<pubDate>Thu, 16 Apr 2015 09:15:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/22050/binc-sample-question-paper</link>
	<title><![CDATA[BINC Sample Question Paper !!!]]></title>
	<description><![CDATA[<p>BINC sample question paper round THREE ...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/22050" length="316" type="text/plain" />
</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>

</channel>
</rss>