<?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/41814?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/41814?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41485/chromosight-computer-vision-based-program-for-pattern-recognition-in-chromosome-hi-c-contact-maps</guid>
	<pubDate>Mon, 23 Mar 2020 06:20:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41485/chromosight-computer-vision-based-program-for-pattern-recognition-in-chromosome-hi-c-contact-maps</link>
	<title><![CDATA[chromosight: Computer vision based program for pattern recognition in chromosome (Hi-C) contact maps]]></title>
	<description><![CDATA[<p>Python package to detect chromatin loops (and other patterns) in Hi-C contact maps.</p>
<p>Stable version with pip:</p>
<div>
<pre>pip3 install --user chromosight</pre>
</div>
<p>Stable version with conda:</p>
<div>
<pre>conda install -c bioconda -c conda-forge chromosight</pre>
</div>
<p>or, if you want to get the latest development version:</p>
<pre><code>pip3 install --user -e git+https://github.com/koszullab/chromosight.git@master#egg=chromosight</code></pre><p>Address of the bookmark: <a href="https://github.com/koszullab/Chromosight" rel="nofollow">https://github.com/koszullab/Chromosight</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41405/sequence-tube-maps-displays-multiple-genomic-sequences-in-the-form-of-a-tube-map</guid>
	<pubDate>Wed, 11 Mar 2020 01:12:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41405/sequence-tube-maps-displays-multiple-genomic-sequences-in-the-form-of-a-tube-map</link>
	<title><![CDATA[Sequence Tube Maps: displays multiple genomic sequences in the form of a tube map]]></title>
	<description><![CDATA[<p>A JavaScript module for the visualization of genomic sequence graphs. It automatically generates a "tube map"-like visualization of sequence graphs which have been created with <a href="https://github.com/vgteam/vg">vg</a>. (<a href="https://github.com/vgteam/vg">https://github.com/vgteam/vg</a>)</p>
<h3>Link to working demo: <a href="https://vgteam.github.io/sequenceTubeMap/">https://vgteam.github.io/sequenceTubeMap/</a></h3>
<p><img src="https://raw.githubusercontent.com/vgteam/sequenceTubeMap/master/images/header.png" alt="image" style="border: 0px; border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/vgteam/sequenceTubeMap" rel="nofollow">https://github.com/vgteam/sequenceTubeMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34461/drawid-user-friendly-java-software-for-chromosome-measurements-and-idiogram-drawing</guid>
	<pubDate>Mon, 27 Nov 2017 16:03:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34461/drawid-user-friendly-java-software-for-chromosome-measurements-and-idiogram-drawing</link>
	<title><![CDATA[DRAWID: user-friendly Java software for chromosome measurements and idiogram drawing]]></title>
	<description><![CDATA[<p>"DRAWID has number of advantages including a user-friendly interactive interface, possibility for simultaneous chromosome and FISH/GISH/banding signal measurement and idiogram drawing as well as number of useful functions facilitating the procedure of chromosome analysis," explain the scientists.</p>
<p>"The output of the program is Microsoft XL table and publish-ready idiogram picture."</p>
<div>
<p>Find their paper openly published with us at:&nbsp;<a href="https://doi.org/10.3897/compcytogen.v11i4.20830" target="_blank">https://doi.org/10.3897/compcytogen.v11i4.20830</a></p>
</div><p>Address of the bookmark: <a href="https://compcytogen.pensoft.net/articles.php?id=20830" rel="nofollow">https://compcytogen.pensoft.net/articles.php?id=20830</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38210/skesa-strategic-k-mer-extension-for-scrupulous-assemblies</guid>
	<pubDate>Wed, 14 Nov 2018 04:45:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38210/skesa-strategic-k-mer-extension-for-scrupulous-assemblies</link>
	<title><![CDATA[SKESA: strategic k-mer extension for scrupulous assemblies]]></title>
	<description><![CDATA[<p><span>SKESA is a DeBruijn graph-based de-novo assembler designed for assembling reads of microbial genomes sequenced using Illumina. Comparison with SPAdes and MegaHit shows that SKESA produces assemblies that have high sequence quality and contiguity, handles low-level contamination in reads, is fast, and produces an identical assembly for the same input when assembled multiple times with the same or different compute resources. </span></p>
<p><span>Source code for SKESA is freely available at&nbsp;</span><span><a href="https://github.com/ncbi/SKESA/releases"><span>https://github.com/ncbi/SKESA/releases</span></a></span><span>.</span></p>
<p>Research Paper&nbsp;@ <a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-018-1540-z">Link</a></p>
<p><span><span>SKESA algorithm are as follows:</span><br></span></p>
<p><span><img src="https://media.springernature.com/lw785/springer-static/image/art%3A10.1186%2Fs13059-018-1540-z/MediaObjects/13059_2018_1540_Fig4_HTML.png" alt="image" width="785" height="984" style="border: 0px; border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/ncbi/SKESA/releases" rel="nofollow">https://github.com/ncbi/SKESA/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23924/embl-postdoc-position-in-bacterial-gene-gain-loss</guid>
  <pubDate>Thu, 20 Aug 2015 14:09:21 -0500</pubDate>
  <link></link>
  <title><![CDATA[EMBL Postdoc position in Bacterial Gene Gain Loss]]></title>
  <description><![CDATA[
<p>A post-doctoral fellowship is available in the research groups of Nick Goldman (EBI) and John Welch (Genetics Department, Cambridge University) under the EMBL-EBI / Cambridge Computational Biomedical Postdoctoral Fellowship scheme.</p>

<p>The project is on bacterial gene gain and loss and emerging pathogenicity, and is described in full here: https://www.ebi.ac.uk/research/postdocs/ebpods/projects/goldman-welch-2015 . The EMBL-EBI / Cambridge Computational Biomedical Postdoctoral (“EBPOD”) </p>

<p>The closing date for applications is 3 September 2015. Nick Goldman EMBL-European Bioinformatics Institute Nick Goldman </p>

<p>More at https://www.ebi.ac.uk/research/postdocs/ebpods/projects/goldman-welch-2015</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10262/research-fellow-phd-candidate-in-computational-biology-%E2%80%93-2-positions</guid>
  <pubDate>Fri, 25 Apr 2014 20:19:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research fellow (PhD candidate) in computational biology – 2 positions]]></title>
  <description><![CDATA[
<p>At the Department of Informatics two 4-year positions as research fellow are available in the field of computational biology connected to the Computational Biology Unit. The positions are linked to the project “Integrated genomics - linking transcriptional and translational regulation over developmental time” supported by the Bergen Research Foundation</p>

<p>The fate of a cell is ultimately the product of the regulation of its genes. Gene regulation is a coordinated process acting at multiple levels of which transcription and translation are the most prominent. The Valen group is dedicated to the fundamental question of how transcription and translation is integrated to obtain the desired protein abundance. The recent development of high-throughput next generation sequencing techniques to monitor both active translation and transcription has made it possible to study this connection at the genome scale.</p>

<p>This project aims to elucidate the links between regulation of translation and transcription. The applicant will analyze next generation sequencing data and model gene regulation on a genome-wide level to identify the features that affect the translational output of transcripts. The work will be done in close collaboration with experimental scientists who will test the predictions of the computational models.</p>

<p>Additional information on the position can be obtained by contacting Eivind Valen (eivind.valen@ii.uib.no).</p>

<p>The research fellow must take part in the University’s approved PhD program leading to the degree within a time limit of 3 years. Application for admission to the PhD program, including a project plan outline for the training module, will be worked out in collaboration with the research group in question.</p>

<p>In total, the fellowship period is 4 years, 25 % of this will be allocated to teaching and/or administrative duties. The fellowship period may be reduced if the successful applicant has held previous employment as a research fellow or similar.</p>

<p>http://www.jobbnorge.no/en/available-jobs/job/102235/research-fellow-phd-candidate-in-computational-biology-2-positions</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</guid>
	<pubDate>Wed, 20 Aug 2014 21:57:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</link>
	<title><![CDATA[The 8000 years old Tibetian gene mutation !!!]]></title>
	<description><![CDATA[<p>A new study has provided insight into how gene mutation around 8,000 years ago helped Tibetans' to survive in the thin air on the Tibetan Plateau, where an average elevation is of 14,800 feet.<br /><br />A study led by University of Utah scientists is the first to find a genetic cause for the adaptation, a single DNA base pair change that dates back 8,000 years and demonstrate how it contributes to the Tibetans' ability to live in low oxygen conditions.</p><p>About 8,000 years ago, the gene EGLN1 changed by a single DNA base pair. Today, a relatively short time later on the scale of human history, 88 percent of Tibetans have the genetic variation, and it was virtually absent from closely related lowland Asians. The findings indicate the genetic variation endows its carriers with an advantage.<br /><br />In those without the adaptation, low oxygen caused their blood to become thick with oxygen-carrying red blood cells, an attempt to feed starved tissues, which could cause long-term complications such as heart failure. The researchers found that the newly identified genetic variation protected Tibetans by decreasing the over-response to low oxygen.</p><p>Reference: http://www.nature.com/nature/journal/v512/n7513/abs/nature13408.html</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/26499/katju-lab</guid>
  <pubDate>Fri, 26 Feb 2016 03:25:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Katju Lab]]></title>
  <description><![CDATA[
<p>TheLab seek to understand the genetic factors contributing to genomic variation and phenotypic diversity.  To this end, we employ molecular and bioinformatic tools to study evolutionary processes at the level of populations, both experimental and natural, and genomes.  Our research interests encompass a wide range of topics, including the evolution of organellar and nuclear genomes, gene duplication and the origin of novel function, and the fitness and phenotypic consequences of mutation in evolution. For details regards ongoing projects, please see the Research page.</p>

<p>http://katjulab.com/research.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</guid>
	<pubDate>Fri, 26 Aug 2016 06:00:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</link>
	<title><![CDATA[GeneValidator - Identify problems with predicted genes]]></title>
	<description><![CDATA[<p>GeneValidator helps in identifing problems with gene predictions and provide useful information extracted from analysing orthologs in BLAST databases. The results produced can be used by biocurators and researchers who need accurate gene predictions.</p>
<p>If you would like to use GeneValidator on a few sequences, see our online&nbsp;<a href="http://genevalidator.sbcs.qmul.ac.uk/">GeneValidator Web App</a>&nbsp;-<a href="http://genevalidator.sbcs.qmul.ac.uk/">http://genevalidator.sbcs.qmul.ac.uk</a>.</p>
<p>If you use GeneValidator in your work, please cite us as follows:</p>
<blockquote>
<p><a href="http://bioinformatics.oxfordjournals.org/content/early/2016/02/26/bioinformatics.btw015">Dragan M<span>&Dagger;</span>, Moghul MI<span>&Dagger;</span>, Priyam A, Bustos C &amp; Wurm Y. 2016. GeneValidator: identify problems with protein-coding gene predictions.&nbsp;<em>Bioinformatics</em>, doi: 10.1093/bioinformatics/btw015</a>.</p>
<p>&nbsp;</p>
</blockquote>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/wurmlab/genevalidator" rel="nofollow">https://github.com/wurmlab/genevalidator</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</guid>
	<pubDate>Fri, 14 Apr 2017 06:27:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</link>
	<title><![CDATA[DeCoSTAR - Detection of Co-evolution]]></title>
	<description><![CDATA[<p><span>DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.</span><br><span>Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the&nbsp;</span><a href="http://mbb.univ-montp2.fr/MBB/download_sources/16__TERA">ecceTERA package</a><span>, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.&nbsp;</span><br><span>DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.</span></p><p>Address of the bookmark: <a href="http://pbil.univ-lyon1.fr/software/DeCoSTAR/" rel="nofollow">http://pbil.univ-lyon1.fr/software/DeCoSTAR/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>