<?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/29628?offset=640</link>
	<atom:link href="https://bioinformaticsonline.com/related/29628?offset=640" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19695/china-university-of-macau-phd-position-2015-in-bioinformatics-computer-science</guid>
  <pubDate>Mon, 22 Dec 2014 00:12:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[China University of Macau PhD Position 2015 in Bioinformatics, Computer Science]]></title>
  <description><![CDATA[
<p>The Computational Biology and Bioinformatics Group at the University of Macau is inviting applications for PhD Position. Applicants will work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems. The duration of this PhD position is 2-3 years, starting in August 2015. Remuneration paid to candidate is MOP 11000-14000/month (~USD 1375-1750/month). The applications should be submitted before March 2015.</p>

<p>Study Subject(s): PhD position is award in the field of Bioinformatics/Computer Science.<br />Course Level: Position is available for pursuing PhD degree level at the University of Macau.<br />Scholarship Provider: University of Macau<br />Scholarship can be taken at: China</p>

<p>Eligibility: The ideal candidate would be a master degree holder in Bioinformatics or related disciplines with knowledge in Medical sciences or Life sciences (with GPA of at least 3.0 on a 4-point scale or equivalent) . Knowledge in programming (C and C++) and Linux scripting are necessary; experience in molecular docking, molecular dynamics simulations or molecular modeling is an advantage. The candidate should be fluent in spoken and written English; preference will be given to applicants with good publication records in relevant areas.</p>

<p>Scholarship Open for International Students: Researchers from China can apply for this PhD position.</p>

<p>Scholarship Description:</p>

<p>The Computational Biology and Bioinformatics Group at the University of Macau is looking for a motivated PhD student in Bioinformatics or Computer Science to work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems.</p>

<p>Number of award(s): There is only one PhD position available.</p>

<p>Duration of award(s): The duration of this PhD position is 2-3 years.</p>

<p>What does it cover? Remuneration paid to candidate is  MOP 11000-14000/month (~USD 1375-1750/month).</p>

<p>Selection Criteria: Not Known</p>

<p>Notification: Not Known</p>

<p>How to Apply: Send your current CV, your academic transcripts, a letter of motivation and research interests, two letters of recommendations from academic faculty to Dr. Shirley Siu at shirleysiu[at]umac.mo before March 2015.</p>

<p>Scholarship Application Deadline: The applications should be submitted before March 2015.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19811/jnu-neurosciencesystems-biologymathematical-modeling-jrf-vacancies</guid>
  <pubDate>Fri, 26 Dec 2014 11:22:20 -0600</pubDate>
  <link></link>
  <title><![CDATA[JNU Neuroscience/Systems Biology/Mathematical modeling JRF Vacancies]]></title>
  <description><![CDATA[
<p>School of Computational and Integrative Sciences<br />Jawaharlal Nehru University<br />New Delhi 110067</p>

<p>Recruitment for Project</p>

<p>Applications were invited from the citizens of India for filling up the following temporary position for the CSIR sponsored Fellowship in the School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi 110067. This position is temporary for a period of two and half years or tenable only for the duration of the project. The requisite qualifications &amp; experience are given below.</p>

<p>Project Title : "Understanding Complex dynamics and Information processing in Brain Networks"<br />Funding Agency : CSIR</p>

<p>Principal Investigator : Dr. R.K. Brojen Singh</p>

<p>Position : Junior Research Fellow(One post)</p>

<p>Salary : As per CSIR rules and guidelines for JRF.</p>

<p>Qualifications &amp; Experience : M.Sc. in Physics/Mathematics/Biology/B.Tech. In Eng. Physics/Comp. Sc. and desirable CSIR-UGC NET Qualified. Candidates should also have at least one years research experience after M. Sc./B.Tech. in works related to Neuroscience/Mathematical modeling.</p>

<p>Candidates possessing requisite qualifications may apply either on plain paper stating the project title along with CV and send to the following address or send as email attachment (pdf or word format) so as to reach on or before 8 January, 2014.</p>

<p>Dr. R.K. Brojen Singh<br />School of Computational and Integrative Sciences<br />Jawharlal Nehru University<br />New Delhi 110067<br />Email: brojen@jnu.ac.in, brojen@mail.jnu.ac.in</p>
]]></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/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</guid>
	<pubDate>Thu, 31 Jan 2019 05:12:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</link>
	<title><![CDATA[nQuire: A statistical framework for ploidy estimation using NGS short-read data]]></title>
	<description><![CDATA[<p>nQuire implements a set of commands to estimate ploidy level of individuals from species, where recent polyploidization occurred and intraspecific ploidy variation is observed. Specifically, nQuire uses next-generation sequencing data to distinguish between diploids, triploids and tetraploids, on the basis of frequency distributions at variant sites where only two bases are segregating.</p>
<p>For more background see also the publication at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-018-2128-z">BMC Bioinformatics</a>.</p>
<p>https://github.com/clwgg/nQuire</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuire" rel="nofollow">https://github.com/clwgg/nQuire</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/20015/illumina-smartphone-chip</guid>
	<pubDate>Tue, 30 Dec 2014 23:19:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/20015/illumina-smartphone-chip</link>
	<title><![CDATA[Illumina Smartphone Chip !!!]]></title>
	<description><![CDATA[<p>Illumina, the company that claims it brought human genome sequencing down to $1000 prices, has now turned its attention to a consumer product - a chip that you can plug into your smartphone and have it read your genetic information.<br /><br />The biggest challenge ahead of Illumina is simplifying the process of genetic sequencing. Currently, Illumina&rsquo;s DNA sequencers are gigantic machines that use techinques like colorimetry to work, but while the core technology is computational, it takes some 30 steps to extract genetic data and run it through. This process will likely have to be hugely simplified on mobile devices, given the fact that some studies require extracting 10 mililiters of blood. Illumina researchers are also working on finding the optimal technology for this on-chip DNA sequencing - be it electrical, optical, or other.<br /><br />Illumina is one of the most prominent names in genetics, often said to be the Intel of genetic sequencing, as just like Intel it provides the algorithms, the processing brain that runs a DNA reading task.<br /><br />In other recent smartphone-related biotech news, drug company Pfizer launched its REMOTE project, a new type of clinical trial that does not require going to a hospital for checks - targeted at patients with overactive bladder problems, the FDA-approved REMOTE project allowed to gather data from patients from over 10 states remotely, via mobile devices.<br /><br /></p><p>This is indeed the Illumina answer to Apple's Health app, HealthBook, Google HealthFit.</p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</guid>
	<pubDate>Fri, 24 Jan 2020 06:04:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</link>
	<title><![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]></title>
	<description><![CDATA[<p><span>gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser. </span></p>
<p><span>gapFinisher can fill gaps in draft genomes quickly and reliably.</span></p><p>Address of the bookmark: <a href="https://github.com/kammoji/gapFinisher" rel="nofollow">https://github.com/kammoji/gapFinisher</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>