<?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/28870?offset=1540</link>
	<atom:link href="https://bioinformaticsonline.com/related/28870?offset=1540" 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/news/view/5436/the-anatomy-of-successful-computational-biology-software</guid>
	<pubDate>Thu, 10 Oct 2013 11:53:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5436/the-anatomy-of-successful-computational-biology-software</link>
	<title><![CDATA[The anatomy of successful computational biology software]]></title>
	<description><![CDATA[<p>Creators of software widely used in computational biology discuss the factors that contributed to their success</p><p><em>Nature Biotechnology</em><span>&nbsp;spoke with Altschul and several other originators of computational biology software programs widely used today (</span><a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html#t1">Table 1</a><span>). The conversations explored what makes certain software tools successful, the unique challenges of developing them for biological research and how the field of computational biology, as a whole, can move research agendas forward. What follows is an edited compilation of interviews.</span></p><p>Detail @&nbsp;<a href="http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html">http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html</a></p><p>News Source @ Nature</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</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/5663/network-analysis-indian-statistical-institute</guid>
  <pubDate>Wed, 16 Oct 2013 08:06:50 -0500</pubDate>
  <link></link>
  <title><![CDATA[Network Analysis @ Indian Statistical Institute]]></title>
  <description><![CDATA[
<p>Indian Statistical Institute Kolkata invites applications for the following posts</p>

<p>2013 Oct Advertisement from Indian Statistical Institute</p>

<p>Post: Network Analysis</p>

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

<p>Educational Qualifications:</p>

<p>Candidate should have passed BE/B.Tech Or Equivalent in Computer Science / Electrical Engineering / Electronics / Information Technology / Bioinformatics / Biotechnology with throughout first Class<br />Experience:</p>

<p>(details of experience required)<br />Pay Scale: INR Rs.16000-20000/-P.M.</p>

<p>Walk-In-Interview : 22 Oct 2013 at 10:30 AM</p>

<p>Download Official Notification:<br />http://www.isical.ac.in/JobApplicationFiles/MIU_0310201311433700.pdf</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/researchlabs/view/5748/troyanskaya-lab</guid>
  <pubDate>Fri, 18 Oct 2013 10:57:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Troyanskaya  Lab]]></title>
  <description><![CDATA[
<p>In our research, we combine computational methods with an experimental component in a unified effort to develop comprehensive descriptions of genetic systems of cellular controls, including those whose malfunctioning becomes the basis of genetic disorders, such as cancer, and others whose failure might produce developmental defects in model systems.</p>

<p>Research Interest<br />Genomic Data Integration</p>

<p>Microarray Analysis</p>

<p>Gene and Protein Function Prediction</p>

<p>Detection and Analysis of Chromosomal Abnormalities and Functional Evolution</p>

<p>Integration of Computation and Experiments</p>

<p>Identification of Biological Networks and Pathways</p>

<p>Evaluation and Validation of Computational Predictions</p>

<p>Scalable Visualization-Based Data Analysis</p>

<p>More @ http://reducio.princeton.edu/cm/<br />PI page @ http://reducio.princeton.edu/cm/ogt</p>
]]></description>
</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/opportunity/view/5957/assistant-professor-in-molecular-synthesis-for-drug-discovery-and-development-cbmr-lucknow</guid>
  <pubDate>Wed, 30 Oct 2013 06:42:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor in Molecular Synthesis for Drug Discovery and Development @ CBMR, Lucknow]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT FOR FACULTY POSITIONS AT CENTRE OF BIOMEDICAL RESEARCH (CBMR), LUCKNOW</p>

<p>Details of the Positions and Pay Structure:</p>

<p>03 Posts for Assistant Professor in Molecular Synthesis for Drug Discovery and Development</p>

<p>Essential Qualifications and Requirements:</p>

<p>1. PhD in Synthetic Organic Chemistry/Medicinal Chemistry with research publications in high quality international journals and first class grade at the preceding degree from recognised University/Institute in India or abroad with consistently good academic record.<br />2. Three Yrs of Post-doctoral experience in relevant area.<br />3. Below 35 Yrs of age at the time of application</p>

<p>Desirable Experience: Candidates having strong research background in organic synthesis, total synthesis of structurally complex and medicinally important natural products/drugs related to cancer, neurodegenerative diseases (neurotropically active molecules for Alzheimer's, Parkinson’s, dementia etc) and infectious diseases such as malaria, TB etc. will be preferred.</p>

<p>Interested candidates may apply with:</p>

<p>1. Filled up Application Form (download from CBMR Website: http://www.cbmr.res.in) along with the Cover Letter, Curriculum Vitae including academic record (Bachelor degree onwards), awards, honours, list of Publications and reprints of 5 best publications.<br />2. Proposed research plan (max 3-4 pages).<br />3. Names and address (with valid e-mail and Phone number) of at least 3 academic referees.<br />4. Online Payment Receipt with transaction reference no. of Rs. 1000/- (USD 100 or equivalent foreign currency) on following details.<br />Account Number: 30054847814 Name: Director, Centre of Biomedical Research<br />Bank: STATE BANK OF INDIA, SGPGI Campus Branch, LUCKNOW</p>

<p>IFSC Code: SBIN0007789<br />MICR No: 22602034</p>

<p>Applications can be sent by registered/speed post or by e-mail to the following address:</p>

<p>The Director,<br />Centre of Biomedical Research (CBMR),<br />Sanjay Gandhi PGI Campus,<br />Raebareli Road, Lucknow-226014<br />e-mail: cbmr.admin@cbmr.res.in,<br />gp.pandey@cbmr.res.in</p>

<p>More Info:</p>

<p>http://www.cbmr.res.in/career/Advertisement%20for%20the%20post%20of%20Professors%20and%20Assistant%20Professors.pdf</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/24041/junior-bioinformatic-position</guid>
  <pubDate>Wed, 26 Aug 2015 05:35:28 -0500</pubDate>
  <link></link>
  <title><![CDATA[Junior Bioinformatic position]]></title>
  <description><![CDATA[
<p>Junior Bioinformatic position in the laboratory of Inflammation and immunology in cardiovascular pathologies at Humanitas:</p>

<p>We are seeking a highly motivated young PhD student with strong interest in high throughput data analysis.<br />Detailed descriptions of our recent research activities may be found here:<br />http://www.humanitas-research.org/condorelli-gianluigi-md-phd/</p>

<p>Position is available starting from October/November. A probationary period of one month will be required.<br /> <br />Please send a CV along with a cover letter stating the reasons for applying and contact details of one or more referees to Dr. Paolo Kunderfranco (paolo.kunderfranco@humanitasresearch.it).</p>
]]></description>
</item>

</channel>
</rss>