<?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/29384?offset=1240</link>
	<atom:link href="https://bioinformaticsonline.com/related/29384?offset=1240" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6268/project-fellow-national-institute-of-malaria-research</guid>
  <pubDate>Tue, 12 Nov 2013 07:40:51 -0600</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow @ National Institute of Malaria Research]]></title>
  <description><![CDATA[
<p>National Institute of Malaria Research</p>

<p>Sector 8, Dwarka, Delhi -110077</p>

<p>WALK IN INTERVIEW</p>

<p>One position of project fellow is to be filled up in a DRL- funded research project on Molecular and morphological characterization of An. fluviatilis in North-eastern states and bordering areas. The position is purely temporary for one year and can be extended</p>

<p>Essential qualifications</p>

<p>Master’s degree in any branch of Life Sciences with hands on experience in molecular biology and/or bioinformatics.</p>

<p>Age limit: 28 years, (relaxation for SC/ST/OBC candidates as per government of India rules)</p>

<p>Stipend: Rs.12, 000.00 per month (fixed)</p>

<p>Eligible candidates may walk in for an interview on 15 November 2013 at 11 AM at the above mentioned address along with a copy of CV (with a passport size photograph affixed), photocopies of all mark sheets/certificates and originals (for verifications). No TA/DA will be paid for attending the interview .Registration of candidates will start at 10:00AM and end at 10:45 AM.</p>

<p>Advertisement: http://www.mrcindia.org/vacancy/add-4.doc</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6560/the-graveley-lab</guid>
  <pubDate>Tue, 19 Nov 2013 18:02:48 -0600</pubDate>
  <link></link>
  <title><![CDATA[The Graveley Lab]]></title>
  <description><![CDATA[
<p>Research in the Graveley lab is primarily focused on the regulation of alternative splicing and small RNA mediated gene regulation. These are fascinating and extraordinarily important mechanisms by which genes can be regulated. Our long-term goals are to understand how these processes are regulated at a mechanistic level and to understand the logic of these processes in significant biological settings. To achieve these goals, we strive to think outside the box to creatively attack the problems being addressed using a wide variety of approaches that include biochemistry, genetics, imaging, deep sequencing, large-scale RNAi screening and bioinformatics.</p>

<p>Lab page @ http://graveleylab.cam.uchc.edu/Graveley/index.html</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/opportunity/view/7153/phd-student-in-computational-systems-biology</guid>
  <pubDate>Tue, 10 Dec 2013 18:46:05 -0600</pubDate>
  <link></link>
  <title><![CDATA[Ph.D. student in Computational Systems Biology]]></title>
  <description><![CDATA[
<p>Ph.D. student in Computational Systems Biology</p>

<p>Location : The Luxembourg Centre for Systems Biomedicine (LCSB) at the University of Luxembourg, Luxembourg, Luxembourg<br />Deadline for applications : unknown.<br />Description :</p>

<p>The Luxembourg Centre for Systems Biomedicine (LCSB) was created within the Health Technologies Initiative from the Government of Luxembourg as one of the research priorities of the University of Luxembourg. The LCSB is an Interdisciplinary Centre of the University that combines experimental and computational approaches to analyse complex biological systems and disease processes. The Computational Biology Group (CBG) provides the LCSB with a solid infrastructure in developing theoretical framework for computational modeling on biomedical problems, especially in the area of network biology in the context of cellular programming/reprogramming. The CBG group includes researchers with theoretical, computational and wet lab backgrounds, thereby providing an unusually interdisciplinary environment.<br />The Computational Biology Group seeks a highly-skilled Ph.D. student to work on an exciting project on reconstruction and analysis of an integrated gene regulatory network model to elucidate key mechanisms of cellular reprogramming. The model will rely on the integration and mining of diverse transcriptomics and epigenomics data of different cell types from the Central Nervous System. The Ph.D. student is expected to collaborate with other members of the CBG to develop a computational methodology aiming at designing, in-silico, cellular reprogramming events, with a focus on the nervous system. This project will be carried out in collaboration with Prof. Noel Buckleys lab at Kings College London.<br />Requirements of the ideal candidate:<br />Master degree in Bioinformatics, Computer Science, Biology or a related discipline<br />Prior experience in mathematical modelling of biological networks, especially in network inference and analysis<br />Excellent working knowledge in English.<br />.<br />We offer:<br />Full contract for Ph.D. student for three years with possibility of renewal<br />Opportunity to do applied research to medical problems within a highly dynamic research institution (LCSB) and in collaboration with internationally recognized partners<br />An exciting international environment<br />A very competitive salary</p>

<p>For further information, please contact:</p>

<p>Prof. Dr. Antonio del Sol<br />E-mail: antonio.delsol@uni.lu</p>

<p>Applications should contain the following documents:<br />A detailed curriculum vitae<br />cover letter mentioning the reference number<br />description of past research experience and future interests<br />name and addresses of three referees</p>

<p>All applications should be sent preferably in electronic version until December 31st, 2013 to the following address:</p>

<p>Luxembourg Centre for Systems Biomedicine (LCSB)<br />University of Luxembourg<br />7, avenue des Hauts-Fourneaux<br />L-4362 Esch-sur-Alzette<br />Tel: +352-466644-6982 (Office)<br />Email: antonio.delsol@uni.lu<br />http://www.lcsb.lu</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/6836/research-fellow-mendel-laboratory</guid>
  <pubDate>Tue, 26 Nov 2013 00:07:57 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Fellow @ Mendel laboratory]]></title>
  <description><![CDATA[
<p>IRCCS Casa Sollievo della Sofferenza – Mendel laboratory is seeking one talented bioinformatician (Rome)<br />Start date: immediate</p>

<p>Duration: 1 year</p>

<p>Funding Source: Institutional<br />Salary on grant: B2 (€ 22.000/year gross)<br />Contact Person (Referent): Tommaso Mazza<br />Ref. E-Mail: t.mazza@css-mendel.it<br />Tel: +39 06 44160526<br />Fax: +39 06 44160548</p>

<p>Job Description: The bioinformatics unit at IRCCS Casa Sollievo della Sofferenza - Mendel laboratory in Rome is looking for one young PhD bioinformatician with specific experience and/or interest in the analysis of transcriptomic data.</p>

<p>The candidate will be mainly in charge of developing research on a range of hot applications and projects, dealing with microarrays, RNA-Seq and miRNA-Seq data. Main activities will be: (i) data analysis (short-reads mapping, variants call and annotation, functional enrichment analysis of gene expression data); (ii) networks analysis and simulation (artificial knockout, redundancy and lethality analysis, gene set essentiality); (iii) developing of ad-hoc software solutions/routines on clusters of CPUs and GPUs.</p>

<p>The correct cultural background (training in Biology / Computer Science / Statistics or a mix of the three) and a strong interest in working with high throughput data analysis will be considered at the same level of specific experience in the above-mentioned fields.<br />Knowledge of molecular modeling and simulation and one of these languages: python, perl, R, Java, C++, C# is a golden plus. Good knowledge of Scientific English will be positively evaluated for this position, together with good presentation and teamwork skills.</p>

<p>A CV with one professional reference, details on educational background and of the biological and/or bioinformatic and/or data analysis skills and experience should be sent by email for a preliminary selection to: Tommaso Mazza, CSS-Mendel: t.mazza@css-mendel.it</p>

<p>Context<br />Casa Sollievo della Sofferenza is an Institute for hospitalization, care, and scientific research located in San Giovanni Rotondo, Italy. It integrates clinical assistance (with inpatient and outpatient facilities) and research. It has an affiliate institute, CSS-Mendel, located in Rome. Between the two sites, it employs over 100 researchers who focus on genetics. The Center is equipped with state of the art genomics technology (SOLiD 5500XL next generation sequencer, Illumina MiSeq, Affymetrix/Agilent microarray platforms, etc) as well as a dedicated high performance computing facility, a non-conventional workstation of GPUs and a short- and long-term storage disk.</p>

<p>Applications<br />Candidates should send:<br />• a cover letter explaining the role they would like to undertake within the Center, even if it is not listed in this job adv, stating clearly why they would be a good fit to the proposed role, and what they would bring to the Center in terms of expertise, ideas, talent;<br />• a CV including a list of publications;<br />• List of referees;</p>

<p>More at http://www.css-mendel.it/</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/7212/bioinformatics-group-at-boku-university</guid>
  <pubDate>Thu, 12 Dec 2013 17:53:10 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics group at Boku University]]></title>
  <description><![CDATA[
<p>The Bioinformatics group at Boku University has two main areas of interest, underpinning a common goal, the study of complex systems in living organisms. To overcome the engineered redundancies and combinatorial effects prevalent in higher eukaryotes, novel views augmenting the classical gene by gene approaches are required. We combine</p>

<p>1. Work to establish improved quantitative experimental assays (such as microarrays or differential in-gel electrophoresis) and<br />2. Development of modern computational methods (such as hierarchical probabilistic models or integration of heterogeneous data sources)</p>

<p>Lab page @ http://bioinf.boku.ac.at/</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>

</channel>
</rss>