<?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/29235?offset=1530</link>
	<atom:link href="https://bioinformaticsonline.com/related/29235?offset=1530" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/5958/srfjrf-national-institute-of-immunology</guid>
  <pubDate>Wed, 30 Oct 2013 06:45:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF/JRF @ National Institute of Immunology]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT OF WALK-IN-INTERVIEW</p>

<p>NAME OF THE POST : SRF/JRF (Four Posts only)</p>

<p>DURATION : Indicated with the respective project mentioned below:</p>

<p>NAME OF THE PROJECT : As Mentioned below:</p>

<p>1. Serological diversity and molecular characterization of Dichelobector nodusus and development of vaccine against virulent footroot funded by NAIP. (Tenable upto 31.03.2014)</p>

<p>2. Development of oral vaccine against Clostridium perfringenes employing translational fusion of immunodominant epitopes of beta toxin with heat labile entertoxin B funded by DBT. (Tenable upto 25.02.2014)</p>

<p>3. Indo-Norwegian project, “Evaluation of major porins, ompC and ompR of Areomonas hydrophila as potential vaccine candidates and identification and characterization of immune genes of Indian major carp, Labeo rohita” (Tenable upto 31.03.2014)</p>

<p>EDUCATIONAL QUALIFICATIONS: For JRF- M.Sc/M.Tech in any subject of Biological  Sciences/Life Sciences</p>

<p>For SRF- M.Sc/M.Tech in any subject of Biological Sciences/Life Sciences with 2 years of Research Experience.</p>

<p>JOB DESCRIPTION : The Candidate should have experience in gene Expression, protein purification, molecular biology techniques and bioinformatics<br />EMOLUMENTS : SRF: Rs. 18,000/- per month consolidated plus 30% HRA if /NET/GATE qualified otherwise Rs. 14,000/- per month consolidated + 30% HRA.</p>

<p>JRF: Rs. 16,000/- per month consolidated + 30% HRA if NET/GATE qualified otherwise Rs. 12,000/- per month consolidated + 30% HRA</p>

<p>SCIENTIST NAME : Dr. Lalit C. Garg, SS-VII (Gene Regulation Lab)</p>

<p>SCIENTIST’S EMAIL : lalit@nii.ac.in</p>

<p>WALK IN INTERVIEW ON : October 31st, 2013</p>

<p>REGISTRATION OF CANDIDATES: 10.30 AM to 11.00 AM </p>

