<?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/38023?offset=400</link>
	<atom:link href="https://bioinformaticsonline.com/related/38023?offset=400" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38166/pygenometracks-standalone-program-and-library-to-plot-beautiful-genome-browser-tracks</guid>
	<pubDate>Fri, 09 Nov 2018 12:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38166/pygenometracks-standalone-program-and-library-to-plot-beautiful-genome-browser-tracks</link>
	<title><![CDATA[pyGenomeTracks: Standalone program and library to plot beautiful genome browser tracks]]></title>
	<description><![CDATA[<p>pyGenomeTracks aims to produce high-quality genome browser tracks that are highly customizable. Currently, it is possible to plot:</p>
<ul>
<li>bigwig</li>
<li>bed (many options)</li>
<li>bedgraph</li>
<li>links (represented as arcs)</li>
<li>Hi-C matrices (if&nbsp;<a href="http://hicexplorer.readthedocs.io/">HiCExplorer</a>&nbsp;is installed)</li>
</ul><p>Address of the bookmark: <a href="https://github.com/deeptools/pyGenomeTracks" rel="nofollow">https://github.com/deeptools/pyGenomeTracks</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41831/merqury-reference-free-quality-and-phasing-assessment-for-genome-assemblies</guid>
	<pubDate>Sat, 06 Jun 2020 05:38:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41831/merqury-reference-free-quality-and-phasing-assessment-for-genome-assemblies</link>
	<title><![CDATA[Merqury: reference-free quality and phasing assessment for genome assemblies]]></title>
	<description><![CDATA[<p><span>Often, genome assembly projects have illumina whole genome sequencing reads available for the assembled individual. The k-mer spectrum of this read set can be used for independently evaluating assembly quality without the need of a high quality reference. Merqury provides a set of tools for this purpose.</span></p>
<p><span><a href="https://github.com/marbl/meryl">https://github.com/marbl/meryl</a></span></p><p>Address of the bookmark: <a href="https://github.com/marbl/merqury" rel="nofollow">https://github.com/marbl/merqury</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38481/arcs-scaffolding-genome-drafts-with-linked-reads</guid>
	<pubDate>Mon, 17 Dec 2018 17:40:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38481/arcs-scaffolding-genome-drafts-with-linked-reads</link>
	<title><![CDATA[ARCS: scaffolding genome drafts with linked reads]]></title>
	<description><![CDATA[<p>ARCS requires two input files:</p>
<ul>
<li>Draft assembly fasta file</li>
<li>Interleaved linked reads file (Barcode sequence expected in the BX tag of the read header or in the form "@readname_barcode" ; Run&nbsp;<a href="https://support.10xgenomics.com/genome-exome/software/pipelines/latest/what-is-long-ranger">Long Ranger basic</a>&nbsp;on raw chromium reads to produce this interleaved file)</li>
<li></li>
</ul><p>Address of the bookmark: <a href="https://github.com/bcgsc/ARCS/" rel="nofollow">https://github.com/bcgsc/ARCS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</guid>
	<pubDate>Sun, 13 Jan 2019 07:05:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</link>
	<title><![CDATA[LTR_Finder: an efficient program for finding full-length LTR retrotranspsons in genome sequences.]]></title>
	<description><![CDATA[<p>LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.</p>
<p>The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE,&nbsp;<a href="http://www.expasy.org/prosite/">http://www.expasy.org/prosite/</a>) to locate cores of important enzymes if they occur.</p><p>Address of the bookmark: <a href="https://github.com/xzhub/LTR_Finder" rel="nofollow">https://github.com/xzhub/LTR_Finder</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39236/causel-an-epigenome-and-genome-editing-pipeline-for-establishing-function-of-noncoding-gwas-variants</guid>
	<pubDate>Tue, 09 Apr 2019 07:23:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39236/causel-an-epigenome-and-genome-editing-pipeline-for-establishing-function-of-noncoding-gwas-variants</link>
	<title><![CDATA[CAUSEL: an epigenome- and genome-editing pipeline for establishing function of noncoding GWAS variants]]></title>
	<description><![CDATA[<p><span>Validated a widely accessible approach that can be used to establish functional causality for noncoding sequence variants identified by GWASs.</span></p>
<p><a href="https://www.nature.com/articles/nm.3975">https://www.nature.com/articles/nm.3975</a></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/nm.3975" rel="nofollow">https://www.nature.com/articles/nm.3975</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</guid>
	<pubDate>Tue, 22 Oct 2019 22:05:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40140/alf-a-simulation-framework-for-genome-evolution</link>
	<title><![CDATA[ALF--a simulation framework for genome evolution.]]></title>
	<description><![CDATA[<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;"><span style="color: #4d4d4d; font-size: small; font-style: normal; font-weight: 400; text-align: left; background-color: #ffffff; float: none;">Artificial Life Framework (ALF)</span> simulates a root genome into a number of related genomes. Result files include the resulting gene sequences, true tree and true MSAs. A description of ALF can be found in the following article:</p>
<p style="color: #000000; font-size: small; font-style: normal; font-weight: 400; text-align: -webkit-left;">Daniel A Dalquen, Maria Anisimova, Gaston H Gonnet, Christophe Dessimoz: ALF - A Simulation Framework for Genome Evolution.<span>&nbsp;</span><em>Mol Biol Evol</em>, 29(4):1115-1123, April 2012.<br><a href="http://mbe.oxfordjournals.org/content/29/4/1115" target="_blank">http://mbe.oxfordjournals.org/content/29/4/1115</a></p><p>Address of the bookmark: <a href="http://alfsim.org/#index" rel="nofollow">http://alfsim.org/#index</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</guid>
	<pubDate>Tue, 14 Jan 2020 06:47:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</link>
	<title><![CDATA[Shasta long read assembler]]></title>
	<description><![CDATA[<p>The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;flow cells.</p>
<p>Computational methods used by the Shasta assembler include:</p>
<ul>
<li>Using a&nbsp;<a href="https://en.wikipedia.org/wiki/Run-length_encoding">run-length</a>&nbsp;representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.</li>
<li>Using in some phases of the computation a representation of the read sequence based on&nbsp;<em>markers</em>, a fixed subset of short k-mers (k &asymp; 10).</li>
</ul>
<p>More at&nbsp;<a href="https://chanzuckerberg.github.io/shasta/index.html">https://chanzuckerberg.github.io/shasta/index.html</a></p><p>Address of the bookmark: <a href="https://github.com/chanzuckerberg/shasta" rel="nofollow">https://github.com/chanzuckerberg/shasta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/40881/liu-lab</guid>
  <pubDate>Tue, 04 Feb 2020 06:27:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[Liu Lab]]></title>
  <description><![CDATA[
<p>Shirley is a computational biologist with expertise in cancer epigenetics. Her research focuses on algorithm development and integrative mining from big data generated on microarrays, massively parallel sequencing, and other high throughput techniques to model the specificity and function of transcription factors, chromatin regulators and lncRNAs in tumor development, progression, drug response and resistance.</p>

<p>https://liulab-dfci.github.io/software/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41275/shinychromosomea-gui-for-the-interactive-creation-of-non-circular-whole-genome-diagrams</guid>
	<pubDate>Sat, 29 Feb 2020 00:39:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41275/shinychromosomea-gui-for-the-interactive-creation-of-non-circular-whole-genome-diagrams</link>
	<title><![CDATA[shinyChromosome:a GUI for the interactive creation of non-circular whole genome diagrams]]></title>
	<description><![CDATA[<p><code>shinyChromosome</code> is a graphical user interface for interactive creation of non-circular whole genome diagrams developed using the R <strong>Shiny</strong> package.</p>
<p>To create single-genome plot by aligning genome data along all chromosomes of a single genome, go to the <code>Single-genome plot</code> menu.</p>
<p>To cretae two-genome plot for comparison of data across two genomes, go to the <code>Two-genome plot</code> menu.</p>
<p>For the detail format of input data, check the <code>Input data format</code> submenu of the <code>Help</code> menu.</p>
<p>shinyChromosome is deployed at <a href="http://150.109.59.144:3838/shinyChromosome/" target="_blank">http://150.109.59.144:3838/shinyChromosome/</a>, <a href="http://shinyChromosome.ncpgr.cn" target="_blank">http://shinyChromosome.ncpgr.cn</a>, and <a href="https://yimingyu.shinyapps.io/shinyChromosome" target="_blank">https://yimingyu.shinyapps.io/shinyChromosome</a> for online use. The source code and manual of shinyChromosome are freely available at <a href="https://github.com/venyao/shinyChromosome" target="_blank">https://github.com/venyao/shinyChromosome</a>.</p>
<p>https://yimingyu.shinyapps.io/shinychromosome/</p>
<p>https://www.sciencedirect.com/science/article/pii/S1672022919301883</p><p>Address of the bookmark: <a href="https://yimingyu.shinyapps.io/shinychromosome/" rel="nofollow">https://yimingyu.shinyapps.io/shinychromosome/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</guid>
	<pubDate>Fri, 01 May 2020 03:00:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</link>
	<title><![CDATA[RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes]]></title>
	<description><![CDATA[<p><span>RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/AppliedBioinformatics/RefKA" rel="nofollow">https://github.com/AppliedBioinformatics/RefKA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>