<?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/41957?</link>
	<atom:link href="https://bioinformaticsonline.com/related/41957?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38749/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</guid>
	<pubDate>Sun, 20 Jan 2019 06:34:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38749/clipcrop-a-tool-for-detecting-structural-variations-with-single-base-resolution-using-soft-clipping-information</link>
	<title><![CDATA[ClipCrop: a tool for detecting structural variations with single-base resolution using soft-clipping information]]></title>
	<description><![CDATA[<p><span>ClipCrop for detecting SVs with single-base resolution using soft-clipping information. A soft-clipped sequence is an unmatched fragment in a partially mapped read. To assess the performance of ClipCrop with other SV-detecting tools, we generated various patterns of simulation data &ndash; SV lengths, read lengths, and the depth of coverage of short reads &ndash; with insertions, deletions, tandem duplications, inversions and single nucleotide alterations in a human chromosome.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/shinout/clipcrop" rel="nofollow">https://github.com/shinout/clipcrop</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40583/trelliscope-flexibly-visualize-large-complex-data-in-great-detail-from-within-the-r-statistical-programming-environment</guid>
	<pubDate>Tue, 21 Jan 2020 04:22:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40583/trelliscope-flexibly-visualize-large-complex-data-in-great-detail-from-within-the-r-statistical-programming-environment</link>
	<title><![CDATA[Trelliscope: flexibly visualize large, complex data in great detail from within the R statistical programming environment.]]></title>
	<description><![CDATA[<p>Trelliscope provides a way to flexibly visualize large, complex data in great detail from within the R statistical programming environment. Trelliscope is a component in the<span>&nbsp;</span><a href="http://deltarho.org/docs-trelliscope/deltarho.org">DeltaRho</a><span>&nbsp;</span>environment.</p>
<p>For those familiar with<span>&nbsp;</span><a href="http://cm.bell-labs.com/cm/ms/departments/sia/project/trellis/">Trellis Display</a>,<span>&nbsp;</span><a href="http://docs.ggplot2.org/0.9.3.1/facet_wrap.html">faceting in ggplot</a>, or the notion of<span>&nbsp;</span><a href="http://en.wikipedia.org/wiki/Small_multiple">small multiples</a>, Trelliscope provides a scalable way to break a set of data into pieces, apply a plot method to each piece, and then arrange those plots in a grid and interactively sort, filter, and query panels of the display based on metrics of interest. With Trelliscope, we are able to create multipanel displays on data with a very large number of subsets and view them in an interactive and meaningful way.</p><p>Address of the bookmark: <a href="http://deltarho.org/docs-trelliscope/#introduction" rel="nofollow">http://deltarho.org/docs-trelliscope/#introduction</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43022/a-simple-tutorial-for-a-complex-complexheatmap</guid>
	<pubDate>Fri, 02 Apr 2021 06:18:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43022/a-simple-tutorial-for-a-complex-complexheatmap</link>
	<title><![CDATA[A simple tutorial for a complex ComplexHeatmap]]></title>
	<description><![CDATA[<p><em>ComplexHeatmap</em>&nbsp;(Gu, Eils, and Schlesner (2016)) is an R Programming Language (R Core Team (2020)) package that is currently listed in the&nbsp;<a href="https://bioconductor.org/">Bioconductor</a>&nbsp;package repository.</p>
<p><a href="https://github.com/kevinblighe/E-MTAB-6141#2-install-and-load-required-packages">install and load required packages</a></p>
<div>
<pre>  require(<span>RColorBrewer</span>)
  require(<span>ComplexHeatmap</span>)
  require(<span>circlize</span>)
  require(<span>digest</span>)
  require(<span>cluster</span>)</pre>
</div>
<p>If all load successfully, proceed to&nbsp;<span>Part 3</span>. Otherwise, go through the following code chunks in order to ensure that each package is installed and loaded properly.</p>
<p><em>BiocManager</em>&nbsp;(Morgan (2019))</p><p>Address of the bookmark: <a href="https://github.com/kevinblighe/E-MTAB-6141" rel="nofollow">https://github.com/kevinblighe/E-MTAB-6141</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41559/dahak-benchmarking-and-containerization-of-tools-for-analysis-of-complex-non-clinical-metagenomes</guid>
	<pubDate>Thu, 09 Apr 2020 04:56:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41559/dahak-benchmarking-and-containerization-of-tools-for-analysis-of-complex-non-clinical-metagenomes</link>
	<title><![CDATA[Dahak: benchmarking and containerization of tools for analysis of complex non-clinical metagenomes.]]></title>
	<description><![CDATA[<p><span>Dahak is a software suite that integrates state-of-the-art open source tools for metagenomic analyses. Tools in the dahak software suite will perform various steps in metagenomic analysis workflows including data pre-processing, metagenome assembly, taxonomic and functional classification, genome binning, and gene assignment. We aim to deliver the analytical framework as a robust and reliable containerized workflow system, which will be free from dependency, installation, and execution problems typically associated with other open-source bioinformatics solutions. This will maximize the transparency, data provenance (i.e., the process of tracing the origins of data and its movement through the workflow), and reproducibility.</span></p>
<p><span>More at&nbsp;<a href="https://dahak-metagenomics.github.io/dahak/">https://dahak-metagenomics.github.io/dahak/</a></span></p><p>Address of the bookmark: <a href="https://github.com/dahak-metagenomics/dahak" rel="nofollow">https://github.com/dahak-metagenomics/dahak</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</guid>
	<pubDate>Thu, 18 Aug 2016 09:57:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</link>
	<title><![CDATA[RepeatModeler]]></title>
	<description><![CDATA[<p><span>RepeatModeler is a de-novo repeat family identification and modeling package. At the heart of RepeatModeler are two de-novo repeat finding programs ( RECON and RepeatScout ) which employ complementary computational methods for identifying repeat element boundaries and family relationships from sequence data. RepeatModeler assists in automating the runs of RECON and RepeatScout given a genomic database and uses the output to build, refine and classify consensus models of putative interspersed repeats.</span></p><p>Address of the bookmark: <a href="http://www.repeatmasker.org/RepeatModeler.html" rel="nofollow">http://www.repeatmasker.org/RepeatModeler.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38593/excavator-detecting-copy-number-variants-from-whole-exome-sequencing-data</guid>
	<pubDate>Fri, 04 Jan 2019 10:10:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38593/excavator-detecting-copy-number-variants-from-whole-exome-sequencing-data</link>
	<title><![CDATA[EXCAVATOR: detecting copy number variants from whole-exome sequencing data]]></title>
	<description><![CDATA[<p><span>EXCAVATOR, for the detection of copy number variants (CNVs) from whole-exome sequencing data. EXCAVATOR combines a three-step normalization procedure with a novel heterogeneous hidden Markov model algorithm and a calling method that classifies genomic regions into five copy number states. We validate EXCAVATOR on three datasets and compare the results with three other methods. These analyses show that EXCAVATOR outperforms the other methods and is therefore a valuable tool for the investigation of CNVs in largescale projects, as well as in clinical research and diagnostics. EXCAVATOR is freely available at&nbsp;</span><span><a href="http://sourceforge.net/projects/excavatortool/" target="_blank"><span>http://sourceforge.net/projects/excavatortool/</span></a></span><span>.</span><br><br><br><span>EXCAVATOR is a novel software package for the detection of copy number variants (CNVs) from whole-exome sequencing data.</span><br><span>EXCAVATOR has been published on Genome Biology (</span><a href="http://genomebiology.com/2013/14/10/R120/abstract" target="_blank">http://genomebiology.com/2013/14/10/R120/abstract<span></span></a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/excavatortool/" rel="nofollow">https://sourceforge.net/projects/excavatortool/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43770/chromeister-an-ultra-fast-heuristic-approach-to-detect-conserved-signals-in-extremely-large-pairwise-genome-comparisons</guid>
	<pubDate>Thu, 03 Feb 2022 04:01:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43770/chromeister-an-ultra-fast-heuristic-approach-to-detect-conserved-signals-in-extremely-large-pairwise-genome-comparisons</link>
	<title><![CDATA[chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons.]]></title>
	<description><![CDATA[<p>chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons.</p>
<p dir="auto">USAGE:</p>
<ul dir="auto">
<li>-query: sequence A in fasta format</li>
<li>-db: sequence B in fasta format</li>
<li>-out: output matrix</li>
<li>-kmer Integer: k&gt;1 (default 32) Use 32 for chromosomes and genomes and 16 for small bacteria</li>
<li>-diffuse Integer: z&gt;0 (default 4) Use 4 for everything - if using large plant genomes you can try using 1</li>
<li>-dimension Size of the output matrix and plot. Integer: d&gt;0 (default 1000) Use 1000 for everything that is not full genome size, where 2000 is recommended</li>
</ul><p>Address of the bookmark: <a href="https://github.com/estebanpw/chromeister" rel="nofollow">https://github.com/estebanpw/chromeister</a></p>]]></description>
	<dc:creator>Jit</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/researchlabs/view/19648/mit-computational-biology-group</guid>
  <pubDate>Thu, 18 Dec 2014 14:47:01 -0600</pubDate>
  <link></link>
  <title><![CDATA[MIT Computational Biology Group]]></title>
  <description><![CDATA[
<p>My research group consists primarily of computer science graduate students and postdocs with expertise in algorithms, statistical inferences and machine learning, and sharing a passion for understanding fundamental biological problems.</p>

<p>We work in a highly interdisciplinary environment at the interface of Computer Science and Biology. Since its inception, our lab has eagerly engaged in collaborative research partnerships with biological and experimental collaborators, facilitated by our affiliation with the Broad Institute and the Computational and Systems Biology initiative (CSBi) at MIT, our participation in the Epigenome Roadmap, ENCODE, and modENCODE consortia, and by several other ongoing collaborations at MIT, Harvard, and the Harvard Medical School affiliated hospitals.</p>

<p>http://compbio.mit.edu/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/23149/raphael-lab</guid>
  <pubDate>Sat, 04 Jul 2015 19:05:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Raphael Lab]]></title>
  <description><![CDATA[
<p>Raphael Lab research is focused on Bioinformatics and Computational Biology.</p>

<p>Current research interests include next-generation DNA sequencing, structural variation, genome rearrangements in cancer and evolution, and network analysis of somatic mutations in cancer. Earlier research included topics in comparative genomics, multiple sequence alignment, and motif finding.</p>

<p>More athttp://compbio.cs.brown.edu/</p>
]]></description>
</item>

</channel>
</rss>