<?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/40715?offset=590</link>
	<atom:link href="https://bioinformaticsonline.com/related/40715?offset=590" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33887/gview-a-java-application-for-viewing-and-examining-prokaryotic-genomes-in-a-circular-or-linear-context</guid>
	<pubDate>Fri, 14 Jul 2017 07:47:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33887/gview-a-java-application-for-viewing-and-examining-prokaryotic-genomes-in-a-circular-or-linear-context</link>
	<title><![CDATA[GView: A Java application for viewing and examining prokaryotic genomes in a circular or linear context]]></title>
	<description><![CDATA[<p>GView is a Java application for viewing and examining prokaryotic genomes in a circular or linear context. It accepts standard sequence file formats and an optional style specification file to generate customizable, publication quality genome maps in bitmap and scalable vector graphics formats. GView features an interactive pan-and-zoom interface, a command-line interface for incorporation in genome analysis pipelines, and a public Application Programming Interface for incorporation in other Java applications.</p>
<p><strong>Availability:</strong>&nbsp;GView is a freely available application licensed under the GNU Public License. The application, source code, documentation, file specifications, tutorials and image galleries are available at&nbsp;<a href="http://gview.ca/" target="pmc_ext">http://gview.ca</a></p>
<p><strong>Contact:</strong>&nbsp;<a href="mailto:dev@null">ac.cg.cpsa-cahp@raalesmod.nav.yrag</a></p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2995121/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</guid>
	<pubDate>Wed, 27 Dec 2017 00:04:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34877/recovery-of-complete-genomes-from-metagenomes</link>
	<title><![CDATA[Recovery of complete genomes from metagenomes]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p><strong>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</strong></p>
<p><a href="http://personprofil.aau.dk/120257">Mads Albertsen</a>,&nbsp;<a href="http://ecogenomic.org/users/phil-hugenholtz">Philip Hugenholtz</a>,&nbsp;<a href="http://ecogenomic.org/users/adam-skarshewski">Adam Skarshewski</a>,&nbsp;<a href="http://www.ecogenomic.org/users/gene-tyson">Gene W. Tyson</a>,&nbsp;<a href="http://personprofil.aau.dk/103057">K&aring;re L. Nielsen</a>&nbsp;and&nbsp;<a href="http://personprofil.aau.dk/105842">Per .H. Nielsen</a></p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p><p>Address of the bookmark: <a href="http://madsalbertsen.github.io/multi-metagenome/" rel="nofollow">http://madsalbertsen.github.io/multi-metagenome/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</guid>
	<pubDate>Mon, 14 May 2018 04:02:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36590/digest-in-silico-restriction-digest-of-complete-genomes</link>
	<title><![CDATA[Digest: In silico restriction digest of complete genomes]]></title>
	<description><![CDATA[<p><span>This tool allows to retrieve number of cleavages yielded by commercially available endonucleases in up-to-date sequenced prokaryotic genomes. When the number of fragments is bellow 50, Pulse Field gel Electrophoresis (PFGE) is simulated.</span></p>
<p>A tool for restriction digest of&nbsp;<a href="http://insilico.ehu.eus/restriction/long_seq/">long</a>user's sequences is available.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://insilico.ehu.es/digest/" rel="nofollow">http://insilico.ehu.es/digest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</guid>
	<pubDate>Thu, 09 Aug 2018 17:41:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37520/mmgenome-tools-for-extracting-individual-genomes-from-metagneomes</link>
	<title><![CDATA[mmgenome: Tools for extracting individual genomes from metagneomes]]></title>
	<description><![CDATA[<p>The mmgenome toolbox enables reproducible extraction of individual genomes from metagenomes. It builds on the&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">multi-metagenome</a>&nbsp;concept, but wraps most of the process of extracting genomes in simple R functions. Thereby making the whole process of binning easy and at the same time reproducible through the Rmarkdown format.</p>
<p>The mmgenome R package also facilitates effortless integration with additional data sources and hence should not be seen as "yet another binning method", but rather a package to integrate different binning strategies.</p>
<p>All functions in the mmgenome R package has associated documentation, check it out in R by e.g.&nbsp;<code>?mmplot</code>.</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/mmgenome" rel="nofollow">https://github.com/MadsAlbertsen/mmgenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</guid>
	<pubDate>Thu, 20 Dec 2018 12:03:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38505/allhic-phasing-and-scaffolding-polyploid-genomes-based-on-hi-c-data</link>
	<title><![CDATA[ALLHiC: Phasing and scaffolding polyploid genomes based on Hi-C data]]></title>
	<description><![CDATA[<p><span>The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed a new Hi-C scaffolding pipeline, called ALLHIC, specifically tailored to the polyploid genomes. ALLHIC pipeline contains a total of 5 steps:&nbsp;</span><em>prune</em><span>,&nbsp;</span><em>partition</em><span>,&nbsp;</span><em>rescue</em><span>,&nbsp;</span><em>optimize</em><span>&nbsp;and&nbsp;</span><em>build</em><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tangerzhang/ALLHiC/wiki" rel="nofollow">https://github.com/tangerzhang/ALLHiC/wiki</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40409/haplotypo-a-variant-calling-pipeline-for-phased-genomes</guid>
	<pubDate>Thu, 19 Dec 2019 07:33:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40409/haplotypo-a-variant-calling-pipeline-for-phased-genomes</link>
	<title><![CDATA[HaploTypo: a variant-calling pipeline for phased genomes]]></title>
	<description><![CDATA[<p>An increasing number of phased (i.e. with resolved haplotypes) reference genomes are available. However, most genetic variant calling tools do not explicitly account for haplotype structure. Here, we present HaploTypo, a pipeline tailored to resolve haplotypes in genetic variation analyses. HaploTypo infers the haplotype correspondence for each heterozygous variant called on a phased reference genome.</p>
<div>Availability and Implementation</div>
<p>HaploTypo is implemented in Python 2.7 and Python 3.5, and is freely available at&nbsp;<a href="https://github.com/gabaldonlab/haplotypo" target="">https://github.com/gabaldonlab/haplotypo</a>, and as a Docker image.</p><p>Address of the bookmark: <a href="https://github.com/gabaldonlab/haplotypo" rel="nofollow">https://github.com/gabaldonlab/haplotypo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</guid>
	<pubDate>Wed, 10 Mar 2021 06:13:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42941/csa-a-high-throughput-chromosome-scale-assembly-pipeline-for-vertebrate-genomes</link>
	<title><![CDATA[CSA: A high-throughput chromosome-scale assembly pipeline for vertebrate genomes]]></title>
	<description><![CDATA[<p>The pipeline can use information from scaffolded assemblies (for example from HiC or 10X Genomics), or even from diverged (~65-100 Mya) reference genomes for ordering the contigs and thus support the assembly process. This typically results in improved contig N50 when compared to current state of the art methods.</p>
<p><img src="https://github.com/HMPNK/CSA2.6/raw/master/Fig1.png" alt="image" style="border: 0px;"></p>
<p>For smaller vertebrate genomes (~1 Gbp) chromosome scale assemblies can be achieved within 12h on high-end Desktop computers (Intel i7, 12 CPU threads, 128 GB RAM). Larger mammalian genomes (~3Gbp) can be processed within 15-18 h on server equipment (Xeon, 96 CPU threads, 1TB RAM).</p><p>Address of the bookmark: <a href="https://github.com/HMPNK/CSA2.6" rel="nofollow">https://github.com/HMPNK/CSA2.6</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</guid>
	<pubDate>Wed, 25 Nov 2020 19:44:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</link>
	<title><![CDATA[IRscope: an online program to visualize the junction sites of chloroplast genomes]]></title>
	<description><![CDATA[<p><span>eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences.</span></p><p>Address of the bookmark: <a href="https://sites.google.com/g.hmc.edu/empress/home" rel="nofollow">https://sites.google.com/g.hmc.edu/empress/home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44525/synorth-exploring-the-evolution-of-synteny-and-long-range-regulatory-interactions-in-vertebrate-genomes</guid>
	<pubDate>Mon, 06 May 2024 06:21:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44525/synorth-exploring-the-evolution-of-synteny-and-long-range-regulatory-interactions-in-vertebrate-genomes</link>
	<title><![CDATA[Synorth: exploring the evolution of synteny and long-range regulatory interactions in vertebrate genomes]]></title>
	<description><![CDATA[<p><span>Genomic regulatory blocks are chromosomal regions spanned by long clusters of highly conserved noncoding elements devoted to long-range regulation of developmental genes, often immobilizing other, unrelated genes into long-lasting syntenic arrangements. Synorth&nbsp;</span><a href="http://synorth.genereg.net/" target="_blank">http://synorth.genereg.net/</a><span>&nbsp;is a web resource for exploring and categorizing the syntenic relationships in genomic regulatory blocks across multiple genomes, tracing their evolutionary fate after teleost whole genome duplication at the level of genomic regulatory block loci, individual genes, and their phylogenetic context.</span></p>
<p><span>More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2745767/</span></p><p>Address of the bookmark: <a href="http://synorth.genereg.net/" rel="nofollow">http://synorth.genereg.net/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/843/structural-polymorphism-analysis-from-ngs-data</guid>
  <pubDate>Sat, 13 Jul 2013 17:12:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Structural polymorphism analysis from NGS data]]></title>
  <description><![CDATA[
<p>The LabEx BASC (Biodiversity, Agroecosystems, Society, Climate), a network of 13 laboratories of the Paris-Saclay Scientific Cluster, is seeking a bioinformatician to analyze Next Generation Sequencing (NGS) data analysis. In the context of a flagship project aiming at understanding and improving the adaptive capacity of agroecosystems it will be critical to establish a link between sequence variation, functional variation, gene/protein expression and phenotypic adaptation.</p>

<p>The successful candidate will be in charge of the detection of polymorphisms including structural variants, of the comparison of multiple and diverse genomes of a same species and of the construction of pan- and core-genomes. These challenging tasks will require bioinformatics developments and implementation of methods for accommodating the high level of repetitiveness of complex genomes. The tools will be integrated into pipelines and made available to end-users through the Galaxy platform. The bioinformatician will therefore also have to provide researchers with advices on their experimental designs in order to ensure compliance of produced datasets with pipelines requirements. He/she will be hosted by a bioinformatics/informatics team (7 people) (http://moulon.inra.fr/index.php/fr/equipestransversales/atelier-de-bioinformatique) which has computational facilities and expertise in NGS data analysis, and will benefit as well from national and international collaborative networks (Aplibio http://www.renabi.fr/platforms/aplibio/, Transplant http://transplantdb.eu, AMAIZING http://www.amaizing.fr/).</p>

<p>The position requires a doctoral degree (PhD) in bioinformatics with strong expertise in script writing (Python/Perl) and pipeline development. </p>

<p>Applicants should send a CV and the names of 2 referees willing to provide a letter of recommendation to joets@moulon.inra.fr.</p>
]]></description>
</item>

</channel>
</rss>