<?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/27440?offset=440</link>
	<atom:link href="https://bioinformaticsonline.com/related/27440?offset=440" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</guid>
	<pubDate>Tue, 14 Jan 2020 06:47:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</link>
	<title><![CDATA[Shasta long read assembler]]></title>
	<description><![CDATA[<p>The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;flow cells.</p>
<p>Computational methods used by the Shasta assembler include:</p>
<ul>
<li>Using a&nbsp;<a href="https://en.wikipedia.org/wiki/Run-length_encoding">run-length</a>&nbsp;representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.</li>
<li>Using in some phases of the computation a representation of the read sequence based on&nbsp;<em>markers</em>, a fixed subset of short k-mers (k &asymp; 10).</li>
</ul>
<p>More at&nbsp;<a href="https://chanzuckerberg.github.io/shasta/index.html">https://chanzuckerberg.github.io/shasta/index.html</a></p><p>Address of the bookmark: <a href="https://github.com/chanzuckerberg/shasta" rel="nofollow">https://github.com/chanzuckerberg/shasta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23628/postgraduate-research-associate-bioinformatics-computational-biology-reference-code-59</guid>
  <pubDate>Tue, 04 Aug 2015 20:32:39 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postgraduate Research Associate Bioinformatics / Computational Biology (Reference code: 59)]]></title>
  <description><![CDATA[
<p>The Department of Biotechnology, group “Genome Bioinformatics” is currently seeking a Postgraduate Research Associate Bioinformatics / Computational Biology (Reference code: 59)</p>

<p>Extent of employment: 30 Hours per Week<br />Duration of employment: 1st of October 2015 to 30th of September 2019<br />Gross monthly salary and pay grade in terms of collective agreement for university staff (payable 14 times per year): B1, € 1.997,20</p>

<p>Responsibilities<br />The successful candidate (f/m) will pursue a Ph.D. project related to the interpretation of plant genome and transcriptome sequencing data from next-generation sequencing (NGS) platforms. In particular, the candidate will characterize the unexplored genome of quinoa, a crop plant of long-standing tradition in Latin America. We collaborate with research partners in Austria and abroad, and the candidate’s project will be of central importance in the context of this research network.</p>

<p>Required skills and qualifications<br />We are looking for a graduate student (f/m) with a Master’s degree in bioinformatics or in a related field, solid programming skills (e.g. developing sequence analysis tools), experience with the analysis of NGS data sets, understanding of lab methods and knowledge of genomics/transcriptomics. The group has successfully performed several projects using NGS technology. We have recently published the reference genome sequence of sugar beet (Dohm et al., Nature, 2014), a crop plant closely related to quinoa (same family, but different genus). Not yet published is a quinoa genome assembly that we have generated, and which will serve as the starting point of the candidate’s project. We are a multidisciplinary team and offer work in a lively and friendly atmosphere, and state-of-the-art computing infrastructure. We are looking forward to expanding our team by a dedicated and strongly motivated person with a distinct interest in the challenges of plant genomics.</p>

<p>Applications can be submitted until: 16th of August 2015</p>

<p>University of Natural Resources and Life Sciences Vienna seeks to increase the number of its female faculty and staff members. Therefore qualified women are strongly encouraged to apply. In case of equal qualification, female candidates will be given preference unless reasons specific to an individual male candidate tilt the balance in his favour.</p>

<p>Please send your job application (incl. letter of motivation, CV, summary of Master’s thesis and contact details for two referees) to Personnel department, University of Natural Resources and Life Sciences, 1190 Vienna, Peter-Jordan-Straße 70; E-Mail: kerstin.buchmueller@boku.ac.at. (Reference code: 59)</p>

<p>We regret that we cannot reimburse applicants travel and lodging expenses incurred as part of the selection and hiring process.</p>

<p>www.boku.ac.at</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 04:06:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</link>
	<title><![CDATA[mutatrix: a population genome simulator which generates simulated genomes.]]></title>
	<description><![CDATA[<p><span>genome simulation across a population with zeta-distributed allele frequency, snps, insertions, deletions, and multi-nucleotide polymorphisms</span></p>
<p><span>More at&nbsp;<a href="https://github.com/ekg/mutatrix">https://github.com/ekg/mutatrix</a></span></p>
<pre>./mutatrix -S sample -P test/ -p 2 -n 10 reference.fasta</pre><p>Address of the bookmark: <a href="https://github.com/ekg/mutatrix" rel="nofollow">https://github.com/ekg/mutatrix</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/17898/ensembl-77-has-been-released</guid>
	<pubDate>Sun, 05 Oct 2014 16:38:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/17898/ensembl-77-has-been-released</link>
	<title><![CDATA[Ensembl 77 has been released!]]></title>
	<description><![CDATA[<h3>New updates in e!77 !!</h3><ul>
<li>Updated&nbsp;<a href="http://e77.ensembl.org/Homo_sapiens/Info/Index" title="Human species page">human</a>&nbsp;gene set (GENCODE 21)</li>
<li>Updated <a href="http://e77.ensembl.org/Rattus_norvegicus/Info/Index">rat</a> gene set&nbsp;including manual annotation from HAVANA</li>
<li>New species:&nbsp;<a href="http://e77.ensembl.org/Chlorocebus_sabaeus/Info/Index">Vervet-African green monkey</a></li>
<li>Imported Transcript Support Levels (TSLs) from UCSC&nbsp;for&nbsp;<a href="http://e77.ensembl.org/Homo_sapiens/Info/Index">human</a>&nbsp;and&nbsp;<a href="http://e77.ensembl.org/Mus_musculus/Info/Index">mouse</a></li>
<li>Imported <a href="http://appris.bioinfo.cnio.es/" target="_blank" title="APPRIS">APPRIS</a> flag for&nbsp;<a href="http://e77.ensembl.org/Homo_sapiens/Info/Index">human</a> and <a href="http://e77.ensembl.org/Mus_musculus/Info/Index">mouse</a></li>
<li>Updated <a href="http://e77.ensembl.org/Poecilia_formosa/Info/Index" title="Amazon molly">Amazon molly</a> gene set</li>
</ul><p>Find more at http://www.ensembl.info/blog/2014/10/02/ensembl-77-has-been-released/</p>]]></description>
	<dc:creator>Seema Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</guid>
	<pubDate>Wed, 07 Jun 2017 04:18:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</link>
	<title><![CDATA[GraphMap - A highly sensitive and accurate mapper for long, error-prone reads]]></title>
	<description><![CDATA[<p>GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/ncomms11307.html<br><br><strong>Features</strong><br><br>&nbsp;&nbsp;&nbsp; Mapping position agnostic to alignment parameters.<br>&nbsp;&nbsp;&nbsp; Consistently very high sensitivity and precision across different error profiles, rates and sequencing technologies even with default parameters.<br>&nbsp;&nbsp;&nbsp; Circular genome handling to resolve coverage drops near ends of the genome.<br>&nbsp;&nbsp;&nbsp; E-value.<br>&nbsp;&nbsp;&nbsp; Meaningful mapping quality.<br>&nbsp;&nbsp;&nbsp; Various alignment strategies (semiglobal bit-vector and Gotoh, anchored).<br>&nbsp;&nbsp;&nbsp; Overlapping of reads for de novo assembly.<br>&nbsp;&nbsp;&nbsp; Transcriptome mapping through internal construction of a transcriptome from a given genomic reference and a GTF file.<br>&nbsp;&nbsp;&nbsp; ...and much more.<br><br>GraphMap is also used as an overlapper in a new de novo genome assembly project called Ra (https://github.com/mariokostelac/ra-integrate).<br>Ra attempts to create de novo assemblies from raw nanopore and PacBio reads without requiring error correction, for which a highly sensitive overlapper is required.<br><br>Currently, development of a new spliced-alignment mode for mapping RNA-seq reads is under way.<br>Description of the current effort as well as how to reach the experimental implementation can be found here: doc/rnaseq.md.</p><p>Address of the bookmark: <a href="https://github.com/isovic/graphmap" rel="nofollow">https://github.com/isovic/graphmap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</guid>
	<pubDate>Mon, 18 Dec 2017 04:07:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</link>
	<title><![CDATA[Run miniasm assembler on nanopore reads !]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p><p>Find the detail of the reads repeats:</p><blockquote><p>fq2fa ONT_A.fastq ONT_A.fasta&nbsp;<br /><br />minimap2 -xava-ont ONT_A.fasta ONT_A.fasta -t10 -X &gt; AONT.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT.paf &gt; AONTself.paf&nbsp;<br /><br />awk '$5=="-"' AONTself.paf | awk '{print $1}'| sort|uniq &gt; invertedrepeat.list</p></blockquote><p>Generated a few palindrome and repeats plots (highlighting only repeats largest than 10, 20 and 30 kb)</p><blockquote><p>minidot -f 5 -m 30000 AONTself.paf &gt; AONTself30000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself30000.eps &gt; AONTself30000final.eps&nbsp;<br /><br />minidot -f 5 -m 20000 AONTself.paf &gt; AONTself20000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself20000.eps &gt; AONTself20000final.eps&nbsp;<br /><br />minidot -f 5 -m 10000 AONTself.paf &gt; AONTself10000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself10000.eps &gt; AONTself10000final.eps&nbsp;</p></blockquote><p>Assemble with miniasm:</p><blockquote><p>miniasm -f ONT_A.fasta AONT.paf &gt; AONT.gfa&nbsp;</p><p>grep '^S' AONT.gfa |awk '{print "&gt;"$2"\n"$3}' &gt; AONT_miniasm.fasta&nbsp;<br /><br />minimap2 -xasm10 AONT_miniasm.fasta AONT_miniasm.fasta -t1 -X &gt; AONT_miniasm.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT_miniasm.paf &gt; AONT_miniasm_self.paf&nbsp;<br /><br />minidot -f 5 -m 10000 AONT_miniasm_self.paf &gt; AONT_miniasm_self10000.eps&nbsp;</p></blockquote><p>Njoy the assembly !</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18380/jrfsrf-at-university-of-hyderabad</guid>
  <pubDate>Fri, 17 Oct 2014 01:55:44 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF/SRF at University of Hyderabad]]></title>
  <description><![CDATA[
<p>Applications are invited for the following post of Junior Research Fellow (temporary position coterminous with the project) under DBT funded research project on ““Understanding the functions of α1β1γ1/α2β1γ1 selective AMPK Modulators in dissecting the pharmacological role of these isozymes in metabolic diseases”</p>

<p>Qualified and interested candidates can send their curriculum vitae by e-mail to hr@drils.org on or before 27th October 2014 mention in the subject line of the mail the following code: AMPK-Biology.</p>

<p>Selected candidates will be called for a personal interview to Dr. Reddy’s Institute of Life Sciences, University of Hyderabad Campus, Gachibowli, Hyderabad. The selected candidate is expected to report within two weeks from the date of selection to start work on the project.</p>

<p>Junior Research Fellowship (Molecular Modeling/Biology) for two years and Senior Research fellowship for one year</p>

<p>Junior Research Fellowship: Rs. 15,600/- (consolidated) per month for first two years.<br />Senior Research Fellowship: Rs. 18,200/-(consolidated) per month for the 3rd year.</p>

<p>Duration: The duration of the fellowship is for three years. However, the performance of the candidate will be reviewed after the completion of every year and the fellowship will be renewed only upon satisfactory performance.</p>

<p>Responsibilities:</p>

<p>1) Literature search.<br />2) Design, plan and execute experiments under the supervision of the scientist.<br />3) Provide scientific support to the scientist in his/her research activities.<br />4) Book keeping and maintenance of stocks and consumables.</p>

<p>Essential Qualifications:</p>

<p>Required: M.Sc. in Microbiology/Biotechnology/Bioinformatics or any other related branch of basic Sciences from a recognized university/institute with a consistent academic record of minimum 60% aggregate in all qualifying examinations. The candidate should be NET qualified for lectureship. The candidate should be motivated to work with dedication.</p>

<p>Desirable: expertise/experience in both Molecular Modeling and Molecular Biology.</p>

<p>Experience: 0-2 years in the areas of Molecular Modeling and/or Molecular Biology and cell biology and Biochemistry.</p>

<p>Preferable: Relevant research experience as evident from thesis/dissertation/project work.</p>

<p>Advertisement: http://www.ilsresearch.org/userfiles/Junior%20REsearch%20Fellowship%20-%20AMPK(Biology).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/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</guid>
	<pubDate>Thu, 24 May 2018 08:33:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</link>
	<title><![CDATA[minialign: fast and accurate alignment tool for PacBio and Nanopore long reads]]></title>
	<description><![CDATA[Minialign is a little bit fast and moderately accurate nucleotide sequence alignment tool designed for PacBio and Nanopore long reads. It is built on three key algorithms, minimizer-based index of the minimap overlapper, array-based seed chaining, and SIMD-parallel Smith-Waterman-Gotoh extension.<p>Address of the bookmark: <a href="https://github.com/ocxtal/minialign" rel="nofollow">https://github.com/ocxtal/minialign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18580/faculty-positions-at-central-university-of-punjab-bathinda</guid>
  <pubDate>Wed, 22 Oct 2014 10:45:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[Faculty Positions at CENTRAL UNIVERSITY OF PUNJAB, BATHINDA]]></title>
  <description><![CDATA[
<p>Advertisement No. T/NT-01 (2014)</p>

<p>Faculty Positions<br />The Central University of Punjab (CUP), Bathinda will be having the Schools and Departments as given in Table-I. The University invites applications from eligible candidates for the posts of Professors (Pay Band Rs. 37400-67000 with AGP of Rs. 10, 000/-), Associate Professors (Pay Band Rs.37400-67000 with AGP of Rs. 9,000/-) and Assistant Professors (Pay Band Rs.15600-39100 with AGP of Rs. 6,000/-)</p>

<p>POSITION AVAILABLE IN THE AREA OF SPECIALIZTION</p>

<p>3. Bioinformatics,</p>

<p>Procedure to apply: Application forms along with API form complete in all respect along with necessary documents and application fee of Rs. 750/-. (Rs. 250/- for Scheduled Caste/Scheduled Tribe/Person with disabilities) should be sent to:</p>

<p>Registrar (Officiating)<br />Central University of Punjab<br />City Campus, Mansa Road<br />Bathinda-151 001</p>

<p>Application forms from the prospective candidates are accepted upto November 10, 2014.</p>

<p>Based on the qualification of the candidates and the need of the university, the applications received will be processed through appropriately constituted selection committees shortly. Minimum qualification can be relaxed in case of exceptionally outstanding candidate. For further details visit www.cup.ac.in; www.centralunipunjab.com; www.cup.edu.in</p>

<p>The candidate should download the application form available at website www.cup.ac.in;<br />www.centralunipunjab.com; and submit it complete in all respects on or before 10th November 2014.</p>

<p>Those who have applied earlier need to submit Academic Performance Index (API) form, 5 copies of Summary of the Application Form (available at: www.cup.ac.in; www.centralunipunjab.com and Updated CV if not updated recently (without application fee).</p>

<p>http://cup.edu.in/Faculty_details_and_general_instructions.pdf</p>

<p>http://cup.edu.in/Final%20Application%20and%20summary%20Sheet%20and%20Api%20form.pdf</p>
]]></description>
</item>

</channel>
</rss>