<?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/27076?offset=640</link>
	<atom:link href="https://bioinformaticsonline.com/related/27076?offset=640" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38481/arcs-scaffolding-genome-drafts-with-linked-reads</guid>
	<pubDate>Mon, 17 Dec 2018 17:40:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38481/arcs-scaffolding-genome-drafts-with-linked-reads</link>
	<title><![CDATA[ARCS: scaffolding genome drafts with linked reads]]></title>
	<description><![CDATA[<p>ARCS requires two input files:</p>
<ul>
<li>Draft assembly fasta file</li>
<li>Interleaved linked reads file (Barcode sequence expected in the BX tag of the read header or in the form "@readname_barcode" ; Run&nbsp;<a href="https://support.10xgenomics.com/genome-exome/software/pipelines/latest/what-is-long-ranger">Long Ranger basic</a>&nbsp;on raw chromium reads to produce this interleaved file)</li>
<li></li>
</ul><p>Address of the bookmark: <a href="https://github.com/bcgsc/ARCS/" rel="nofollow">https://github.com/bcgsc/ARCS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12936/assistant-professor-medical-bioinformatics</guid>
  <pubDate>Wed, 23 Jul 2014 05:00:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor - Medical Bioinformatics]]></title>
  <description><![CDATA[
<p>Advt. No : ME-I/A-IV/03/14</p>

<p>No.of Posts:01 (SC)</p>

<p>Pay Scale:</p>

<p>Pay Band of Rs.15600-39100 + Rs.6000/- GP +NPA @ 25% of Basic Pay +Learning Resource Allowance @ Rs.20,000/-P.A.+ Conveyance Allowance @ Rs. 1650/-P.M.+ Academic Allowance @ Rs.2500/- P.M. and other admissible allowances.</p>

<p>Qualifications:</p>

<p>Area of Specialization:-</p>

<p>Bioinformatics/Computational/Biology/Genomics/ Proteomics/ Structural Biology</p>

<p>1. Postgraduate qualification, e.g. Master’s Degree in Biotechnology/Bioinformatics/ Biophysics.</p>

<p>2. A Doctorate Degree of recognized University/Institute in a basic or allied Medical Science subject e.g. Medical Biotechnology/Biophysics. Bioinformatics/X-ray Crystallography/</p>

<p>Immunology/Structural Biology etc</p>

<p>Experience:</p>

<p>1.Minimum three years teaching and/or research experience in a recognized medical/research Institution in an allied medical subject after obtaining doctorate degree and preferably in Medical</p>

<p>Molecular Biology/ Biophysics/Structural Biology/Genomics and Clinical Proteomics/Computational Biology.</p>

<p>2. Minimum two publication with atleast one in international journal and atleast one as first author</p>

<p>Desirable:-</p>

<p>Consistently excellent scholastic/academic record, demonstrated ability to write grant proposal/(s) successfully, Post Doctoral training in a frontier area of medical Bioinformatics Research and of direct relevance to clinical diagnosis or patient care (preferably from a recognized top-ranking medical institution abroad)</p>

<p>Send your applications to O/O, Deputy Registrar, Recruitment &amp; Establishment Cell, University of Health Sciences, Rohtak by 08.7.2014</p>

<p>For more details,please visit website:http://pgimsrohtak.nic.in/2014%20AP%20Advt.pdf</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/blog/view/13025/the-5-reasons-to-mistakes-at-bioinformatics-work</guid>
	<pubDate>Thu, 24 Jul 2014 02:51:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/13025/the-5-reasons-to-mistakes-at-bioinformatics-work</link>
	<title><![CDATA[The 5 reasons to mistakes at bioinformatics work !!!]]></title>
	<description><![CDATA[<p>When you're just starting out with biological programming, it's easy to run into complex problems that make you wonder how anyone has ever managed to write a program. There are some problems that trip up nearly every bioinformatician--everything from getting started understanding the biological problems to dealing with program design. Some random mistakes are so prominent that even experienced biological programmers do it. The 8 years in bioinformatics and my few random observations, most of them are snarky. These reasons will always take longer than expected and compel you to postpone your project deadline.</p><p><strong>1.Stupid for biologist:</strong> Biology is so complex that it will make bioinformatician feel stupid. There are no any universal fixed rules; it can surprise you any time. So be nice to biologists who ask questions and resolve your biological puzzles. Sometime you will have no idea what the hell you were doing either.<br /><br /><strong>2.Puzzling why:</strong> Do not hesitate to ask question. Especially. at the beginning of project you will have to ask a lot of questions. Instead of puzzling it out at end check out and clear your doubt even for a single error. It may can leads to wrong conclusion.<br /><br /><strong>3.Running marathon:</strong> The most of the biological software&rsquo;s documentation is always incomplete. In other word they are no more than 95 percent complete. Sometime a single problem can halt your entire project for months. Compilation and running the pipelines in tedious because almost all are interdependent and need proper configuration. I face the same kind of problem with Evolver :( &hellip; <br /><br /><strong>4.Folders missing:</strong> The pipelines generate lots of data, and we keep them in several folders for future use. But sometime we delete them by mistake and move to recovery&hellip;<br /><br /><strong>5.Digging deeper:</strong> Digging deeper is fruitful, but some time it can be catastrophic. You may get frustrated or direction less. So keep a biologist with you for rescue &hellip;. Sometime an expert computer programmer to handle your server. Remember, the server will always go down when you need it the most.<br /><br />The most common frustrating&nbsp; common line: Why do we do this again?</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</guid>
	<pubDate>Mon, 17 Aug 2020 05:21:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</link>
	<title><![CDATA[SHAMAN: a user-friendly website for metataxonomic analysis from raw reads to statistical analysis]]></title>
	<description><![CDATA[<p><span>SHAMAN is a shiny application for differential analysis of metagenomic data (16S, 18S, 23S, 28S, ITS and WGS) including bioinformatics treatment of raw reads for targeted metagenomics, statistical analysis and results visualization with a large variety of plots (barplot, boxplot, heatmap, &hellip;).</span><br><span>The bioinformatics treatment is based on Vsearch [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/27781170">Rognes 2016</a><span>] which showed to be both accurate and fast [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/26664811">Wescott 2015</a><span>].The statistical analysis is based on DESeq2 R package [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/20979621">Anders and Huber 2010</a><span>] which robustly identifies the differential abundant features as suggested in [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3974642/">McMurdie and Holmes 2014</a><span>] and [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4727335/">Jonsson2016</a><span>]. SHAMAN robustly identifies the differential abundant genera with the Generalized Linear Model implemented in DESeq2 [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/25516281">Love 2014</a><span>].</span><br><span>SHAMAN is compatible with standard formats for metagenomic analysis (.csv, .tsv, .biom) and figures can be downloaded in several formats. A presentation about SHAMAN is available&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_presentation.pdf">here</a><span>&nbsp;and a poster&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_poster.pdf">here</a><span>.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4</a></span></p><p>Address of the bookmark: <a href="https://github.com/aghozlane/shaman" rel="nofollow">https://github.com/aghozlane/shaman</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13338/protein-function-annotation-and-machine-learning-upmc-paris-france</guid>
  <pubDate>Sat, 02 Aug 2014 01:22:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[Protein function annotation and machine learning - UPMC - Paris, France]]></title>
  <description><![CDATA[
<p>Protein function annotation and machine learning - UPMC - Paris, France</p>

<p>Job Description: We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of paris.</p>

<p>Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.</p>

<p>Title: A novel integrative platform for large scale protein annotation that exploits a multitude of diversified probabilistic models in several protein signature databases.</p>

<p>We propose a novel integrated approach for large scale protein annotation that will exploit an unprecedented amount of genomic data as well as sophisticated machine learning techniques and combinatorial optimization approaches taking advantages of High Performance Computing (HPC) environments. The idea is to uncover as much as possible the evolutionary processes of protein sequences that took place throughout the whole tree of life and that affected the evolution of a protein family. We have already demonstrated in a previous work that the problem of functional annotation is inherent to the ability of uncovering such paths. Now, we shall extend this approach to large scale genome annotation by considering 11 different protein databases, constituted by about 10^9 protein sequences, and by producing a large pool of diversified probabilistic models coding for about 10^7 evolutionary protein pathways. Such models will be used to search for specific domains in genomes to be annotated. Our previous methodology needs to be fundamentally improved to deal with this large amount of biological data. In this project, we shall work on the algorithms to reduce the space of models and the search complexity, and we shall implement some important algorithmic changes towards the realization of a powerful integrated annotation tool.</p>

<p>Where: This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.</p>

<p>Start date: September 1st, 2014<br />Contact Person: Alessandra Carbone<br />Contact: alessandra.carbone@lip6.fr</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</guid>
	<pubDate>Sat, 26 Dec 2020 08:35:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</link>
	<title><![CDATA[FastProNGS: fast preprocessing of next-generation sequencing reads]]></title>
	<description><![CDATA[<p><span>FastProNGS to integrate the quality control process with automatic adapter removal. Parallel processing was implemented to speed up the process by allocating multiple threads. Compared with similar up-to-date preprocessing tools, FastProNGS is by far the fastest.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/Megagenomics/FastProNGS" rel="nofollow">https://github.com/Megagenomics/FastProNGS</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</guid>
	<pubDate>Sun, 10 Aug 2014 03:01:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13842/swabs-to-genomes-a-comprehensive-workflow</link>
	<title><![CDATA[Swabs to Genomes: A Comprehensive Workflow]]></title>
	<description><![CDATA[<p>The sequencing, assembly, and basic analysis of microbial genomes, once a painstaking and expensive undertaking, has become almost trivial for research labs with access to standard molecular biology and computational tools. However, there are a wide variety of options available for DNA library preparation and sequencing, and inexperience with bioinformatics can pose a significant barrier to entry for many who may be interested in microbial genomics. The objective of the present study was to design, test, troubleshoot, and publish a simple, comprehensive workflow from the collection of an environmental sample (a swab) to a published microbial genome; empowering even a lab or classroom with limited resources and bioinformatics experience to perform it.</p><p>Address of the bookmark: <a href="https://peerj.com/preprints/453.pdf" rel="nofollow">https://peerj.com/preprints/453.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43273/understanding-kmer</guid>
	<pubDate>Wed, 18 Aug 2021 04:27:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43273/understanding-kmer</link>
	<title><![CDATA[Understanding kmer !]]></title>
	<description><![CDATA[<p><a href="https://en.wikipedia.org/wiki/k-mer">What is a&nbsp;<em>k-mer</em>&nbsp;anyway?</a><span>&nbsp;A&nbsp;</span><em>k-mer</em><span>&nbsp;is just a sequence of&nbsp;</span><em>k</em><span>&nbsp;characters in a string (or nucleotides in a DNA sequence). Now, it is important to remember that to get&nbsp;</span><em>all k-mers</em><span>&nbsp;from a sequence you need to get the first&nbsp;</span><em>k</em><span>&nbsp;characters, then move just a single character for the start of the next&nbsp;</span><em>k-mer</em><span>&nbsp;and so on. Effectively, this will create sequences that overlap in&nbsp;</span><code>k-1</code><span>&nbsp;positions.</span></p><p>Address of the bookmark: <a href="https://bioinfologics.github.io/post/2018/09/17/k-mer-counting-part-i-introduction/" rel="nofollow">https://bioinfologics.github.io/post/2018/09/17/k-mer-counting-part-i-introduction/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14050/assistant-professor-in-bioinformatics-at-indian-institute-of-technology-delhi</guid>
  <pubDate>Fri, 15 Aug 2014 06:16:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor 	in Bioinformatics at Indian Institute of Technology Delhi]]></title>
  <description><![CDATA[
<p>Indian Institute of Technology Delhi Hauz Khas ,New Delhi – 110016</p>

<p>ROLLING ADVERTISEMENT NO. 01/2014(E-1)<br />ADVERTISEMENT FOR THE POSITIONS OF ASSISTANT PROFESSOR CANDIDATES CAN APPLY ANY TIME DURING THE YEAR.</p>

<p>IIT Delhi invites applications from qualified Indian Nationals, Persons of Indian Origin (PIOs) and Overseas Citizens of India (OCIs) for the following positions in the various Departments/Centres/Schools (in the fields<br />mentioned alongwith them):<br />Post Pay Band Assistant Professor and Assistant Professor (on Contract) Rs.15600-39100 (PB-3) (Minimum pay of Rs.30000/-)+ AGP Rs.8000/-</p>

<p>The following norms will be followed for fixing the basic pay + AGP for Assistant Professors appointed on<br />contract with Ph.D but experience of 3 years or less:-<br />Type Qualification &amp; Experience on the date of joining<br />Assistant Professor (Contract) PB3 (Rs. 15,600-39,100).</p>

<p>MINIMUM QUALIFICATIONS AND EXPERIENCE:<br />Ph.D. with First class at the preceding degree or equivalent in the appropriate branch with very good academic record throughout. A minimum of three years industrial/research/teaching experience, excluding however, the experience gained while Pursuing Ph. D. The candidates should preferably be below<br />35 years of age for male and 38 years for female ( to be relaxed by 5 years in case of persons with physical disability, SC/ST and 3 years in case of OBC-NCL).</p>

<p>Qualified persons include:<br />(a) Indian Nationals,<br />(b) Foreign Nationals who are “Persons of Indian Origin” (PIO) or Overseas<br />Citizens of India (OCI), in whose case, if selected, permission will be sought from Govt. of India<br />before he/she can join IIT Delhi, or<br />(c) Other Foreign Nationals, in whose case, if selected, appointment will be on a contract basis for up to 5 (five) years subject to permission from the Govt. of India before he/she can join IIT Delhi.<br />(d) Institute specifically encourages applicants from SC/ST/OBC category as well as persons<br />with disability to apply for these positions. </p>

<p>AMAR NATH &amp; SHASHI KHOSLA SCHOOL OF INFORMATION TECHNOLOGY:<br />Computational Neuroscience, Medical Applications of Information Technologies, Computational &amp; Systems Biology, Machine to Machine (M2M) Technologies, Embedded Systems &amp; Sensors, Computer Security.<br />KUSUMA SCHOOL OF BIOLOGICAL SCIENCES:<br />In-silico Biology Applications, Systems Biology, Infection Biology, Neurodegeneration. </p>

<p>More at http://www.iitd.ac.in/sites/default/files/jobs/faculty/spl-areas-rolling-advt.pdf</p>

<p>http://www.iitd.ac.in/content/faculty-positions</p>
]]></description>
</item>

</channel>
</rss>