<?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/27973?offset=1370</link>
	<atom:link href="https://bioinformaticsonline.com/related/27973?offset=1370" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19249/bioinformatics-jrfrasrf-position-at-panjab-university</guid>
  <pubDate>Wed, 19 Nov 2014 20:19:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/RA/SRF position at PANJAB UNIVERSITY]]></title>
  <description><![CDATA[
<p>CENTRE FOR SYSTEMS BIOLOGY &amp; BIOINFORMATICS<br />UIEAST, PANJAB UNIVERSITY, CHANDIGARH</p>

<p>Applications are invited along with complete bio-data and attested copies of certificates of qualifications, experience etc. for the one post of Research Fellow and one post of Program Assistant under PURSE Grant of the University in Centre for Systems Biology &amp; Bioinformatics, UIEAST, Panjab University, Chandigarh which is tenable till the period of<br />the project.</p>

<p>Essential Qualification</p>

<p>For Research Fellow:-</p>

<p>M.Sc. in Systems Biology and Bioinformatics / Life Sciences with minimum 55% marks.</p>

<p>Preference will be given to NET/GATE/ICMR qualified candidates without fellowship however, candidates who have cleared the Panjab University Ph.D. entrance test in Systems Biology &amp; Bioinformatics will also be eligible.</p>

<p>For Program Assistant:-</p>

<p>The candidate must have M.Sc./M.Tech/MCA/PGDCA in Computer Science and must be able to handle LAN, Linex. Preference will be given to the candidate having experience in<br />System Administration.</p>

<p>Emoluments</p>

<p>For Research Fellow Rs. 12,500/- per month (Fixed)<br />For Program Assistant Rs. 12,500/- per month (Fixed)</p>

<p>Applications should be reach on or before 19-11-2014 in the office of the undersigned.</p>

<p>Interview will be held on 21-11-2014 in the office of the Coordinator, Centre for Systems Biology &amp; Bioinformatics, South Campus, Block-3, Sector-25, Panjab University, Chandigarh. No TA/DA will be paid.</p>

<p>Advertisement:</p>

<p>http://jobs.puchd.ac.in/includes/jobs/2014/20141110143634-Advertisement.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19541/bioinformatics-sub-dic-dic</guid>
  <pubDate>Fri, 12 Dec 2014 21:14:57 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics SUB DIC (DIC)]]></title>
  <description><![CDATA[
<p>Project Title BIOINFORMATICS SUB DIC (DIC)</p>

<p>Reference Number IIT/SRIC/R/DIC/2014/314, DATED 28thNovember, 2014</p>

<p>Temporary Position(s)</p>

<p>i) Junior/ Senior Project Officer (1)<br />ii) Junior Project Assistant (2)</p>

<p>Consolidated Compensation</p>

<p>i) Rs.16,000/- to Rs.18,000/- p.m. (depending on qualification &amp; experience)<br />ii) Rs.8,000/- to Rs.10,000/- p.m. (depending on qualification &amp; experience)</p>

<p>Coordinator / PI Dr. Sudip K. Ghosh, Dept of Biotechnology.</p>

<p>Department / Centre / School Dept of Biotechnology </p>

<p>Qualifications &amp; Experience</p>

<p>(i) M. Sc in any branch of Life Sciences with experience in Molecular  Biology/Genetics/Biochemistry preferably a Post Graduate diploma in Bioinformatics or two years working experience in bioinformatics (Minimum 60% marks starting from matriculation examination).</p>

<p>(ii) B. Sc. /B.A. /B. Com/Diploma in Management or Computer Science. Knowledge in computer software will be preferred (minimum 50% marks starting from matriculation examination).</p>

<p>More Information</p>

<p>Interested eligible persons may apply on plain paper, giving full bio-data along with attested copies of testimonials to the undersigned on or before 11thDecember, 2014. </p>

<p>Sponsor DBT, NEW DELHI</p>

<p>Last Date 11 Dec 2014</p>

<p>Application Fee Demand Draft for Rs.50/- (Not for female candidates) drawn in favour of IIT Kharagpur payable at Kharagpur</p>

