<?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/27696?offset=570</link>
	<atom:link href="https://bioinformaticsonline.com/related/27696?offset=570" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/7214/lapti-lab</guid>
  <pubDate>Thu, 12 Dec 2013 18:19:12 -0600</pubDate>
  <link></link>
  <title><![CDATA[LAPTI Lab]]></title>
  <description><![CDATA[
<p>The main theme of our research is the understanding of how genetic information is decoded from DNA into RNA and proteins. Someone may find this topic a little strange and argue that we already know how this is happening.</p>

<p>Translational recoding. </p>

<p>RNA editing. </p>

<p>Evolution of the genetic code and translation.</p>

<p>More at http://lapti.ucc.ie/research.html</p>

<p>Lab page http://lapti.ucc.ie/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</guid>
	<pubDate>Mon, 27 Nov 2017 10:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</link>
	<title><![CDATA[Opera: An optimal genome scaffolding program]]></title>
	<description><![CDATA[<p><span>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (</span><a href="http://en.wikipedia.org/wiki/Sequence_assembly" target="_blank">http://en.wikipedia.org/wiki/Sequence_assembly&nbsp;<img src="https://a.fsdn.com/con/img/icons/external_asset.png" alt="image" style="border: 0px;"></a><span>). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.</span><br><br><span>An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.</span><br><br><span>Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.</span><br><br><span>Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.</span></p>
<p><span>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/operasf/" rel="nofollow">https://sourceforge.net/projects/operasf/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7362/junior-research-fellow-jrf-project-fellow-kalasalingam-university</guid>
  <pubDate>Thu, 19 Dec 2013 13:23:39 -0600</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow (JRF) / Project Fellow @ Kalasalingam University]]></title>
  <description><![CDATA[
<p>Applications are invited from interested candidates for the post of one Junior Research Fellow / Project Fellow on a purely temporary basis in a time bound research project (3 years) sponsored by Science and Engineering Research Board, Government of India, New Delhi.</p>

<p>Name of the fellowship: Junior Research Fellow (JRF) / Project Fellow</p>

<p>Title of the project: Genome-wide Mapping of Murine Specific Dengue T-cell Epitopes: Computational Prediction, Identification and use as Candidate Vaccines</p>

<p>Duration: 3 years</p>

<p>Fellowship: Rs. 18,000 for first 2 years and Rs. 20,000 for 3rdyear (for M.Tech. candidates)</p>

<p>Rs. 16,000 for first 2 years and Rs. 18,000 for 3rdyear (for M.Sc. candidates with NET qualification)</p>

<p>Rs. 8,000 for first 2 years and Rs. 10,000 for 3rdyear (for M.Sc. candidates without NET qualification)</p>

<p>Qualifications: M.Tech. in Biotechnology / M.Sc. in any branch of Life Sciences</p>

<p>Desirable Experience: Minimum of two years research experience in any of the following areas: Immunology / Microbiology / Gene Manipulation / Bioinformatics</p>

<p>Interested and eligible candidates may apply with their resume along with relevant documents and a passport size photograph to the Principal Investigator by post (or e-mail) on or before December 31, 2013. Only short listed candidates will be called for written test and/or interview. Selected candidate may register for PhD in Kalasalingam University. No TA/DA will be paid for attending interview.</p>

<p>Dr. K. Sundar<br />Principal Investigator (SERB Project)<br />Department of Biotechnology<br />Kalasalingam University<br />Krishnankoil – 626126, Tamil Nadu<br />sundarkr@klu.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</guid>
	<pubDate>Mon, 27 Nov 2017 08:05:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</link>
	<title><![CDATA[SPAdes hybrid genome assembly]]></title>
	<description><![CDATA[<p>When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the&nbsp;<a href="https://gigascience.biomedcentral.com/articles/10.1186/s13742-015-0101-6">B fragilis assembly</a>&nbsp;by Mick Watson&rsquo;s group.</p><p>Again, running spades.py will show you the options:</p><div><pre><code>spades.py
</code></pre></div><p>This produces:</p><div><pre><code>SPAdes genome assembler v3.10.1

Usage: /usr/local/SPAdes-3.10.1-Linux/bin/spades.py [options] -o &lt;output_dir&gt;

Basic options:
-o      &lt;output_dir&gt;    directory to store all the resulting files (required)
--sc                    this flag is required for MDA (single-cell) data
--meta                  this flag is required for metagenomic sample data
--rna                   this flag is required for RNA-Seq data
--plasmid               runs plasmidSPAdes pipeline for plasmid detection
--iontorrent            this flag is required for IonTorrent data
--test                  runs SPAdes on toy dataset
-h/--help               prints this usage message
-v/--version            prints version

Input data:
--12    &lt;filename&gt;      file with interlaced forward and reverse paired-end reads
-1      &lt;filename&gt;      file with forward paired-end reads
-2      &lt;filename&gt;      file with reverse paired-end reads
-s      &lt;filename&gt;      file with unpaired reads
--pe&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-&lt;or&gt;    orientation of reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--s&lt;#&gt;          &lt;filename&gt;      file with unpaired reads for single reads library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-&lt;or&gt;    orientation of reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--hqmp&lt;#&gt;-12    &lt;filename&gt;      file with interlaced reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-1     &lt;filename&gt;      file with forward reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-2     &lt;filename&gt;      file with reverse reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-s     &lt;filename&gt;      file with unpaired reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-&lt;or&gt;  orientation of reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--nxmate&lt;#&gt;-1   &lt;filename&gt;      file with forward reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--nxmate&lt;#&gt;-2   &lt;filename&gt;      file with reverse reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--sanger        &lt;filename&gt;      file with Sanger reads
--pacbio        &lt;filename&gt;      file with PacBio reads
--nanopore      &lt;filename&gt;      file with Nanopore reads
--tslr  &lt;filename&gt;      file with TSLR-contigs
--trusted-contigs       &lt;filename&gt;      file with trusted contigs
--untrusted-contigs     &lt;filename&gt;      file with untrusted contigs

Pipeline options:
--only-error-correction runs only read error correction (without assembling)
--only-assembler        runs only assembling (without read error correction)
--careful               tries to reduce number of mismatches and short indels
--continue              continue run from the last available check-point
--restart-from  &lt;cp&gt;    restart run with updated options and from the specified check-point ('ec', 'as', 'k&lt;int&gt;', 'mc')
--disable-gzip-output   forces error correction not to compress the corrected reads
--disable-rr            disables repeat resolution stage of assembling

Advanced options:
--dataset       &lt;filename&gt;      file with dataset description in YAML format
-t/--threads    &lt;int&gt;           number of threads
                                [default: 16]
-m/--memory     &lt;int&gt;           RAM limit for SPAdes in Gb (terminates if exceeded)
                                [default: 250]
--tmp-dir       &lt;dirname&gt;       directory for temporary files
                                [default: &lt;output_dir&gt;/tmp]
-k              &lt;int,int,...&gt;   comma-separated list of k-mer sizes (must be odd and
                                less than 128) [default: 'auto']
--cov-cutoff    &lt;float&gt;         coverage cutoff value (a positive float number, or 'auto', or 'off') [default: 'off']
--phred-offset  &lt;33 or 64&gt;      PHRED quality offset in the input reads (33 or 64)
                                [default: auto-detect]
</code></pre></div><p>As you can see this is also a &ldquo;pipeline&rdquo; of tools that can be switched on or off. SPAdes takes quite a long time, so for the purposes of this practical, something like this may suffice:</p><div><pre><code>spades.py -t 4 <span>\</span>
          -m 32 <span>\</span>
          -k 31,51,71 <span>\</span>
          --only-assembler <span>\</span>
          -1 miseq.1.fastq -2 miseq.2.fastq <span>\</span>
          --nanopore minion.fastq <span>\</span>
          -o hybrid_assembly
</code></pre></div><p>In turn, these parameters mean</p><ul>
<li>use 4 threads</li>
<li>max memory is 32Gb</li>
<li>use 3 kmer values to build the de bruijn graph(s) - 31, 51 and 71</li>
<li>only run the assembler, not the correction algorithm (for speed)</li>
<li>read 1 and read 2 of the MiSeq data</li>
<li>the nanopore data</li>
<li>put the output in folder &ldquo;hybrid_assembly&rdquo;</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7567/asst-professor-jaipur-national-university</guid>
  <pubDate>Fri, 27 Dec 2013 19:54:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[Asst. Professor @ JAIPUR NATIONAL UNIVERSITY]]></title>
  <description><![CDATA[
<p>JAIPUR NATIONAL UNIVERSITY</p>

<p>Established by Government of Rajasthan</p>

<p>Approved by UGC under Sec 2(f) of UGC Act 1956</p>

<p>ADVERTISEMENT FOR FACULTY POSITION AT JAIPUR NATIONAL UNIVERSITY,JAIPUR</p>

<p>Jaipur National University, Jaipur is a premier centre of learning, providing various integrated and interdisciplinary programmes of study and research in the country. With the opening of the School of Distance Education &amp; Learning, JNU has taken education to the doorsteps of those aspirants who, for some reason, could not be a part of regular stream of education. In this era of competition &amp; ambition for excellence, it has become imperative to have quality education &amp; an alert mind coupled with the right attitude to carry onself, and for this, JNU happens to be the most sought after destination.</p>

<p>School Of Life Sciences: Bioinformatics, Chemistry</p>

<p>Total no of Post: 04</p>

<p>Education:</p>

<p>PG – M.Sc /M.Tech Bioinformatics</p>

<p>PG – M.Sc /M.Tech Chemistry</p>

<p>Experience:</p>

<p>Candidate with 1-2 years of teaching experience in college/ University will be preffered. Freshers may also apply.</p>

<p>Compensation: Compensation will not be a problem for the right candidate</p>

<p>HOW TO APPLY:</p>

<p>SEND THE UPDATED RESUME THROUGH MAIL OR POST AT</p>

<p>dsbhatia5@yahoo.com</p>

<p>contact no: 7568246839</p>

<p>Website: http://www.jnujaipur.ac.in</p>

<p>Please mail your resume to Prof.D.S.Bhatia</p>

<p>Email Address: dsbhatia5@yahoo.com</p>

<p>Ph:, +917568246839</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7933/senior-programmer-biotech-park</guid>
  <pubDate>Mon, 20 Jan 2014 04:50:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[SENIOR PROGRAMMER @ Biotech Park]]></title>
  <description><![CDATA[
<p>Advt. No. (1)/BP/2014<br />A walk-in-interview will be held in the Biotech Park Office at Sector G, Jankipuram, Kursi Road, Lucknow (U.P.) January 31, 2014 at 11.00 A.M. for the following posts of DBT sponsored project tenable at Biotech Park. Interested candidates fulfilling the requisite qualifications, experience and age as given below, on the date of interview, may appear before the Selection Committee. The candidate will have to join immediately. Appointment will be made initially for six months extendable on satisfactory performance till the duration of the project.<br />INTERVIEW ON January 31, 2014 at 11.00 A.M.<br /> <br />SENIOR PROGRAMMER (ONE POST)<br />Educational Qualification<br />M.Sc./B. Tech Bioinformatics with minimum 60% marks with two years of relevant experience	<br />Job Requirement	<br />Development of databases in multi user environment and application softwares, updating and maintenance of website, Drug designing and QSAR study etc.<br />Desirable<br />Knowledge of Bioinformatics tools, Windows, Linux, C++, JAVA / JAVA Script, Visual Basic, CGI, DBMS/RDBMS and HTML. Experience in various domains of bioinformatics such as structure based drug designing, Newtonian dynamics and QSAR studies.<br />Age<br />Below 35 years (as on the date of interview)<br />Emoluments<br />Rs. 12,000/- per month fixed.<br />Note: All the candidates should report for interview on or before 10.30 A.M<br />General Conditions<br />The aforesaid positions are purely temporary and do not give the incumbent any right whatsoever for appointment on regular basis.<br />The applicant will have to submit typed and duly signed application on plain paper on the day of interview stating:<br />    (a) Advertisement No.<br />    (b) Position applied for<br />    (c) Name of Applicant (in Block letters)<br />    (d) Father’s Name<br />    (e) Date of Birth<br />    (f) Sex<br />    (g) Age as on the date of interview (dd / mm / yy )<br />    (h) Address (Permanent &amp; correspondence)<br />    (i) Educational Qualifications (High School onwards) with examination passed, year, % marks, subjects<br />    (j) Employment experience, if any i.e. Name of employer, nature of employment, date of joining and leaving.<br />Applications must be accompanied by a latest passport size photograph and attested copies of certificates<br />Original certificates/degree and testimonials should be produced by the candidate for verification at the time of interview.</p>

<p>Tenure: Initially upto six months and extendable based on performance.<br />The upper age limit can be relaxed up to 5 years in the case of applicant belonging to SC/ST/Woman/Physically handicapped and 3 years for OBCs.<br />No TA/DA will be paid for attending the interview.<br />More at http://www.biotechpark.org.in/index1.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</guid>
	<pubDate>Tue, 19 Dec 2017 17:17:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</link>
	<title><![CDATA[String graph based genome assembly software and tools !]]></title>
	<description><![CDATA[<p>In&nbsp;<a href="https://en.wikipedia.org/wiki/Graph_theory" title="Graph theory">graph theory</a>, a&nbsp;<strong>string graph</strong>&nbsp;is an&nbsp;<a href="https://en.wikipedia.org/wiki/Intersection_graph" title="Intersection graph">intersection graph</a>&nbsp;of&nbsp;<a href="https://en.wikipedia.org/wiki/Curve" title="Curve">curves</a>&nbsp;in the plane; each curve is called a "string".&nbsp; String graphs were first proposed by E. W. Myers in a&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">2005 publication</a>.&nbsp;In&nbsp;recent&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Genome Research paper</a>&nbsp;describing an innovative approach for assembling large genomes from NGS data caught our attention for several reasons. i) it give different "string graph" prospective of long lasting genome assembly problem ii) the&nbsp;paper is coauthored by Jared Simpson, the developer of&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694472/">ABySS assembler</a>&nbsp;and Richard Durbin. iii)&nbsp;Simpson-Durbin algorithm is that it does not rely on de Bruijn graphs, and instead employs a different graph construction approach called &lsquo;string graph&rsquo;.</p><p>Following are the genome assembly tools based on string graph:</p><p>1.SGA (String Graph Assembler)&nbsp;https://github.com/jts/sga</p><p>Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.</p><p>2.&nbsp;SAGE: String-overlap Assembly of GEnomes&nbsp;https://github.com/lucian-ilie/SAGE2</p><p>SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.</p><p>3. FSG: Fast String Graph</p><p>The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.</p><p>4.&nbsp;&nbsp;BASE&nbsp;https://github.com/dhlbh/BASE</p><p>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.&nbsp;BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.</p><p>5.&nbsp;Fermi&nbsp;https://github.com/lh3/fermi/</p><p>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;collapsed by other assemblers. Its ultimate goal is to find a minimal set of&nbsp;unitigs to represent all the information in raw reads.</p><p>If you want to learn about String Graph assembler, please read the following papers -</p><p>i)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">The Fragment Assembly String Graph - E. W. Myers</a></p><p>This paper describes the String Graph concept.</p><p>ii)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/26/12/i367.full#ref-20">Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin</a></p><p>This earlier paper from Simpson and Durbin</p><p>iii)&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8384/post-doc-in-genomics-of-fungi</guid>
  <pubDate>Tue, 18 Feb 2014 13:47:08 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post-doc in Genomics of Fungi]]></title>
  <description><![CDATA[
<p>Post-doc in Genomics of Fungi</p>

<p>Fungi are of central importance for the global carbon cycle because of<br />their role in the degredation of complex organic matter such as plant<br />material. Fungi also represent one of the last frontiers of<br />biodiversity, as their taxonomic diversity and metabolic potential<br />remain poorly understood. This is particularly true for those fungi that<br />are abundant in freshwaters.</p>

<p>\"MycoLink\" (Linking aquatic mycodiversity to ecosystem function) is an interdisciplinary project integrating the expertise of 4 Leibniz Institutes: IGB, ZALF, DSMZ, the Leibniz-Institute of Freshwater Ecology and Inland Fisheries (IGB), the Leibniz Centre for Agricultural Landscape Research (ZALF), and the Leibniz-Institute of Zoo- and Wildlife Research in Berlin (IZW). We are seeking to recruit outstanding young scientists to establish an innovative research program, and currently invite applications for:</p>

<p>PostDoc will focus on global biodiversity and evolutionary genomics of freshwater fungi, using second- and third-generation sequencing and bioinformatics to analyse natural populations and experimental cultures. For further information, contact Michael T. Monaghan (monaghan@igb-berlin.de) (http://monaghanlab.org).</p>

<p>PostDoc will focus on the ecological and functional role of aquatic fungi by combining state-of-the-art biochemical analyses with modeling in experimental and natural ecosystems. For further information, contact Hans-Peter Grossart &amp; Katrin Premke (hgrossart@igb-berlin.de; premke@igb-berlin.de)</p>

<p>Applicants must hold a PhD in a relevant field. Positions are available for up to three years. Salary is according to the German TvD. Positions will be based at IGB Berlin, IGB Neuglobsow, and at the Berlin Centre for Genomics in Biodiversity Research. The institutes of the Leibniz Association strive to increase the proportion of female scientists. Therefore, female candidates are specifically encouraged to apply. Disabled applicants with identical technical and personal qualification will be preferentially selected.</p>

<p>Please submit a curriculum vitae (including publication list), a brief statement of motivation and research interests, and the names and contact information of two referees. Please send all documents as a single pdf file to monaghan@igb-berlin.de. </p>

<p>Review of the applications will start on 21 February 2014 and continue until the positions are filled. Interviews for shortlisted applicants will take place in March.</p>

<p>Biodiversity, Ecology, and Genomics of Aquatic Fungi<br />Leibniz-Institute of Freshwater Ecology and Inland Fisheries (IGB), Berlin, Germany</p>

<p>Deadline for applications : unknown.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41158/carefully-opt-for-human-reference-genome</guid>
	<pubDate>Tue, 18 Feb 2020 07:43:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41158/carefully-opt-for-human-reference-genome</link>
	<title><![CDATA[Carefully opt for human reference genome]]></title>
	<description><![CDATA[<p><a href="http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use" target="_blank">Heng Li posted several issues with the human reference genomes given in these resources</a> and suggests the following compressed FASTA file to be used as hg38/GRCh38 human reference genome.</p>
<p>if you map reads to GRCh38 or hg38, use the following:</p>
<div>
<div>
<pre><code>ftp://ftp.ncbi.nlm.nih.gov/genomes/all/GCA/000/001/405/GCA_000001405.15_GRCh38/seqs_for_alignment_pipelines.ucsc_ids/GCA_000001405.15_GRCh38_no_alt_analysis_set.fna.gz
</code></pre>
</div>
</div>
<p>There are several other versions of GRCh37/GRCh38. What&rsquo;s wrong with them? Here are a collection of potential issues:</p>
<p>More at http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use</p><p>Address of the bookmark: <a href="http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use" rel="nofollow">http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>

</channel>
</rss>