<?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/29384?offset=1500</link>
	<atom:link href="https://bioinformaticsonline.com/related/29384?offset=1500" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21022/ra-bioinformatics-at-tezpur-university</guid>
  <pubDate>Fri, 06 Feb 2015 04:11:23 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at TEZPUR UNIVERSITY]]></title>
  <description><![CDATA[
<p>Walk-in-interview will be held on 23 February, 2015 at 11.00 a.m. for the following temporary positions in the DBT (U-EXCEL) sponsored project entitled “Sequencing genomes of some bacteria that invade/resides in tomato plant” under the Principal Investigator Dr. Suvendra Kumar Ray, Department of Molecular Biology and Biotechnology, Tezpur University.</p>

<p>Interested candidates may appear before the interview board on 23 February, 2015 at the Office of the Head, Department of Molecular Biology &amp; Biotechnology, Tezpur University with original documents and photocopies of marks sheets, certificates, testimonials, caste certificate (if applicable), experience certificate and a copy of curriculum vitae (CV) duly signed by the candidate.</p>

<p>Position: One (01) Research Associate.</p>

<p>Educational Qualification: Candidates having Ph.D. degree or submitted thesis in any topic of Life Science Areas (Zoology, Botany, Microbiology, Biotechnology etc.) along with knowledge of gene and protein sequence analysis may apply.</p>

<p>Remuneration: Rs. 22,000/- (Rupees twenty two thousand) only + 10% HRA as admissible per month for the first year and Rs. 23,000/- (Rupees twenty three thousand) only + 10% HRA as admissible per month for the second year.</p>

<p>Age: Candidate preferably below the age of 40 years who have obtained a doctorate (Ph.D.) degree from a recognized University.</p>

<p>Upper age limit may be relaxed up to 5 years in the case of candidates belonging SC/ST/OBC/Women and physically challenged.</p>

<p>Position: One (01) Project Assistant.</p>

<p>Educational Qualification: B.Sc./B.Tech./B.E./B.Pharma in any branch with minimum 55% mark in the qualifying examinations and minimum 50 % mark in 10th and 10+2 Science examinations.</p>

<p>Remuneration: Rs. 8,000/- (Rupees eight thousand) only per month (consolidated). Age: Candidate should not be more than 28 years of age on the date of interview. Upper age limit may be relaxed up to 5 years in the case of candidate belonging to SC/ST/OBC/Women/Physically Challenged.</p>

<p>Duration: One year or till completion of the project, whichever is earlier. N.B. No TA/DA will be paid to the candidates for attending the interview.</p>

<p>For further information contact – Dr. Suvendra Kumar Ray, Associate Professor Email: suven@tezu.ernet.in Department of Molecular Biology and Biotechnology Tezpur University Sd/- Dean, Research &amp; Development Tezpur University</p>

<p>Advertisement: http://www.tezu.ernet.in/ProjectWalkin/Advt-SKR2-5342-A.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</guid>
	<pubDate>Tue, 12 Dec 2017 17:23:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</link>
	<title><![CDATA[MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)]]></title>
	<description><![CDATA[<p><span>MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a&nbsp;</span><em>k</em><span>-mer based&nbsp;</span><a href="https://en.wikipedia.org/wiki/Jaccard_index">Jaccard similarity</a><span>&nbsp;using a combination of&nbsp;</span><a href="http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p76-schleimer.pdf">Winnowing</a><span>&nbsp;and&nbsp;</span><a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a><span>. This is then converted to an estimate of sequence identity using the&nbsp;</span><a href="http://mash.readthedocs.org/">Mash</a><span>&nbsp;distance. An appropriate&nbsp;</span><em>k</em><span>-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.</span></p><p>Address of the bookmark: <a href="https://github.com/marbl/MashMap" rel="nofollow">https://github.com/marbl/MashMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21095/ra-walk-in-interview-actrec</guid>
  <pubDate>Mon, 09 Feb 2015 01:06:16 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA WALK-IN-INTERVIEW @ ACTREC]]></title>
  <description><![CDATA[
<p>No. ACTREC/Advt./ 7 /2015</p>

<p>Title of the Project<br />Research Associate<br />(One position)<br />DBTs Biotechnology/Bioinformatics training centre<br />PI Dr. Ashok Varma	</p>

<p>Duration of the Project Six Months from the date of appointment, can be extended further for six month.</p>

<p>Date &amp; Time: 17th February, 2015 at 10.00 a.m.</p>

<p>Venue: Meeting Room, 3rd floor, Khanolkar Shodhika, ACTREC</p>

<p>Essential Qualifications and Experience:</p>

<p>Ph.D. Degree in Basic Sciences from recognized University. Research experience in Bioinformatics or on gene cloning, protein purification, and crystallization.</p>

<p>*M.Sc. degree obtained after a one year course will not be considered.</p>

<p>Selected candidate will have to join at the earliest.</p>

<p>Consolidated Salary: Rs.28,600/- p.m. {Rs.22,000/- + 30% HRA}</p>

<p>The work progress of the candidate will be monitored and extension after 6 months will depend on satisfactory progress of the work.</p>

<p>Candidates fulfilling these requirements should pre-register by sending their application in the prescribed format with recent CV and contact details of 2 referees by e-mail to ‘program.office@actrec.gov.in’ latest by 17.00 hrs on 12-02-2015.<br />The interviews would be held on 17th February, 2015 and will be only for the pre-registered candidates. Candidates should report between 09.30 to 10.00 a.m. in Steno Pool, 3rd floor, Khanolkar Shodhika, ACTREC, Kharghar, Navi Mumbai.<br />No T.A./D.A. will be admissible for attending the interview.</p>

<p>At the time of Interview the candidate should bring original certificates along with CV with contact details of 2 referees and submit the photocopies (attested) of the certificates, with a recent passport size photograph.</p>

<p>All correspondence should be strictly made only to ‘program.office@actrec.gov.in’ as indicated.</p>

<p>Advertisement: www.actrec.gov.in/data%20files/2015/AV-RA-DBT-28-1-15.docx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 04 May 2018 19:16:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]></title>
	<description><![CDATA[<p><span>Flye is a de novo assembler for long and noisy reads, such as those produced by PacBio and Oxford Nanopore Technologies. The algorithm uses an A-Bruijn graph to find the overlaps between reads and does not require them to be error-corrected. After the initial assembly, Flye performs an extra repeat classification and analysis step to improve the structural accuracy of the resulting sequence. The package also includes a polisher module, which produces the final assembly of high nucleotide-level quality.</span></p><p>Address of the bookmark: <a href="https://github.com/fenderglass/Flye" rel="nofollow">https://github.com/fenderglass/Flye</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21242/summer-intern-research-bioinformatics</guid>
  <pubDate>Mon, 16 Feb 2015 12:26:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Summer Intern - Research Bioinformatics]]></title>
  <description><![CDATA[
<p>Be proficient in LINUX, know perl or python, understand biology and Next Generation Sequencing.<br />The intern will port Agile Assay Design pipelines into Galaxy.<br />The intern will also learn to develope his/her own bioinformatics pipelines for PCR or NGS data analysis.</p>

<p>Who you are<br />You’re someone who wants to influence your own development. You’re looking for a company where you have the opportunity to pursue your interests across functions and geographies. Where a job title is not considered the final definition of who you are, but the starting point.</p>

<p>Qualifications:<br />Major: Bioinformatcis or biology major who is interested and wants to learn Biocomputing, At least 2 years of college.<br />Basic knowledge of LINUX and programming, e.g., perl, python, XML.</p>

<p>More at http://www.roche.com/careers/jobs/jobsearch/job.htm?id=E-00437679&amp;locale=en&amp;title=Summer%20Intern%20-%20Research%20Bioinformatics</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</guid>
	<pubDate>Wed, 23 May 2018 06:54:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36739/blasr-mapping-single-molecule-sequencing-reads-using-basic-local-alignment-with-successive-refinement-blasr-theory-and-application</link>
	<title><![CDATA[BlasR Mapping single molecule sequencing reads using Basic Local Alignment with Successive Refinement (BLASR): Theory and Application,]]></title>
	<description><![CDATA[<p><span>BLASR (Basic Local Alignment with Successive Refinement) for mapping Single Molecule Sequencing (SMS) reads that are thousands to tens of thousands of bases long with divergence between the read and genome dominated by insertion and deletion error.</span></p>
<p>Here is how I use the blasr to align PacBio reads to the contigs (target.fasta). The &ldquo;target.fasta.sa&rdquo; is the suffix array from &ldquo;target.fasta&rdquo; generated by sawriter.</p>
<blockquote>
<p>blasr query.fa ./target.fasta -sa ./target.fasta.sa -bestn 40 -maxScore -500 -m 4 -nproc 24 -out target.m4 -maxLCPLength 15</p>
</blockquote>
<p>the output format option &ldquo;-m 4&Prime; generate the alignment coordinate. Not fully documented, but I can explain that to you.&nbsp;</p>
<p>I use a 24 cores / 48G ram server for the alignment. It took about 2 to 3 hours aligning 3G PacBio Reads to 10^6 sequences of short read contigs with a mean 3.5kbp length.</p><p>Address of the bookmark: <a href="http://bix.ucsd.edu/projects/blasr/" rel="nofollow">http://bix.ucsd.edu/projects/blasr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21436/jrf-bioinformatics-iisr-kozhikode</guid>
  <pubDate>Tue, 24 Feb 2015 08:44:17 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics @ IISR, Kozhikode]]></title>
  <description><![CDATA[
<p>JRF Bioinformatics Jobs recruitment in Indian Institute of Spices Research on temporary basis</p>

<p>Name of the Scheme : Distributed Information Sub Centre – DISC</p>

<p>Qualifications :  M.Sc/ B Tech in Bioinformatics with NET/GATE or M Tech in Bioinformatics</p>

<p>Number of posts : One</p>

<p>Emoluments : Rs. 25,000/-</p>

<p>Upper age limit : 35 years for Men &amp; 40 years for Women as on date of Interview<br />How to apply</p>

<p>Date of Interview : 12-03-2015 at 10.00 AM. All relevant certificates (in original) and bio data, No objection certificate in case he/she is employed elsewhere and experience certificate in original (if any) need to be produced at the time of interview.</p>

<p>More at http://spices.res.in/index.php?option=com_content&amp;view=article&amp;id=263</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36895/npscarf-real-time-scaffolder-using-spades-contigs-and-nanopore-sequencing-reads</guid>
	<pubDate>Mon, 11 Jun 2018 05:14:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36895/npscarf-real-time-scaffolder-using-spades-contigs-and-nanopore-sequencing-reads</link>
	<title><![CDATA[npScarf: real-time scaffolder using SPAdes contigs and Nanopore sequencing reads]]></title>
	<description><![CDATA[npScarf (jsa.np.npscarf) is a program that connect contigs from a draft genomes to generate sequences that are closer to finish. These pipelines can run on a single laptop for microbial datasets. In real-time mode, it can be integrated with simple structural analyses such as gene ordering, plasmid forming.<p>Address of the bookmark: <a href="http://japsa.readthedocs.io/en/latest/tools/jsa.np.npscarf.html" rel="nofollow">http://japsa.readthedocs.io/en/latest/tools/jsa.np.npscarf.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/21444/a-guide-for-complete-r-beginners-installing-r-packages</guid>
	<pubDate>Tue, 24 Feb 2015 20:23:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/21444/a-guide-for-complete-r-beginners-installing-r-packages</link>
	<title><![CDATA[A guide for complete R beginners :- Installing R packages]]></title>
	<description><![CDATA[<p>Part of the reason R has become so popular is the vast array of packages available at the <a href="http://cran.r-project.org/" target="_blank">cran</a> and <a href="http://www.bioconductor.org/" target="_blank">bioconductor</a> repositories. In the last few years, the number of packages has grown <a href="http://blog.revolutionanalytics.com/2010/09/what-can-other-languages-learn-from-r.html" target="_blank">exponentially</a>!</p><p>This is a short post giving steps on how to actually install R packages. Let&rsquo;s suppose you want to install the <a href="http://had.co.nz/ggplot2/" target="_blank">ggplot2</a> package. Well nothing could be easier. We just fire up an R shell and type:<br /><code><br />&gt; install.packages("ggplot2")</code></p><p>In theory the package should just install, however:</p><ul>
<li>if you are using Linux and don&rsquo;t have root access, this command won&rsquo;t work.</li>
<li>you will be asked to select your local mirror, i.e. which server should you use to download the package.</li>
</ul><h4>Installing packages without root access</h4><p>First, you need to designate a directory where you will store the downloaded packages. On my machine, I use the directory <code>/data/Rpackages/</code> After creating a package directory, to install a package we use the command:<br /><code><br />&gt; install.packages("ggplot2"</code><code>, lib="/data/Rpackages/")<br />&gt; library(ggplot2, lib.loc="/data/Rpackages/")<br /></code></p><p>It&rsquo;s a bit of a pain having to type <code>/data/Rpackages/</code> all the time. To avoid this burden,&nbsp; we create a file <code>.Renviron</code> in our home area, and add the line <code>R_LIBS=/data/Rpackages/</code> to it. This means that whenever you start R, the directory <code>/data/Rpackages/</code> is added to the list of places to look for R packages and so:</p><p><code>&gt; install.packages("ggplot2"</code><code>)<br />&gt; library(ggplot2)</code></p><p>just works!</p><h4>Setting the repository</h4><p>Every time you install a R package, you are asked which repository R should use. To set the repository and avoid having to specify this at every package install, simply:</p><ul>
<li>create a file <code>.Rprofile</code> in your home area.</li>
<li>Add the following piece of code to it:</li>
</ul><p><code><br />cat(".Rprofile: Setting UK repositoryn")<br />r = getOption("repos") # hard code the UK repo for CRAN<br />r["CRAN"] = "http://cran.uk.r-project.org"<br />options(repos = r)<br />rm(r)<br /></code></p><p>I found this tip in a stackoverflow <a href="http://stackoverflow.com/questions/1189759/expert-r-users-whats-in-your-rprofile/1189826#1189826" target="_blank">answer </a>.</p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:14:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</link>
	<title><![CDATA[Hercules: a profile HMM-based hybrid error correction algorithm for long reads]]></title>
	<description><![CDATA[<p><span>Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability: </span></p>
<p><span>Hercules source code is available at https://github.com/BilkentCompGen/Hercules</span></p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/Hercules" rel="nofollow">https://github.com/BilkentCompGen/Hercules</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>