<?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=1390</link>
	<atom:link href="https://bioinformaticsonline.com/related/28870?offset=1390" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4873/vveks-lab</guid>
  <pubDate>Thu, 26 Sep 2013 11:11:39 -0500</pubDate>
  <link></link>
  <title><![CDATA[Vvek's Lab]]></title>
  <description><![CDATA[
<p>Broad Area of Research: RNA biology (microRNA, lncRNA), Stem cells, Functional genomics, Epigenomics and Cancer</p>

<p>RNAs, especially non-coding RNAs (such as microRNA, long ncRNAs) are recently identified to be very abundant in mammalian organisms and play some key roles in gene expression regulation, gene silencing, and also implicated in disease progression, stem cell pluripotency etc. Current research activities of our lab include analysis of expression pattern of ncRNAs by microarray and next-gen sequencing data and understanding the role of miRNAs or other regulatory RNAs in various diseases, especially cancer and validation by reporter assays (renilla/luciferase) and other experimental tools.</p>

<p>More @ http://vvekslab.in/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5462/showreel-2008-cortical-studios</guid>
	<pubDate>Sat, 12 Oct 2013 18:33:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5462/showreel-2008-cortical-studios</link>
	<title><![CDATA[Showreel 2008 - Cortical Studios]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/qrReqMKe7Xg" frameborder="0" allowfullscreen></iframe>We are a bioinformatics company that combines 3D animation, multimedia and scientific knowledge to meet your communication needs. With our academic background in the fields of biotechnology and molecular cellbiology and our computer expertise we provide cutting edge 3D animation productions for even the most complex projects. We translate complex scientific information into comprehensible artistic imagery in order to improve communication in the life sciences. Please feel free to contact us with any questions regarding the possibilities for your unique project.

Cortical Studios
Keizersgracht 8
1015 CN
Amsterdam
The Netherlands
info@corticalstudios.nl
www.corticalstudios.nl]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</guid>
	<pubDate>Sat, 25 Nov 2017 08:57:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</link>
	<title><![CDATA[coursera genome assembly tutorial]]></title>
	<description><![CDATA[<p><span>Solutions to Coursera Genome Sequencing (Bioinformatics II)</span></p><p>Address of the bookmark: <a href="https://github.com/iansealy/coursera-assembly" rel="nofollow">https://github.com/iansealy/coursera-assembly</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7813/research-associate-indian-institute-of-spices-research</guid>
  <pubDate>Wed, 08 Jan 2014 10:10:03 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate @ INDIAN INSTITUTE OF SPICES RESEARCH]]></title>
  <description><![CDATA[
<p>INDIAN INSTITUTE OF SPICES RESEARCH<br />(Indian Council of Agricultural Research)<br />Marikunnu P.O., Kozhikode – 673 012, Kerala</p>

<p>Phone No. 0495 2731 410</p>

<p>WALK -IN- TEST CUM INTERVIEW<br />Walk- in- Test cum Interview (based on test) for the selection of Research Associate (Bioinformatics) &amp; Bioinformatic Trainees under the scheme ‘Distributed Information Sub Centre- DISC’ will be held at this Institute as per details indicated below.</p>

<p>Research Associate<br />Date of Interview : 21 -01-2014 at 10.00 A.M<br />Qualifications :<br />a) Essential: Doctorate degree in Bioinformatics or Biotechnology/Life Sciences/Biochemistry with expertise in  Bioinformatics as evidenced by publications.<br />OR Three years research experience after  MVSc/MPharm/ME/MTech with Bioinformatics Specialization.<br />b Desirable: Experience in handling NGS data  Programming skills in Python/Bioperl<br />Emoluments : Rs:22000/- per month + HRA  (higher pay upto Rs.24000/- can be paid depending on the qualifications and experience.<br />Upper age limit : 40 years for Men &amp; 45 years for Women as on date of Interview (Upper Age limits are relaxable for SC, ST and OBC candidates as per Govt. of India norms (at present 5 years for SC/ST and 3 years for OBC)<br />Duration of Project : Till the closure of the project.</p>

<p>General Terms and conditions<br />1. The above positions are purely on temporary basis and is co-terminus with the closure of the project. There is no provision of re-employment after termination of project.<br />The selected candidate will not have any right for claiming pay scale or absorption<br />against any regular post being vacant on a later date at this Institute.<br />2 . No TA/DA will be paid for attending the Interview.<br />3. Canvassing in any form will lead to cancellation of candidate.<br />4. The decision of Director, IISR would be final and binding in all aspects.<br />5. Candidates will not be permitted to enter the Examination Hall after 10.00 A.M.<br />6. Candidates who secure the minimum marks prescribed by the Institute in written test  only will be eligible for calling for the interview. The number of candidates to be  called for the interview will be decided by the Director of the Institute.<br />7 Those who do not possess original Degree/PG certificate or Provisional certificate will not be allowed to attend the Test/Interview.</p>

<p>Note: All relevant certificates (in original) and bio data, No objection certificate in case he/she is employed elsewhere and experience certificate in original (if any) need to be produced at the time of interview.<br />Advertisement: http://spicebioinfo.res.in/downloads/DISC-Website.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</guid>
	<pubDate>Wed, 06 Dec 2017 02:08:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</link>
	<title><![CDATA[COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly]]></title>
	<description><![CDATA[<p><span>An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30&times; simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.</span></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/cope" rel="nofollow">ftp://ftp.genomics.org.cn/pub/cope</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4947/experimental-scientific-officer-bioinformatics</guid>
  <pubDate>Fri, 27 Sep 2013 11:09:44 -0500</pubDate>
  <link></link>
  <title><![CDATA[Experimental Scientific Officer (Bioinformatics)]]></title>
  <description><![CDATA[
<p>Closing Date:  8 October 2013</p>

<p>Salary:   £27,854 - £29,541, with progression to £36,298</p>

<p>You will perform cutting edge computational biology within the Faculty of Medical Sciences, with a particular focus on the Northern Institute for Cancer Research (NICR), and contribute to the delivery of Faculty wide programmes of training, analytical services and skill transfer between Faculty Institutes.</p>

<p>You will have a relevant first degree or equivalent qualifications and/or experience in a relevant scientific/technical role, together with previous specialist experience at a senior level in bioinformatics. A PhD is desirable.</p>

<p>This position is part of the Bioinformatics Support Unit but physically located for the majority of the time in the NICR buildings.</p>

<p>Tenable for three years.</p>

<p>Informal enquiries to unit head Dr Simon Cockell: 0191 222 7253; simon.cockell@ncl.ac.uk</p>

<p>For more information visit @ https://www15.i-grasp.com/fe/tpl_newcastle02.asp?s=4A515F4E5A565B1A&amp;jobid=50667,2552984041&amp;key=70203469&amp;c=725434237887&amp;pagestamp=sepghtjhowdqpsxuyn</p>

<p>You can also find several other jobs @http://bsu.ncl.ac.uk/support/recruitment/</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/researchlabs/view/5220/paolo-ruggerone-lab</guid>
  <pubDate>Tue, 01 Oct 2013 14:15:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[Paolo Ruggerone Lab]]></title>
  <description><![CDATA[
<p>Efflux pumps (RND family)</p>

<p>Functioning of efflux systems in Gram-negative bacteria<br />Determinants of the compound-efflux system interactions<br />Action of inhibitors on efflux systems<br />Structural and dynamical features of the efflux systems</p>

<p>TatA<br />Assembly of the TatA system<br />Study of the dynamical features of the charge zipper</p>

<p>Methods<br />Setup of a kinetic Monte Carlo (KMC) scheme to study the flux of antibiotics through porins and efflux systems<br />Setup of protocol to integrate MD results in a ligand-based approach</p>

<p>Viral inhibitors<br />Interactions of selected compounds with RNA-dependent RNA polymerases (RdRps) of HCV and BVDV<br />Assessment of the role of mutations in RdRps<br />Antimicrobial peptides</p>

<p>Interactions of antimicrobial peptides with membranes: structure and dynamics<br />Interactions between antimicrobial peptides in the presence of different membranes<br />Protein-protein interactions<br />Effects of mutations</p>

<p>Lab Page<br />http://www.dsf.unica.it/~paolo/Site/Home.html</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>

</channel>
</rss>