<?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/36880?offset=1170</link>
	<atom:link href="https://bioinformaticsonline.com/related/36880?offset=1170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/25252/bioinformatics-faculty-at-university-of-pune</guid>
  <pubDate>Fri, 13 Nov 2015 03:06:00 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Faculty at University of Pune]]></title>
  <description><![CDATA[
<p>SAVITRIBAI PHULE PUNE UNIVERSITY<br />(Formerly University of Pune)<br />(APPOINTMENT OF TEACHING POSTS)</p>

<p>Accompaniment to the Advertisement No. 52 dated 10.11.2015 for various Teaching Positions purely on contract basis for a maximum period of five years in the various Departments/Centre of the University.</p>

<p>Last date for receipt of application in the University Office is 04.12.2015.</p>

<p>Associate Professor</p>

<p>    Environmental Science</p>

<p>    Institute of Bioinformatics &amp; Biotechnology (IBB)</p>

<p>    Microbiology</p>

<p>Assistant Professor</p>

<p>    Biotechnology</p>

<p>    Institute of Bioinformatics &amp; Biotechnology (IBB)</p>

<p>    Microbiology</p>

<p>More Info : http://collegecirculars.unipune.ac.in/sites/documents/Job%20Openings/advt-no-52-dt-10-11-2015-contract-positions.pdf</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/24923/postdoctoral-positions-are-available-at-the-faryabi-lab</guid>
  <pubDate>Sun, 11 Oct 2015 03:36:18 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral positions are available at the Faryabi Lab]]></title>
  <description><![CDATA[
<p>Postdoctoral positions are available at the Faryabi Lab located in the Department of Pathology and the Center for Personalized Diagnostics at the University of Pennsylvania.</p>

<p>A qualified candidate will be strongly motivated individual with following qualifications: a Ph.D. in computational sciences, engineering, physics, bioinformatics, or related field. Ability to program in Python/Perl and R in Unix environment, knowledge of C++, Java, and SQL is a plus. Demonstrated applied bioinformatics/computational proficiency as evidenced by relevant publications in peer-reviewed journals. Experience with cancer genomics is a plus.</p>

<p>The primary research focus of the Faryabi Lab is on developing novel computational methods to study mechanisms involved in genome instability and elucidate their roles in tumorigenesis. In addition the position provides collaborative opportunities with both basic and translational scientists across the Perelman School of Medicine, one of the top 5 medical research universities in the nation.<br />. a Ph.D. degree in either physical or computational sciences<br />. solid programming skills ( Python/Perl, Java, C/C++, R, SQL)<br />. computational genomics experience ( high throughput sequence analysis)<br />. excellent spoken and written communication and interaction skills<br />. publications in English in relevant areas of research in peer-reviewed journals.<br />. Previous experience or interest in data visualization design is a plus.</p>

<p>More at <br />University of Pennsylvania<br />Pathology and Laboratory Medicine<br />Robert B. Faryabi<br />faryabiPenn@gmail.com<br />http://faryabib.github.io/<br />How To Apply:	email CV and contacts of 3 references to faryabiPenn@gmail.com</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/25249/research-associatesresearch-fellow-school-of-agricultural-biotechnology-last-date-17-11-2015-and-interview-on-26-11-2015-at-1100-am</guid>
  <pubDate>Fri, 13 Nov 2015 02:46:59 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associates/Research Fellow - School of Agricultural Biotechnology (Last Date 17-11-2015 and Interview on 26-11-2015 at 11.00 AM)]]></title>
  <description><![CDATA[
<p>PAU Recruitment November 2015, Punjab</p>

<p>Job notification in Punjab Agricultural University (PAU) for research Associate/ Research Fellow posts for different projects. Eligible candidates may apply in prescribed application format on or before 17-11-2015 from 09:00 am to 05:00 pm.</p>

<p>Vacancies:<br />Research Associate/ Research Fellow-03<br />Qualification:<br />Candidates should possess B.Sc. with minimum 50% marks, M.Sc. in Bioinformatics/ Biotechnology/ Genetics/ Plant Breeding/ Plant Breeding &amp; Genetics/ Plant Breeding, Genetics &amp; Biotechnology/ Microbiology/ Biochemistry/ Botany with 65% marks.<br />Selection Process:<br />Selection will be based on interview.<br />How to Apply:<br />Eligible candidates may send their applications along with attested copies of certificates, fee to the Director, School of Agricultural Biotechnology, PAU, Ludhiana on or before 17-11-2015 from 09:00 am to 05:00 pm<br />Last Date:<br />17-11-2015 </p>

<p>More at http://web.pau.edu/content/banner/1349.pdf</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/opportunity/view/25095/jrf-bioinformatics</guid>
  <pubDate>Mon, 02 Nov 2015 03:24:50 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics]]></title>
  <description><![CDATA[
<p>JRF Bioinformatics</p>

<p>Eligibility : ME/M.Tech, MSc(Bio-Chemistry, Bio-Informatics, Bio-Tech, Microbiology), BE/B.Tech</p>

<p>Location : Gandhinagar</p>

<p>Last Date : 05 Nov 2015</p>

<p>Hiring Process : Face to Face Interview</p>

<p>Junior Research Fellow (JRF) Job vacancies in Gujarat State Biotechnology Mission (GSBTM)</p>

<p>Project : “Establishing a network in computational and system biology”</p>

<p>No. of Post : 01</p>

<p>Qualification : MSc. /M.Tech. /B.E. /B.Tech. in Biotechnology/Bioinformatics /Life Sciences /Microbiology /Biochemistry /Genetics from recognized University. Preference would be given to the candidates having NET/GATE.</p>

<p>Fellowship : Rs. 12,000 + 20% HRA<br />How to apply</p>

<p>Applications should be filled Online. The last date for submission of application is 5th November, 2015.</p>

<p>More at http://btm.gujarat.gov.in/btm/recruitment2.htm</p>
]]></description>
</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>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/25149/project-assistant-ii-job-vacancies-in-national-institute-of-oceanography-nio-goa</guid>
  <pubDate>Fri, 06 Nov 2015 01:33:22 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Assistant-II job vacancies in National Institute of Oceanography (NIO Goa)]]></title>
  <description><![CDATA[
<p>Vacancy no : GAP0423/1509-15</p>

<p>Project Assistant-II job vacancies in National Institute of Oceanography (NIO Goa)</p>

<p>Project Title and Code : Biotechnology Information System. -- GAP0423</p>

<p>Qualification : M.Sc Bioinformatics / Zoology / Botany / Environmental Science. Desirable : Basic understanding of biodiversity concept is desirable</p>

<p>No. of Post : 01</p>

<p>Age : 28 Years</p>

<p>Place of Posting : Goa</p>

<p>Consolidated Stipend Per Month : Rs.16000/-</p>

<p>Job Requirement : Collection and handling of biodiversity data as assigned by the scientists and working with in-house biodiversity data management applications and software<br />How to apply</p>

<p>Candidates satisfying requirements may attend the Walk-in-interview on 12.11.2015, 10.00 AM at NIO Dona Paula, Goa-403004 along with their bio-data, attested copies of certificates &amp; mark lists in proof of qualification (SSC onwards), age, experience and testimonials. Candidates should bring a photo identity proof at the time of registration</p>

<p>More at http://www.nio.org/index/option/com_vacgoa/task/show/title/Goa/tid/6/sid/28/thid/64</p>
]]></description>
</item>

</channel>
</rss>