<p>Advertisement: http://www1.nii.res.in/sites/default/files/project-Dr.Lalit-31oct2013.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</guid>
	<pubDate>Sat, 03 Feb 2018 04:59:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</link>
	<title><![CDATA[MUMmer4: A fast and versatile genome alignment system]]></title>
	<description><![CDATA[<p><span>MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the&nbsp;</span><span>nucmer</span><span>&nbsp;program in MUMmer4 is easily able to handle alignments of large genomes;&nbsp;</span></p><p>Address of the bookmark: <a href="https://mummer4.github.io/" rel="nofollow">https://mummer4.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6104/incob-2014</guid>
  <pubDate>Thu, 07 Nov 2013 17:53:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[InCoB 2014]]></title>
  <description><![CDATA[
<p>The 13th International Conference on Bioinformatics (InCoB 2014) will be held in Novotel Sydney Brighton Beach, Sydney, New South Wales, Australia. This year, the InCoB will be held earlier from 31st July to 2nd August 2014 to run back-to-back with the International Biophysics Congress 2014 at the Brisbane Convention and Exhibition Centre, Queensland (3-7 Aug).</p>

<p>More at http://incob2014.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/6300/list-of-bioinformatics-vacancy-jobs-opportunity-websites</guid>
	<pubDate>Tue, 12 Nov 2013 20:04:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/6300/list-of-bioinformatics-vacancy-jobs-opportunity-websites</link>
	<title><![CDATA[List of Bioinformatics Vacancy, Jobs, Opportunity websites]]></title>
	<description><![CDATA[<p>Bioinformatics cover wide area of biology, and indulge in almost all sort of science related work. Bioinformatician give strong emphasis on open access to biological information as well as Free and Open Source software!!</p>
<p>There are several jobs opening in bioinformatics all around the world, but many of them do not get proper attention due to lack of advertisements, or social connectivity. This bookmark is created for an academic, non-academic, scientists and budding researchers to help and updates the bioinformatics/computational biology jobs links of all know websites around the world.</p>
<p><strong>I also love to stream the live <strong>bioinformatics or Computational biology jobs</strong> updates using Twitter https://twitter.com/search?q=bioinformatics%20jobs&amp;src=typd</strong></p>
<p>Find out here about exciting job opportunities in the life sciences.</p>
<blockquote>
<p>Please add well known bioinformatics jobs websites below in comment section.</p>
</blockquote><p>Address of the bookmark: <a href="http://www.nature.com/naturejobs/science/jobs?utf8=%E2%9C%93&amp;q=bioinformatics&amp;where=&amp;commit=Find+Jobs" rel="nofollow">http://www.nature.com/naturejobs/science/jobs?utf8=%E2%9C%93&amp;q=bioinformatics&amp;where=&amp;commit=Find+Jobs</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36830/crossmap-a-program-for-convenient-conversion-of-genome-coordinates</guid>
	<pubDate>Thu, 31 May 2018 06:00:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36830/crossmap-a-program-for-convenient-conversion-of-genome-coordinates</link>
	<title><![CDATA[CrossMap: a program for convenient conversion of genome coordinates]]></title>
	<description><![CDATA[CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between different assemblies (such as Human hg18 (NCBI36) &lt;&gt; hg19 (GRCh37), Mouse mm9 (MGSCv37) &lt;&gt; mm10 (GRCm38)).

It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.

CrossMap is designed to liftover genome coordinates between assemblies. 

It’s not a program for aligning sequences to reference genome.

We do not recommend using CrossMap to convert genome coordinates between species.<p>Address of the bookmark: <a href="http://crossmap.sourceforge.net" rel="nofollow">http://crossmap.sourceforge.net</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6561/mathomics-lab</guid>
  <pubDate>Tue, 19 Nov 2013 18:17:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[MATHomics Lab]]></title>
  <description><![CDATA[
<p>Mathomics is a collaborative research group of the Center for Mathematical Modeling and the Center for Genome Regulation at University of Chile, created to play a central role in the development of biotechnological projects, providing state of the art bioinformatics and mathematical modeling tools,  allowing to face these problems from the point of view of Systems Biology. </p>

<p>Lab page @ http://www.mathomics.cl/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6817/research-assistant-university-of-hyderabad</guid>
  <pubDate>Mon, 25 Nov 2013 10:21:26 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Assistant @ University of Hyderabad]]></title>
  <description><![CDATA[
<p>University of Hyderabad<br />Repository for Tomato Genomic Resources<br />Department of Plant Sciences<br />Bioinformatics Position in Tomato Functional Genomics </p>

<p>At the Repository for Tomato Genomics Resources, we are working on Tomato Functional Genomics, using TILLING, Insertional Mutagenesis, proteomics, metabolomics approaches to study fruit ripening in tomato. The current aims of the group include using reverse and forward genetics strategies to isolate tomato mutants delayed in ripening, having high lycopene and folate content in tomato fruits and analysis of light and hormonal signal transduction pathways. For recent publications of the group see (Plant Physiol 161: 2085–2101, Plant Physiol 156: 1424-1438; Molecular Plant 3: 854-869; Plant Methods 6: 3; Plant Methods 5:18; Plant Signaling and Behavior 5:11.).</p>

<p>Currently we have one position available in the projects awarded to Prof. R.P. Sharma funded by Dept of Biotechnology. The qualification for this Position is as follows:</p>

<p>Research Assistant: Applicants should have experience in networking using R language and should be able to develop networks using the transcriptome, proteome and metabolite data sets. M.Tech. in Bioinformatics is required. The selected candidate would be paid Rs. 13,000/-pm- consolidated.</p>

<p>Candidates interested in above positions should send a one page statement clearly explaining how their skills are relevant to the position. The candidates should also enclose detailed CV and the name/email id for three referees. The candidates can send their application by email at rameshwar.sharma@uohyd.ac.in and y.sreelakshmi@uohyd.ac.in on or before December 10th, 2013. The position is purely temporary in nature. Shortlisted candidates would be called for interview. No TA/DA would be provided for attending the interview. We also have openings for CSIR-NET JRF candidates for pursuing PhD in above research areas.</p>

<p>Interested candidates with CSIR-NET JRF can send their CV to the above email<br />addresses.</p>

<p>Advertisement:</p>

<p>http://www.uohyd.ac.in/images/recruitment/tomanet_positions_221113.pdf</p>
]]></description>
</item>

</channel>
</rss>