<?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/26306?offset=1040</link>
	<atom:link href="https://bioinformaticsonline.com/related/26306?offset=1040" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</guid>
	<pubDate>Tue, 05 Jun 2018 09:57:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</link>
	<title><![CDATA[PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach]]></title>
	<description><![CDATA[PERGA - Paired End Reads Guided Assembler

PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate.

The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.<p>Address of the bookmark: <a href="https://github.com/hitbio/PERGA" rel="nofollow">https://github.com/hitbio/PERGA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29263/srf-bioinformatics-at-bose-institute-india</guid>
  <pubDate>Thu, 29 Sep 2016 09:39:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF Bioinformatics at Bose Institute, India]]></title>
  <description><![CDATA[
<p>Advt. No. S/DPB(CB)/17/2016-17 <br />Junior Research Assistant/ Senior Research Assistant  Job vacancies in Bose Institute on temporary basis<br />Project Title : “Genome wide transcriptome analysis to identity MYMIV-stress related genomic resources of blackgram”<br />Junior Research Assistant <br />Qualification : Good academic record in B.Sc. and M.Sc. in Botany or Biotechnology from reputed Universities. Must have good practical hand, this should be certified by two Senior/reputed PG teachers on a scale of 10. <br />Desirable : Preference will be given to those who already have some research experience (for at least 2 months). <br />Consolidated Pay : Rs. 16,400/- p.m. <br />Age Limit : Below 28 years (relaxable in case of SC/ST/OBC/Women candidates only as per rules).<br />Senior Research Assistant <br />Qualification : B.Sc. in Biotechnology and M.Sc. in Biotechnology or Bioinformatics. Hands on training in Bioinformatics. At least two Research Publications with Bioinformatics components. <br />Desirable : Preference will be given to the candidates who have previous experience in Next Gen Sequencing data analysis of genomic/transcriptome/miRNA. <br />Consolidated Pay : Rs. 18,700/- p.m.  <br />Age Limit : Below 30 years (relaxable in case of SC/ST/OBC/Women candidates only as per rules).</p>

<p>http://www.boseinst.ernet.in/advertisement.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</guid>
	<pubDate>Tue, 03 Jul 2018 04:09:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</link>
	<title><![CDATA[ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly]]></title>
	<description><![CDATA[With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries.

Texas A&amp;M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory.

Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice.

Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.<p>Address of the bookmark: <a href="http://faculty.cse.tamu.edu/shsze/asplice/" rel="nofollow">http://faculty.cse.tamu.edu/shsze/asplice/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 04:08:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37554/finishersca-repeat-aware-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC:a repeat-aware tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><br>Here is the command to run the tool:</p>
<pre><code>python finisherSC.py destinedFolder mummerPath
</code></pre>
<p>If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.</p>
<pre><code>python finisherSC.py -par 20 destinedFolder mummerPath
</code></pre>
<p>Sometimes, if the names of raw reads and contigs consists of special characters/formats, FinisherSC/MUMmer may not parse them correctly. In that case, you want to have a quick renaming of the names of contigs/reads in contigs.fasta or raw_reads.fasta using the following command.</p>
<pre><code>    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' raw_reads.fasta &gt; newRaw_reads.fasta
    cp newRaw_reads.fasta raw_reads.fasta
    perl -pe 's/&gt;[^\$]*$/"&gt;Seg" . ++$n ."\n"/ge' contigs.fasta &gt; newContigs.fasta
    cp newContigs.fasta contigs.fasta</code></pre><p>Address of the bookmark: <a href="https://github.com/kakitone/finishingTool" rel="nofollow">https://github.com/kakitone/finishingTool</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29410/entrez-direct-e-utilities-on-the-unix-command-line</guid>
	<pubDate>Wed, 19 Oct 2016 08:06:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29410/entrez-direct-e-utilities-on-the-unix-command-line</link>
	<title><![CDATA[Entrez Direct: E-utilities on the UNIX Command Line]]></title>
	<description><![CDATA[<p>Entrez Direct (EDirect) is an advanced method for accessing the NCBI's suite of interconnected databases (publication, sequence, structure, gene, variation, expression, etc.) from a UNIX terminal window. Functions take search terms from command-line arguments. Individual operations are combined to build multi-step queries. Record retrieval and formatting normally complete the process.</p>
<p>EDirect also provides an argument-driven function that simplifies the extraction of data from document summaries or other results that are returned in structured XML format. This can eliminate the need for writing custom software to answer ad hoc questions. Queries can move seamlessly between EDirect commands and UNIX utilities or scripts to perform actions that cannot be accomplished entirely within Entrez.</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/books/NBK179288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/books/NBK179288/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29578/plink2</guid>
	<pubDate>Thu, 27 Oct 2016 11:24:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29578/plink2</link>
	<title><![CDATA[PLINK2]]></title>
	<description><![CDATA[<p><span>This is a comprehensive update to Shaun Purcell's&nbsp;</span><a href="http://pngu.mgh.harvard.edu/~purcell/plink/">PLINK</a><span>&nbsp;command-line program, developed by&nbsp;</span><a href="mailto:chrchang@alumni.caltech.edu">Christopher Chang</a><span>&nbsp;with support from the&nbsp;</span><a href="http://www.niddk.nih.gov/">NIH-NIDDK</a><span>'s Laboratory of Biological Modeling, the&nbsp;</span><a href="http://research.mssm.edu/statgen/">Purcell Lab</a><span>&nbsp;at Mount Sinai School of Medicine, and others. (</span><a href="https://www.cog-genomics.org/plink2/#new">What's new?</a><span>) (</span><a href="https://www.cog-genomics.org/plink2/credits">Credits.</a><span>) (</span><a href="http://www.gigasciencejournal.com/content/4/1/7">Methods paper.</a><span>)</span></p><p>Address of the bookmark: <a href="https://www.cog-genomics.org/plink2/" rel="nofollow">https://www.cog-genomics.org/plink2/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29624/information-officer-at-iiar-gujarat</guid>
  <pubDate>Fri, 04 Nov 2016 05:19:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Information Officer at IIAR, Gujarat]]></title>
  <description><![CDATA[
<p>Walk in interview at 10.30 am on Nov 11th, 2016 for the following position at Distributed Information Sub-Centre (DISC) established by Dept. Of Biotechnology, Govt. of India at Indian Institute of Advanced Research, Gandhinagar, Gujarat</p>

<p>Position (scale), qualifications and experience</p>

<p>1. Information Officer (Rs 8000-275-13500): one post <br />Qualifications and experience: MCA, Post-Graduate in any field of biosciences, bioinformatics with at least two years of experience in working in a bioinformatics setup and good knowledge of linux operating system and computer networking.</p>

<p>General terms and conditions: <br />1. The above engagements is presently till March 31st, 2017. However on extension of project grant and satisfactory performance of the candidate, your services can be extended beyond March 31st, 2017 based on the terms and conditions of extension of project grant.</p>

<p>2. It is not an appointment with the institute and will not confer any right to the incumbent to any claim implicit or explicit on any position.</p>

<p>3.No TA/DA will be paid for attending the interview. Outstation candidates have to make their own arrangement for their stay.</p>

<p>4.Candidates, appearing in the walk-in interview are requested to bring the hard copy of application addressed to Dr. Anju Pappachan with latest photograph, CV mentioning qualifications, work experience and name of two referees and one page write up as to why you would like to join the project.</p>

<p>Address: <br />Dr. Anju Pappachan <br />Indian Institute of Advanced Research (IIAR), <br />University  and Institute of Advanced Research, <br />The Puri Foundation for Education in India, <br />Koba Institutional Area, <br />Gandhinagar- 382 007, Gujarat, India. Contact no. 079-30514152 <br />e-mail- anju@iiar.res.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</guid>
	<pubDate>Tue, 09 Jun 2020 05:21:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41843/stringtie-transcript-assembly-and-quantification-for-rna-seq</link>
	<title><![CDATA[StringTie Transcript assembly and quantification for RNA-Seq]]></title>
	<description><![CDATA[<p><strong>StringTie</strong><span>&nbsp;is a fast and highly efficient assembler of RNA-Seq alignments into potential transcripts. It uses a novel network flow algorithm as well as an optional&nbsp;</span><em>de novo</em><span>&nbsp;assembly step to assemble and quantitate full-length transcripts representing multiple splice variants for each gene locus. Its input can include not only alignments of short reads that can also be used by other transcript assemblers, but also alignments of longer sequences that have been assembled from those reads. In order to identify differentially expressed genes between experiments, StringTie's output can be processed by specialized software like&nbsp;</span><a href="https://github.com/alyssafrazee/ballgown">Ballgown</a><span>,&nbsp;</span><a href="http://cole-trapnell-lab.github.io/cufflinks/cuffdiff/index.html">Cuffdiff</a><span>&nbsp;or other programs (DESeq2, edgeR, etc.).</span></p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/" rel="nofollow">https://ccb.jhu.edu/software/stringtie/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29644/junior-research-fellow-at-rajiv-gandhi-centre-for-biotechnology-thiruvananthapuram</guid>
  <pubDate>Mon, 07 Nov 2016 10:27:06 -0600</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow at Rajiv Gandhi Centre for Biotechnology, Thiruvananthapuram]]></title>
  <description><![CDATA[
<p>Adv. # 22/ 2016<br />Applications are invited from suitable candidates for one position of Junior Research Fellow in a DST funded bioinformatics research project entitled "Major gene influxes in microbial genome evolution" in the Laboratory of Dr. Shijulal Nelson-Sathi at Rajiv Gandhi Centre for Biotechnology, Thiruvananthapuram.</p>

<p>ESSENTIAL QUALIFICATIONS:<br />We are looking for a motivated candidate with keen interest in bioinformatics and microbial genome evolution. The candidate must have a Master’s Degree in Bioinformatics, Computational Biology, Computer Science, Microbiology, Biology or a related field with good academic record.</p>

<p>DESIRABLE QUALIFICATIONS<br />Hands on research experience on handling next generation sequencing data and phylogenetic reconstruction methods. Excellent programming skills (Perl/Python/Java/Php) and experience in working on Unix/Linux platform is preferred. Furthermore; good knowledge is required in statistics (R/Matlab) and the application of bioinformatics analysis tools.</p>

<p>AGE:<br />Below 28 years as on 15th November, 2016.</p>

<p>EMOLUMENTS:<br />Rs. 25,000 + 20% HRA for NET/GATE qualified and Post Graduate in Professional Degree course qualified candidates and <br />Rs. 12,000/- + 20% HRA for others.</p>

<p>DURATION:<br />Initial appointment will be given for one year and further extension will be based on the performance till termination of the project.<br />Only those fulfilling the above criteria need apply and will be called for interview. In the event of more than 10 candidates being short-listed by screening the applications, a written test will be conducted before the selection interview and only those who are successful in the written test will be interviewed. No TA/ DA will be given for appearing in the interview.</p>

<p>Suitably qualified candidates may send applications in the prescribed format (Download here) with a photograph, a copy of full resume indicating the percentage of Marks obtained and attested photocopies of credentials &amp; experience to reach the undersigned on or before 15th November, 2016. Envelopes must be superscripted with abbreviated title of the project, advertisement number and job title. Selection to the position will not entitle the candidate to any future positions at RGCB (permanent or otherwise). As with all project positions at RGCB, the position will be co terminus with end of the project.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40897/mec-contig-misassembly-correction</guid>
	<pubDate>Tue, 04 Feb 2020 23:40:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40897/mec-contig-misassembly-correction</link>
	<title><![CDATA[MEC: Contig Misassembly Correction]]></title>
	<description><![CDATA[<p><span>MEC, to identify and correct misassemblies in contigs. Firstly, MEC takes fragment coverage as the feature to detect the candidate misassemblies. Then, it can distinguish a large number of false positives from the candidate misassemblies based on the distribution of paired-end reads and the statistical analysis of GC-contents. We apply MEC to four real contig datasets, and carry out experiments to analyze the influence of MEC on scaffolding results, which shows that MEC can reduce misassemblies effectively and result in quantitative improvements in scaffolding quality. MEC is publicly available for download at https://github.com/bioinfomaticsCSU/MEC.</span></p><p>Address of the bookmark: <a href="https://github.com/bioinfomaticsCSU/MEC" rel="nofollow">https://github.com/bioinfomaticsCSU/MEC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>