<?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/38634?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/related/38634?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32629/bienko-and-crosetto-labs</guid>
  <pubDate>Fri, 12 May 2017 07:42:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bienko and Crosetto Labs]]></title>
  <description><![CDATA[
<p>We are two groups of scientists doing frontier research in quantitative biology and biomedicine. The Bienko group is interested in exploring the fundamental design principles controlling how DNA is packed in the eukaryotic nucleus and its relation to gene expression regulation. The Crosetto group engineers new molecular methods for single-cell and spatially resolved omic measurements of DNA, RNA, and proteins, with a strong focus on tumor heterogeneity. By sharing ideas and resources, we work synergistically towards a more quantitative understanding of life’s processes in healthy and diseased conditions.</p>

<p>https://bienkocrosettolabs.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</guid>
	<pubDate>Thu, 23 Nov 2017 09:55:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</link>
	<title><![CDATA[poRe: an R package for the visualization and analysis of nanopore sequencing data]]></title>
	<description><![CDATA[<p><strong>Motivation:</strong>&nbsp;The Oxford Nanopore MinION device represents a unique sequencing technology. As a mobile sequencing device powered by the USB port of a laptop, the MinION has huge potential applications. To enable these applications, the bioinformatics community will need to design and build a suite of tools specifically for MinION data.</p>
<p><strong>Results:</strong>&nbsp;Here we present poRe, a package for R that enables users to manipulate, organize, summarize and visualize MinION nanopore sequencing data. As a package for R, poRe has been tested on Windows, Linux and MacOSX. Crucially, the Windows version allows users to analyse MinION data on the Windows laptop attached to the device.</p>
<p><strong>Availability and implementation:</strong>&nbsp;poRe is released as a package for R at&nbsp;<a href="http://sourceforge.net/projects/rpore/" target="">http://sourceforge.net/projects/rpore/</a>&nbsp;. A tutorial and further information are available at&nbsp;<a href="https://sourceforge.net/p/rpore/wiki/Home/" target="">https://sourceforge.net/p/rpore/wiki/Home/</a></p>
<p><strong>Contact:</strong><a href="mailto:mick.watson@roslin.ed.ac.uk" target="">mick.watson@roslin.ed.ac.uk</a></p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/1/114/2365693" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/1/114/2365693</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</guid>
	<pubDate>Thu, 31 May 2018 09:35:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36833/bfc-a-standalone-high-performance-tool-for-correcting-sequencing-errors-from-illumina-sequencing-data</link>
	<title><![CDATA[BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data]]></title>
	<description><![CDATA[BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.

The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC.

https://github.com/lh3/bfc<p>Address of the bookmark: <a href="https://github.com/lh3/bfc" rel="nofollow">https://github.com/lh3/bfc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</guid>
	<pubDate>Fri, 10 Aug 2018 18:41:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37527/nanopack-visualizing-and-processing-long-read-sequencing-data</link>
	<title><![CDATA[NanoPack: visualizing and processing long-read sequencing data]]></title>
	<description><![CDATA[<p>The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at&nbsp;<a href="https://github.com/wdecoster/nanopack" target="">https://github.com/wdecoster/nanopack</a>, together with links to separate scripts and their documentation. The scripts are compatible with Linux, Mac OS and the MS Windows 10 subsystem for Linux and are available as a graphical user interface, a web service at&nbsp;<a href="http://nanoplot.bioinf.be/" target="">http://nanoplot.bioinf.be</a>&nbsp;and command line tools.</p>
<p>&nbsp;https://academic.oup.com/bioinformatics/article/34/15/2666/4934939</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanoQC" rel="nofollow">https://github.com/wdecoster/nanoQC</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/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</guid>
	<pubDate>Mon, 07 Jan 2019 10:35:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</link>
	<title><![CDATA[kallisto: a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data]]></title>
	<description><![CDATA[<p><strong>kallisto</strong>&nbsp;is a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data, or more generally of target sequences using high-throughput sequencing reads. It is based on the novel idea of&nbsp;<em>pseudoalignment</em>&nbsp;for rapidly determining the compatibility of reads with targets, without the need for alignment. On benchmarks with standard RNA-Seq data,&nbsp;<strong>kallisto</strong>&nbsp;can quantify 30 million human reads in less than 3 minutes on a Mac desktop computer using only the read sequences and a transcriptome index that itself takes less than 10 minutes to build. Pseudoalignment of reads preserves the key information needed for quantification, and&nbsp;<strong>kallisto</strong>&nbsp;is therefore not only fast, but also as accurate as existing quantification tools. In fact, because the pseudoalignment procedure is robust to errors in the reads, in many benchmarks&nbsp;<strong>kallisto</strong>&nbsp;significantly outperforms existing tools.&nbsp;<strong>kallisto</strong>&nbsp;is described in detail in:</p>
<p>Nicolas L Bray, Harold Pimentel, P&aacute;ll Melsted and Lior Pachter,&nbsp;<a href="http://www.nature.com/nbt/journal/v34/n5/full/nbt.3519.html">Near-optimal probabilistic RNA-seq quantification</a>, Nature Biotechnology&nbsp;<strong>34</strong>, 525&ndash;527 (2016), doi:10.1038/nbt.3519</p><p>Address of the bookmark: <a href="https://pachterlab.github.io/kallisto/about" rel="nofollow">https://pachterlab.github.io/kallisto/about</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</guid>
	<pubDate>Tue, 28 Jan 2020 03:44:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</link>
	<title><![CDATA[vt: a variant tool set that discovers short variants from Next Generation Sequencing data.]]></title>
	<description><![CDATA[<p><span>vt is a variant tool set that discovers short variants from Next Generation Sequencing data.</span></p>
<p><span><a href="https://genome.sph.umich.edu/wiki/Vt">https://genome.sph.umich.edu/wiki/Vt</a></span></p>
<p><a href="https://github.com/atks/vt">https://github.com/atks/vt</a></p><p>Address of the bookmark: <a href="https://genome.sph.umich.edu/wiki/Vt" rel="nofollow">https://genome.sph.umich.edu/wiki/Vt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>