<?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/31139?offset=1670</link>
	<atom:link href="https://bioinformaticsonline.com/related/31139?offset=1670" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/10459/associate-professor-bio-informatics-at-university-of-allahabad-in-allahabad</guid>
  <pubDate>Wed, 07 May 2014 00:26:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[Associate Professor - Bio-Informatics at University of Allahabad in Allahabad]]></title>
  <description><![CDATA[
<p>No of vacancies: 01</p>

<p>Pay scale: Pay Band of Rs. 37400-67000 with AGP of Rs. 9000.</p>

<p>i. Educational Qualification: Good academic record with a Ph.D. Degree in the concerned/allied/relevant disciplines.</p>

<p>ii. A Master's Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).</p>

<p>iii. A minimum of eight years of experience of teaching and/or research in an academic/research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/industry excluding the period of Ph.D. research with evidence of published work and a minimum of 5 publications as books and/or research/policy papers.</p>

<p>iv. Contribution to educational innovation, design of new curricula and courses, and technology - mediated teaching learning process with evidence of having guided doctoral candidates and research students.</p>

<p>v. A minimum score as stipulated in the Academic Performance Indicator (API) based Performance Based Appraisal System (PBAS), set out in UGC Regulation.</p>

<p>Download application form from website: http://www.allduniv.ac.in/</p>

<p>Send your application to the Registrar, University of Allahabad, Allahabad-211002 (U.P.) on or before 30th April 2014</p>

<p>For more details: http://www.allduniv.ac.in/images/adv/backlog/advt-details.pdf OR http://www.allduniv.ac.in/images/news/extension-notice.pdf</p>

<p>Last Apply Date: 30 May 2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</guid>
	<pubDate>Wed, 22 Aug 2018 11:05:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</link>
	<title><![CDATA[LRCstats: a tool for evaluating long reads correction methods]]></title>
	<description><![CDATA[<p><span>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</span></p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/10664/dna-replication-process-3d-animation</guid>
	<pubDate>Sat, 10 May 2014 04:41:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/10664/dna-replication-process-3d-animation</link>
	<title><![CDATA[DNA Replication Process [3D Animation]]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/27TxKoFU2Nw" frameborder="0" allowfullscreen></iframe>See an organised list of all the animations: http://doctorprodigious.wordpress.com/hd-animations/]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10748/bioinformatics-phd-at-cuk-kerala</guid>
  <pubDate>Sat, 10 May 2014 20:21:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics PhD at CUK Kerala]]></title>
  <description><![CDATA[
<p>Applications are invited from highly motivated students (UGC-CSIR-JRF) with a background in Genomics/ Biotechnology/ Molecular Microbiology/ Biochemistry and Bioinformatics to pursue research leading to Ph.D. in the following areas;</p>

<p>    1. Cancer Genomics</p>

<p>    2. Microbial Genetics and Metagenomics</p>

<p>    3. Human Infective Diseases</p>

<p>    4. Computational Drug Design</p>

<p>Interested candidates may apply to Dr. Ranjith N. Kumavath, Assistant Professor &amp; Head, Department of Genomic Science, School of Biological Sciences, Central University of Kerala, Padannakad (PO), Nileshwar, Kasaragod-671328,Kerala. Email: RNkumavath@gmail.com</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/bookmarks/view/10925/a-brief-bioinformatics-tutorial</guid>
	<pubDate>Wed, 21 May 2014 12:50:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10925/a-brief-bioinformatics-tutorial</link>
	<title><![CDATA[A Brief Bioinformatics Tutorial]]></title>
	<description><![CDATA[<p>This is about how to use a computer to find what is known about a gene of interest and also how to get new insights about it.</p>
<p>The tutorial is divided in three main parts:</p>
<ul>
<li>In the <strong>Sequence </strong>part, you will see how to look efficiently for a particular protein sequence, how to blast it against the database of your choice to find homologues, how to perform a multiple alignment of the homologues you've selected and how to edit this alignment.</li>
<li>The <strong>Structure </strong>part is about molecular visualization, homology modeling and structural domain prediction.</li>
<li>In the <strong>Function </strong>part, you will be introduced to you 3 useful servers to investigate the function of a protein. i.e. finding interactors, co-expressed genes, see a phylogenetic profile, easily access papers citing your gene etc ...</li>
</ul>
<p>During all the three parts, we will use the <em>S. cerevisiae </em>VPS36 protein as an example.</p><p>Address of the bookmark: <a href="http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html" rel="nofollow">http://www.mrc-lmb.cam.ac.uk/rlw/text/bioinfo_tuto/introduction.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 09:30:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</link>
	<title><![CDATA[TULIP - The Uncorrected Long read Itegration Pipeline]]></title>
	<description><![CDATA[<p>#Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel)</p>
<p>TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.&nbsp;<br>Tulipseed takes as input alignments files of long reads to sparse short seeds, and outputs a graph and scaffold structures. Tulipbulb adds long read sequencing data to these.</p>
<p>&nbsp;</p>
<p>https://github.com/Generade-nl/TULIP</p><p>Address of the bookmark: <a href="https://github.com/Generade-nl/TULIP" rel="nofollow">https://github.com/Generade-nl/TULIP</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11035/bioinformatics-jrfsrf-position-at-nii</guid>
  <pubDate>Sun, 25 May 2014 16:54:04 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/SRF position at NII]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF IMMUNOLOGY, NEW DELHI-110067</p>

<p>Applications are invited for the position of Senior Research Fellow for the following time-bound sponsored project as per the details given below:</p>

<p>1. BTIS project on, “Bioinformatics Center-National Infrastructural Facility in the Area of Immunology” funded by DBT</p>

<p>Senior Research Fellow (P) (One Position only)</p>

<p>Dr. Debasisa Mohanty<br />Staff Scientist-VI<br />deb@nii.res.in</p>

<p>Qualifications: M.Sc in Biological Sciences or Biotechnology with at least 04 years of Research experience in Bioinformatics or computational Biology after the master’s degree is essential.</p>

<p>Emoluments: The selected candidates will draw consolidated emoluments as per Institute Rules, depending upon qualifications &amp; experience</p>

<p>Rs. 18,000/- per month consolidated plus 30% HRA if Leading to Ph.D/NET/GATE Qualified otherwise Rs. 14,000/- per month + 30% HRA.</p>

<p>Job description: The candidate should be well versed in programming in PERL/C++/HTML/CGI, web server and portal development, computational analysis of<br />protein structure &amp; function, molecular dynamics simulations and use of high performance computing systems.</p>

<p>GENERAL TERMS AND CONDITIONS:-</p>

<p>1. The candidates selected for the above posts will be on contract for one year or duration of the project whichever is shorter, at a time.<br />2. No hostel/ housing facility will be provided.<br />3. Number of posts may vary and shall be need based. Advertisement is no commitment.<br />4. Applicants may clearly mention the category they belong to i.e. SC/ST/OBC/PH and attach documentary proof of the same.<br />5. No TA/DA will be paid for attending the interview, if called for.<br />6. Apart from sending application in the prescribed format given below, candidates should send complete Curriculum Vitae along with the names of three referees. Curriculum Vitae should contain details of the experimental expertise.</p>

<p>HOW TO APPLY Interested candidates may apply directly, STRICTLY IN THE PRESCRIBED FORMAT GIVEN BELOW, through e-mail, to the Investigator of the project, clearly indicating the name of the project along with their complete C.V., e-mail id, fax numbers, telephone numbers. Only Short listed candidates will be called for interview and they required to submit attested copies of all their certificates and a Demand Draft of Rs 100/- drawn on Canara Bank or Indian Bank payable at Delhi/New Delhi in favour of the Director, NII (SC / ST and PH candidates are exempted subject to submission of documentary proof), at the time of interview.</p>

<p>LAST DATE OF RECEIPT OF APPLICATIONS: 06th June, 2014</p>

<p>Advertisement</p>

<p>www1.nii.res.in/sites/default/files/projectappointment-Dr.Mohanty-6June2014.pdf</p>
]]></description>
</item>

</channel>
</rss>