<?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/29917?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/29917?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30538/gkno</guid>
	<pubDate>Tue, 17 Jan 2017 03:35:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30538/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>More at&nbsp;http://gkno.me/</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30829/mercator</guid>
	<pubDate>Mon, 06 Feb 2017 04:20:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30829/mercator</link>
	<title><![CDATA[Mercator]]></title>
	<description><![CDATA[<p><span>Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:</span></p>
<ul>
<li>For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.</li>
<li>Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refBLAT">BLAT</a>&nbsp;to do this all-vs-all comparison with alignments being performed in protein space.</li>
<li>Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.</li>
<li>Identify cliques in this graph. These cliques are potential anchors to be used in the map.</li>
<li>Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form&nbsp;runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.</li>
<li>The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refMAVID">MAVID</a>) to do a detailed alignment of each orthologous segment.</li>
</ul>
<p>https://www.biostat.wisc.edu/~cdewey/mercator/</p><p>Address of the bookmark: <a href="https://www.biostat.wisc.edu/~cdewey/mercator/" rel="nofollow">https://www.biostat.wisc.edu/~cdewey/mercator/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</guid>
	<pubDate>Mon, 27 Feb 2017 09:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</link>
	<title><![CDATA[PBSuite: Software for Long-Read Sequencing Data from PacBio]]></title>
	<description><![CDATA[<p><span>PBJelly - the genome upgrading tool.&nbsp;</span><br><span>PBHoney - the structural variation discovery tool&nbsp;</span><br><br><span>Both are contained within the PBSuite code found in downloads.</span><br><br><span>----- PBJelly -----</span><br><span>Read The Paper&nbsp;</span><br><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768" target="_blank">http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768</a><br><br><span>PBJelly is a highly automated pipeline that aligns long sequencing reads (such as PacBio RS reads or long 454 reads in fasta format) to high-confidence draft assembles. PBJelly fills or reduces as many captured gaps as possible to produce upgraded draft genomes.&nbsp;</span><br><br><span>----- PBHoney -----</span><br><span>Read The Paper</span><br><a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a><br><br><span>PBHoney is an implementation of two variant-identification approaches designed to exploit the high mappability of long reads (i.e., greater than 10,000 bp). PBHoney considers both intra-read discordance and soft-clipped tails of long reads to identify structural variants.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/pb-jelly/" rel="nofollow">https://sourceforge.net/projects/pb-jelly/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</guid>
	<pubDate>Fri, 03 Mar 2017 10:14:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</link>
	<title><![CDATA[Multi-metagenome assembly]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes<br><br>Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, K&aring;re L. Nielsen and Per .H. Nielsen</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="https://github.com/MadsAlbertsen/multi-metagenome" rel="nofollow">https://github.com/MadsAlbertsen/multi-metagenome</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31526/sequenceserver</guid>
	<pubDate>Fri, 10 Mar 2017 08:51:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31526/sequenceserver</link>
	<title><![CDATA[sequenceserver]]></title>
	<description><![CDATA[<p><span>SequenceServer lets you rapidly set up a BLAST+ server with an intuitive user interface for use locally or over the web.</span></p>
<p><span><span>More at&nbsp;</span><a href="http://sequenceserver.com/">http://sequenceserver.com</a><span>.</span></span></p><p>Address of the bookmark: <a href="https://github.com/wurmlab/sequenceserver" rel="nofollow">https://github.com/wurmlab/sequenceserver</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32190/dbg2olcefficient-assembly-of-large-genomes-using-long-erroneous-reads-of-the-third-generation-sequencing-technologies</guid>
	<pubDate>Wed, 19 Apr 2017 10:09:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32190/dbg2olcefficient-assembly-of-large-genomes-using-long-erroneous-reads-of-the-third-generation-sequencing-technologies</link>
	<title><![CDATA[DBG2OLC:Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies]]></title>
	<description><![CDATA[<p>DBG2OLC:Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies</p>
<p>Our work is published in Scientific Reports:</p>
<p>Ye, C. et al. DBG2OLC: Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies. Sci. Rep. 6, 31900; doi: 10.1038/srep31900 (2016).</p>
<p><a href="http://www.nature.com/articles/srep31900">http://www.nature.com/articles/srep31900</a></p>
<p>The manual can be downloaded from:</p>
<p><a href="https://github.com/yechengxi/DBG2OLC/raw/master/Manual.docx">https://github.com/yechengxi/DBG2OLC/raw/master/Manual.docx</a></p>
<p>To use precompiled versions,please go to:</p>
<p><a href="https://github.com/yechengxi/DBG2OLC/tree/master/compiled">https://github.com/yechengxi/DBG2OLC/tree/master/compiled</a></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/yechengxi/DBG2OLC" rel="nofollow">https://github.com/yechengxi/DBG2OLC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</guid>
	<pubDate>Fri, 05 May 2017 06:11:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</link>
	<title><![CDATA[Bacterial genome assembly !!]]></title>
	<description><![CDATA[<p>This tutorial will serve as an example of how to use free and open-source genome assembly and secondary scaffolding tools to generate high quality assemblies of&nbsp;bacterial sequence data. The bacterial sample used in this tutorial will be referred&nbsp;to simply&nbsp;as &ldquo;Species&rdquo; since it is&nbsp;live data. This data is paired-end data, meaning that there are forward and reverse reads, which we will designate as Sample_R1.fastq and Sample_R2.fastq, respectively.</p>
<p>https://github.com/jennomics/WorkflowPaper/blob/master/Genome%20Assembly%20and%20Annotation.md</p><p>Address of the bookmark: <a href="http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/" rel="nofollow">http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44472/pipesnake-bioinformatics-best-practice-analysis-pipeline-for-phylogenomic-reconstruction</guid>
	<pubDate>Wed, 21 Feb 2024 06:19:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44472/pipesnake-bioinformatics-best-practice-analysis-pipeline-for-phylogenomic-reconstruction</link>
	<title><![CDATA[pipesnake: bioinformatics best-practice analysis pipeline for phylogenomic reconstruction]]></title>
	<description><![CDATA[<p dir="auto"><span>ausarg/pipesnake</span>&nbsp;is a bioinformatics best-practice analysis pipeline for phylogenomic reconstruction starting from short-read 'second-generation' sequencing data.</p>
<p dir="auto">The pipeline is built using&nbsp;<a href="https://www.nextflow.io/">Nextflow</a>, a workflow tool to run tasks across multiple compute infrastructures in a very portable manner. It uses Docker/Singularity containers making installation trivial and results highly reproducible. The&nbsp;<a href="https://www.nextflow.io/docs/latest/dsl2.html">Nextflow DSL2</a>&nbsp;implementation of this pipeline uses one container per process which makes it much easier to maintain and update software dependencies.</p><p>Address of the bookmark: <a href="https://github.com/AusARG/pipesnake" rel="nofollow">https://github.com/AusARG/pipesnake</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/43292/bioinformatics-scientist-production-bioinformatics-south-san-francisco-ca</guid>
  <pubDate>Thu, 19 Aug 2021 08:45:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Scientist, Production Bioinformatics @ South San Francisco, CA]]></title>
  <description><![CDATA[
<p>wist is looking for a Bioinformatics Scientist to join our Production Bioinformatics Team. You will work alongside research scientists, software engineers and data scientists to further deliver on our mission to expand access to best-in-class synthetic biology and next-generation sequencing applications. You will be developing and engineering tools to better evaluate and build hardened, production quality pipelines, optimize data quality, and automate lab and bioinformatics processes. Our ideal candidate is an organized problem solver with a background in developing and building novel production-quality bioinformatics tools and packages. Equally excellent communication skills and a proven ability to work independently are required.</p>

<p>More at https://boards.greenhouse.io/twistbioscience/jobs/3135495?gh_src=9ecc0b941us</p>
]]></description>
</item>

</channel>
</rss>