<p>Advertisement: www.iitkgp.ac.in/topfiles/sric_job_details.php?serial=2826</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42139/mixtures-a-novel-tool-for-bacterial-strain-reconstruction-from-reads</guid>
	<pubDate>Fri, 21 Aug 2020 08:23:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42139/mixtures-a-novel-tool-for-bacterial-strain-reconstruction-from-reads</link>
	<title><![CDATA[mixtureS: a novel tool for bacterial strain reconstruction from reads]]></title>
	<description><![CDATA[<div>
<p>mixtureS that can de novo identify bacterial strains from shotgun reads of a clonal or metagenomic sample, without prior knowledge about the strains and their variations. Tested on 243 simulated datasets and 195 experimental datasets, mixtureS reliably identified the strains, their numbers and their abundance. Compared with three tools, mixtureS showed better performance in almost all simulated datasets and the vast majority of experimental datasets.</p>
</div>
<div>
<div>Availability</div>
<p>The source code and tool mixtureS is available at&nbsp;<a href="http://www.cs.ucf.edu/~xiaoman/mixtureS/" target="_blank">http://www.cs.ucf.edu/&tilde;xiaoman/mixtureS/</a>.</p>
</div><p>Address of the bookmark: <a href="http://www.cs.ucf.edu/~xiaoman/mixtureS/" rel="nofollow">http://www.cs.ucf.edu/~xiaoman/mixtureS/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19580/internship-program-for-bioinformatics-biotechnology-mba-mca-no-of-vacancy-5</guid>
  <pubDate>Mon, 15 Dec 2014 08:11:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[Internship Program for Bioinformatics / Biotechnology / MBA / MCA (No. Of Vacancy: 5)]]></title>
  <description><![CDATA[
<p>ArrayGen is offering an Internship Program for Post graduate Bioinformatics / Biotechnology / MBA / MCA students and professionals. ArrayGen Technologies provide an excellent opportunity to gain research experience and explore if a scientific career is right for you. Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis or marketing or software development. Applications are accepted throughout the year. Accepted students will be notified through email.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44171/hairsplitter-assembling-long-reads-in-an-unknown-number-of-haplotypes</guid>
	<pubDate>Wed, 07 Dec 2022 00:13:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44171/hairsplitter-assembling-long-reads-in-an-unknown-number-of-haplotypes</link>
	<title><![CDATA[HairSplitter: assembling long reads in an unknown number of haplotypes]]></title>
	<description><![CDATA[<p>Pros and cons of HairSplitter Limitations of HairSplitter:</p>
<p>Not very fast: it re-polishes the whole assembly&nbsp;</p>
<p>Limited in the number of haplotypes</p>
<p>Strengths of HairSplitter:</p>
<p>Very modular, can be used with any assembler</p>
<p>Naive: makes no assumption on ploidy, parameter-free</p>
<p>Safe: won&rsquo;t artificially duplicate contigs</p>
<p>&nbsp;</p>
<p>HairSplitter splits collapsed assemblies from &ldquo;draft&rdquo; assemblies obtained by any means</p>
<p>HairSplitter can recover haplotypes and distinguish repeated elements</p>
<p>Only needs sequencing reads, potentially error-prone</p>
<p>HairSplitter splits collapsed assemblies from &ldquo;draft&rdquo; assemblies obtained by any means</p>
<p>HairSplitter can recover haplotypes and distinguish repeated elements</p>
<p>Only needs sequencing reads, potentially error-prone</p>
<p>Not really available yet (github.com/RolandFaure/HairSplitter)</p>
<p>https://hal.archives-ouvertes.fr/hal-03864075/file/RolandFaure_presentation_SeqBIM_2022.pdf</p><p>Address of the bookmark: <a href="https://hal.archives-ouvertes.fr/hal-03817928/document" rel="nofollow">https://hal.archives-ouvertes.fr/hal-03817928/document</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19792/irishgrid-irish-grid-mapping-system</guid>
	<pubDate>Fri, 26 Dec 2014 07:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19792/irishgrid-irish-grid-mapping-system</link>
	<title><![CDATA[irishgrid: Irish Grid Mapping System]]></title>
	<description><![CDATA[<p>Perl module for creating geographic 10km-square maps using either SVG or PNG (with GD library) output format.</p>
<p>Originally design to map the location of objects in a 10 km map IrishGrid includes:</p>
<ul>
<li>native support of the Irish Grid System (see <a href="http://www.osi.ie/">http://www.osi.ie/</a>)</li>
<li>optimize for speed (there's as less as possible data to conversion)</li>
<li>customized color functions</li>
</ul>
<p>https://code.google.com/p/irishgrid/downloads/detail?name=irishgrid.pl</p><p>Address of the bookmark: <a href="https://code.google.com/p/irishgrid/" rel="nofollow">https://code.google.com/p/irishgrid/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</guid>
	<pubDate>Tue, 07 Nov 2017 04:36:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</link>
	<title><![CDATA[Meraculous: De Novo Genome Assembly with Short Paired-End Reads]]></title>
	<description><![CDATA[<p><span>We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast&nbsp;</span><em>Pichia stipitis</em><span>. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer than 269 kilobases. Incorporating fosmid ends recovers entire chromosomes. Meraculous relies on an efficient and conservative traversal of the subgraph of the&nbsp;</span><em>k</em><span>-mer (deBruijn) graph of oligonucleotides with unique high quality extensions in the dataset, avoiding an explicit error correction step as used in other short-read assemblers. A novel memory-efficient hashing scheme is introduced. The resulting contigs are ordered and oriented using paired reads separated by &sim;280 bp or &sim;3.2 kbp, and many gaps between contigs can be closed using paired-end placements. Practical issues with the dataset are described, and prospects for assembling larger genomes are discussed.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23536/teaching-assistant-at-svims</guid>
  <pubDate>Fri, 31 Jul 2015 10:15:16 -0500</pubDate>
  <link></link>
  <title><![CDATA[Teaching Assistant at SVIMS]]></title>
  <description><![CDATA[
<p>Eligible candidates are invited for a walk-in-interview for recruitment of Teaching Assistant in the Department of Bioinformatics on 8.08.2015 at 10 A.M. in the Committee Hall, SVIMS, Tirupati. The candidates have to attend with all original certificates of qualification, experience on the date of interview. The engagement will be made purely on adhoc basis for a period of 6 months and it can be terminated at any time without notice or without assigning any reason thereof. This is purely an adhoc appointment and the candidate will not have any right to claim permanent benefits of any kind.</p>

<p>1. Remuneration : Rs. 12000/- per month (consolidated)</p>

<p>2. Qualification : M.Sc./M.Tech. Bioinformatics (preference will be given to the candidates with BINC / NET / GATE / Bioinformatics DBT-Traineeship / Studentship and teaching experience)</p>

<p>3. Place of work : Department of Bioinformatics, SVIMS, Tirupati</p>

<p>4. No. of Position : One</p>

<p>Terms and conditions:</p>

<p>1. Candidates are required to submit the Biodata, attested copies of relevant certificates in support of their age, educational qualification, experience etc., before the interview committee, SVIMS University, Tirupati.<br />2. No TA / DA will be paid for attending the interview.<br />3. Interim enquiries will not be entertained.<br />4. The maximum age limit for Teaching Assistant is 34 years as on 8th August, 2015.<br />5. The tenure of will be further extended subject to performance of the incumbent.</p>

<p>Advertisement: http://svimsbic.org/Teaching_Assistant_B.I._2015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</guid>
	<pubDate>Tue, 01 Jan 2019 12:01:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</link>
	<title><![CDATA[HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning]]></title>
	<description><![CDATA[<p><span>HECIL&mdash;Hybrid Error Correction with Iterative Learning&mdash;a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.&nbsp;</span></p>
<p><span><span>HECIL&rsquo;s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.</span></span></p><p>Address of the bookmark: <a href="https://github.com/NDBL/HECIL" rel="nofollow">https://github.com/NDBL/HECIL</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>