<?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/27440?offset=780</link>
	<atom:link href="https://bioinformaticsonline.com/related/27440?offset=780" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19091/phd-opportunity-aicadd-fellowship-mhrd-govt-of-india-of-university-of-kerala</guid>
  <pubDate>Sat, 08 Nov 2014 15:16:24 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD opportunity / AiCADD fellowship (MHRD, Govt. of India) of University of Kerala.]]></title>
  <description><![CDATA[
<p>No. DCB/DBT-BIF/229 /14-15                                                                                     07-11-2014</p>

<p>Applications are invited for the AiCADD fellowship (MHRD, Govt. of India) of University of Kerala.</p>

<p>The terms and conditions of the fellowship is given below:</p>

<p>Ø The AiCADD PhD Fellowship scheme will be available for the students registered for full-time research      or   intending to register and pursue full time research at SIUCEB in frontier areas of bioinformatics,    computational biology, systems biology and closely allied areas with focus on Ayur-Informatics. </p>

<p>  Ø  The fellowships will be widely announced and open to students irrespective of geographical consideration.</p>

<p>  Ø  Candidates availing of this fellowship shall not be in receipt of any other fellowships concurrently.</p>

<p>  Ø  Researchers will be selected on the basis of research aptitude test and personal interview.</p>

<p>  Ø  Each selected student will be eligible for a monthly fellowship of Rs. 10,000/- for the 1st and 2nd year and Rs. 12,000/- for the 3rd year.</p>

<p>  Ø  Candidates must register for PhD within one year of joining, failing which the fellowship will have to be    remitted back.</p>

<p>  Ø  Candidates receiving the fellowship shall submit bi-annual reports of progress and the continuation of the fellowship will be based on the evaluation of the same.</p>

<p>  Ø  Candidates are also required to take up academic duties including teaching upto a maximum of 6 hours     per week, as directed by AiCADD Principal Investigator.</p>

<p> Interested candidates may please forward their application along with resume on or before 15th November 2014 in the following address. Principal Investigator, AiCADD Centre, Dept. of Computational Biology and Bioinformatics, University of Kerala, Thiruvananthapuram - 695581.</p>

<p>More at https://sites.google.com/site/centreforbioinformatics/announcements</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</guid>
	<pubDate>Mon, 04 Jun 2018 05:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</link>
	<title><![CDATA[EAGLER: a scaffolding tool for long reads.]]></title>
	<description><![CDATA[<p>EAGLER is a scaffolding tool for long reads. The scaffolder takes as input a draft genome created by any NGS assembler and a set of long reads. The long reads are used to extend the contigs present in the NGS draft and possibly join overlapping contigs. EAGLER supports both PacBio and Oxford Nanopore reads.</p>
<p>The tool should be compatible with most UNIX flavors and has been successfully tested on the following operating systems:</p>
<ul>
<li>Mac OS X 10.11.1</li>
<li>Mac OS X 10.10.3</li>
<li>Ubuntu 14.04 LTS</li>
</ul>

https://bib.irb.hr/datoteka/844447.Diplomski_2015_Luka_terbi.pdf<p>Address of the bookmark: <a href="https://github.com/mculinovic/EAGLER" rel="nofollow">https://github.com/mculinovic/EAGLER</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</guid>
	<pubDate>Fri, 06 Jul 2018 04:27:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</link>
	<title><![CDATA[ReMILO: reference assisted misassembly detection algorithm using short and long reads.]]></title>
	<description><![CDATA[ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.<p>Address of the bookmark: <a href="https://github.com/songc001/remilo" rel="nofollow">https://github.com/songc001/remilo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</guid>
	<pubDate>Wed, 22 Aug 2018 10:40:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</link>
	<title><![CDATA[SimLoRD: A read simulator for third generation sequencing reads]]></title>
	<description><![CDATA[<p>SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.</p>
<p>Reads are simulated from both strands of a provided or randomly generated reference sequence.</p>
<div id="rst-header-features">
<ul>
<li>The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)</li>
<li>The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length</li>
<li>Quality values and number of passes depend on fragment length.</li>
<li>Provided subread error probabilities are modified according to number of passes</li>
<li>Outputs reads in FASTQ format and alignments in SAM format</li>
</ul>
</div><p>Address of the bookmark: <a href="https://bitbucket.org/genomeinformatics/simlord/" rel="nofollow">https://bitbucket.org/genomeinformatics/simlord/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19544/sau-bioinformaticsplant-biotech-jrf-vacancy</guid>
  <pubDate>Fri, 12 Dec 2014 21:27:12 -0600</pubDate>
  <link></link>
  <title><![CDATA[SAU Bioinformatics/Plant Biotech JRF Vacancy]]></title>
  <description><![CDATA[
<p>Applications are invited for the post of Junior Research Fellow (JRF) to work on SERB, DST funded project entitled “Genome wide analysis of ascorbate oxidase multi-gene family and elucidating its role in negative regulation of stress response in rice” under the supervision of Dr. Ananda Mustafiz, Faculty of Life Sciences and Biotechnology, South Asian University.</p>

<p>Qualification: Highly motivated M.Sc. (Bioinformatics/ Biotechnology/ Life Sciences/ Botany/ Agriculture) students are encouraged to apply. Prior experience in Bioinformatics/Plant tissue culture work is preferable. Preferences would be given to DBT/ CSIR / UGC NET qualified students.</p>

<p>Application Procedure: A detailed CV indicating name, date of birth, address, contact number, e-mail address, educational qualifications, NET qualified or not, research experiences if any, should be e-mailed to This email address is being protected from spambots. You need JavaScript enabled to view it. on or before 24th December 2014.</p>

<p>Important Note: Only short listed candidates will be called for interview at Akbar Bhawan, Chanakyapuri, New Delhi. No TA/DA will be paid for attending the interview. SAU Selection Committee reserves the rights to relax any of the qualifications in case the candidate is found otherwise well qualified. The above- mentioned post is temporary and will be initially offered for a period of one year, which can be extended to one more year.</p>

<p>Advertisement:  www.sau.ac.in/recruitment/vacancy.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</guid>
	<pubDate>Tue, 18 Sep 2018 07:52:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37737/rebaler-program-for-conducting-reference-based-assemblies-using-long-reads</link>
	<title><![CDATA[Rebaler: program for conducting reference-based assemblies using long reads.]]></title>
	<description><![CDATA[<p>Rebaler is a program for conducting reference-based assemblies using long reads. It relies mainly on&nbsp;<a href="https://github.com/lh3/minimap2">minimap2</a>&nbsp;for alignment and&nbsp;<a href="https://github.com/isovic/racon">Racon</a>&nbsp;for making consensus sequences.</p>
<p>I made Rebaler for bacterial genomes (specifically for the task of&nbsp;<a href="https://github.com/rrwick/Basecalling-comparison">testing basecallers</a>). It should in principle work for non-bacterial genomes as well, but I haven't tested it.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Rebaler" rel="nofollow">https://github.com/rrwick/Rebaler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19635/walk-in-interview-for-research-associate-studentship-and-traineeship-at-bif-nehu-tura-campus</guid>
  <pubDate>Thu, 18 Dec 2014 11:02:05 -0600</pubDate>
  <link></link>
  <title><![CDATA[Walk in interview for Research Associate, Studentship and Traineeship at BIF, NEHU, Tura Campus]]></title>
  <description><![CDATA[
<p>BIOINFORMATICS INFRASTRUCTURE FACILITY (BIF)<br />Department of RDAP<br />North-Eastern Hil University, Tura Campus<br />Tura-79402, Meghalaya</p>

<p>Walk in interview for Research Associate, Studentship and Traineeship at BIF</p>

<p>Applications are invited for the Post of Research Associate, Traineeship and Studentship in the DBT sponsored Bioinformatics Infrastructure Facility (BIF) at the Bioinformatics Centre, Department of RDAP, North-Eastern Hil University, Tura Campus, Tura-79402, Meghalaya. The Posts are purely temporary and terminable at any time without prior notice or assigning any reason thereof. The person engaged, shall not be entailed for any claim implicit or explicit for permanent absorption in the University.</p>

<p>Research Associate- 01</p>

<p>Essential Qualification: M.Sc. in Bioinformatics/Biotechnology from a recognized University/ institute.</p>

<p>Desirable: PhD or Pursuing PhD in the relevant subject(s) or equivalent published work in reputed peer reviewed journals or Advance PG diploma in Bioinformatics courses.</p>

<p>Duties: Creation of database, web designing, maintenance of internet, training of students in Bioinformatics, handling and knowledge of Bioinformatics software tools and technique, conducting Bioinformatics based research and other day to day laboratory work, writing report and scientific papers.</p>

<p>Pay:Rs. 2,00/- + Admissible 10% HRA per month</p>

<p>Age: Below 35 years</p>

<p>Traineeship- 02</p>

<p>Students who have completed Masters Degree in Bioinformatics/Biotechnology or any branch of Life Sciences/Agricultural Sciences/Computer Science to cary out a project work in Bioinformatics.</p>

<p>Desirable: Prior Knowledge of programming languages such as C, JAVA, MySQL is preferable.</p>

<p>Stipend: Rs. 800/- p.m. fixed. Purely temporary for a period of six months.</p>

<p>Studentship: 02</p>

<p>Students pursuing postgraduate degree in Bioinformatics/biotechnology/Agricultural Sciences or any branch of Life Science</p>

<p>Desirable: Prior knowledge of bioinformatics/ programming language is preferable.</p>

<p>Stipend: 800/- p.m. fixed. Purely temporary for a period of six months.</p>

<p>Candidates must send the detailed Biodata via mail/post and bring al the relevant documents in original and one set of attested photocopies of the same at the time of interview. No TA/DA will be paid for attending the interview and candidates have to make their own arrangements.</p>

<p>Last date for receiving application by mail or by post: 16.02.2014</p>

<p>Contact Information:<br />Dr.B.K. Mishra<br />Cordinator BIF,<br />RDAP Department, NEHU, Tura Campus<br />Phone: 91-03651-23107<br />Fax: 91-03651-23953<br />E-mail: drbkm1972@yaho.co.in, birendramishra14@gmail.com</p>

<p>Advertisement: http://www.nehu.ac.in/Advertisements/BIF_TuraAdtvPV_171214.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</guid>
	<pubDate>Tue, 27 Nov 2018 03:38:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38299/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</link>
	<title><![CDATA[Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Deepbinner is a tool for demultiplexing barcoded&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;sequencing reads. It does this with a deep&nbsp;<a href="https://adeshpande3.github.io/adeshpande3.github.io/A-Beginner's-Guide-To-Understanding-Convolutional-Neural-Networks/">convolutional neural network</a>&nbsp;classifier, using many of the&nbsp;<a href="https://towardsdatascience.com/neural-network-architectures-156e5bad51ba">architectural advances</a>&nbsp;that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.</p>
<ul>
<li><span>Reasons to use Deepbinner</span>:
<ul>
<li>To minimise the number of unclassified reads (use Deepbinner by itself).</li>
<li>To minimise the number of misclassified reads (use Deepbinner in conjunction with Albacore demultiplexing).</li>
<li>You plan on running signal-level downstream analyses, like&nbsp;<a href="https://github.com/jts/nanopolish">Nanopolish</a>. Deepbinner can&nbsp;<a href="https://github.com/rrwick/Deepbinner#using-deepbinner-before-basecalling">demultiplex the fast5 files</a>which makes this easier.</li>
</ul>
</li>
<li><span>Reasons to&nbsp;<em>not</em>&nbsp;use Deepbinner</span>:
<ul>
<li>You only have basecalled reads not the raw fast5 files (which Deepbinner requires).</li>
<li>You have a small/slow computer. Deepbinner is more computationally intensive than&nbsp;<a href="https://github.com/rrwick/Porechop">Porechop</a>.</li>
<li>You used a sequencing/barcoding kit other than&nbsp;<a href="https://github.com/rrwick/Deepbinner/blob/master/models">the ones Deepbinner was trained on</a>.</li>
</ul>
</li>
</ul><p>Address of the bookmark: <a href="https://github.com/rrwick/Deepbinner" rel="nofollow">https://github.com/rrwick/Deepbinner</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19597/assistant-professor-at-gauhati-university-guwahati</guid>
  <pubDate>Tue, 16 Dec 2014 01:15:30 -0600</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor at GAUHATI UNIVERSITY, GUWAHATI]]></title>
  <description><![CDATA[
<p>Advt. No.T/2014/4</p>

<p>Ref. No. GU/Estt/T/308(VI)/2014/6451-61</p>

<p>Applications are invited from the Indian citizens for five (5) teaching posts of Assistant Professor (Contractual) under various departments of Gauhati University. Details of the advertisement, other terms and conditions and the application forms are available in the University website www.gauhati.ac.in</p>

<p>Asstt. Professor (Contractual)</p>

<p>    2. M.Sc. Microbiology Course in Botany</p>

<p>    3 1.M.Sc. Microbiology/M.Sc. Botany (Specialization in Microbiology)/M.Sc. Biochemistry (1 post). (Preference will be given to candidates having experience in Biochemistry).</p>

<p>    2.M.Sc. Microbiology/M.Sc. Botany (Specialization in Microbiology)/M.Sc. Biotechnology(1 post). (Preference will be given to candidates having experience in Bioinformatics).</p>

<p>    3.M.Sc. Microbiology/M.Sc. Botany (Specialization in Microbiology)/M.Sc.  Biotechnology(1 post). (Preference will be given to candidates having experience in Microbial Genetics).</p>

<p>As per UGC norms</p>

<p>Pay Band &amp; Academic Grade Pay : (Consolidated pay) : Rs. 21,600/- per month</p>

<p>Application Form : Prescribe application form may download from the G.U. website www.gauhati.ac.in</p>

<p>Last date of receipt of filled-in application is 08.01.2015.</p>

<p>Advertisement: www.gauhati.ac.in/openfile.php?file=Notice1258.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38892/wtdbg2-a-fuzzy-bruijn-graph-approach-to-long-noisy-reads-assembly</guid>
	<pubDate>Mon, 04 Feb 2019 04:53:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38892/wtdbg2-a-fuzzy-bruijn-graph-approach-to-long-noisy-reads-assembly</link>
	<title><![CDATA[wtdbg2: A fuzzy Bruijn graph approach to long noisy reads assembly]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output.&nbsp;</span></p>
<pre>./wtdbg2 -x rs -g 4.6m -t 16 -i reads.fa.gz -fo prefix
./wtpoa-cns -t 16 -i prefix.ctg.lay.gz -fo prefix.ctg.fa</pre><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>