<?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/30355?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/30355?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</guid>
	<pubDate>Tue, 26 Apr 2016 03:48:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</link>
	<title><![CDATA[HOMER:  Software for motif discovery and next-gen sequencing analysis]]></title>
	<description><![CDATA[<p><span>This tutorial covers topics independently of HOMER, and represents knowledge which is important to know before diving head first into more advanced analysis tools such as HOMER.</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/computerSetup.html">Setting up your computing environment</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/retrieveFiles.html">Retrieving and storing sequencing files</a>&nbsp;(your own data or from public sources)</li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/fastqFiles.html">Checking sequence quality, trimming, general sequence manipulation</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/mapping.html">Mapping reads to a reference genome</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/samfiles.html">Manipulating SAM/BAM alignment files</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/genomeBrowsers.html">Visualizing data in a genome browser</a></li>
</ol>
<p><br>RNA-Seq</p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqCufflinks.html">De novo transcript discovery and differential analysis with Cufflinks</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqR.html">Differential expression analysis with R/Bioconductor</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/clustering.html">Clustering of large expression datasets (microarray or RNA-Seq)</a></li>
</ol>
<p><br><span>Microarray</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/affymetrix.html">Basic analysis of Affymetrix Gene Expression Arrays using R/Bioconductor</a></li>
</ol>
<p><span>General Tips for Data Analysis</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/excelTips.html">Excel workarounds, adding gene annotation, X-Y plots tips, etc.</a></li>
</ol><p>Address of the bookmark: <a href="http://homer.salk.edu/homer/basicTutorial/" rel="nofollow">http://homer.salk.edu/homer/basicTutorial/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</guid>
	<pubDate>Fri, 12 Feb 2016 05:23:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</link>
	<title><![CDATA[HiCdat]]></title>
	<description><![CDATA[<p>HiCdat: a fast and easy-to-use Hi-C data analysis tool</p>
<p>HiCdat is easy-to-use and provides solutions starting from aligned reads up to in-depth analyses. Importantly, HiCdat is focussed on the analysis of larger structural features of chromosomes, their correlation to genomic and epigenomic features, and on comparative studies. It uses simple input and output formats and can therefore easily be integrated into existing workflows or combined with alternative tools.</p>
<p>More at http://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0678-x</p><p>Address of the bookmark: <a href="https://github.com/MWSchmid/HiCdat" rel="nofollow">https://github.com/MWSchmid/HiCdat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</guid>
	<pubDate>Tue, 16 Aug 2016 08:34:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</link>
	<title><![CDATA[KisSplice]]></title>
	<description><![CDATA[<p>KisSplice is a software that enables to analyse RNA-seq data with or without a reference genome. It is an exact local transcriptome assembler that allows to identify SNPs, indels and alternative splicing events. It can deal with an arbitrary number of biological conditions, and will quantify each variant in each condition. It has been tested on Illumina datasets of up to 1G reads. Its memory consumption is around 5Gb for 100M reads.</p>
<p>KisSplice is not a full-length transcriptome assembler. This means that it will output the variable regions of the transcripts, not reconstruct them entirely.</p>
<p>KisSplice comes as a workflow, with several possible post-treatments meant to facilitate the analysis of the results. The choice of the post-treatment depends on the availability of a reference genome/transcriptome and on the need to perform a differential analysis, as summarised in the following table.</p><p>Address of the bookmark: <a href="http://kissplice.prabi.fr/" rel="nofollow">http://kissplice.prabi.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</guid>
	<pubDate>Fri, 01 Jul 2016 12:57:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</link>
	<title><![CDATA[Machine Learning !!!]]></title>
	<description><![CDATA[<p>In machine learning, computers apply&nbsp;<strong>statistical learning</strong>&nbsp;techniques to automatically identify patterns in data. These techniques can be used to make highly accurate predictions.</p>
<p><em>Keep scrolling.</em>&nbsp;Using a data set about homes, we will create a machine learning model to distinguish homes in New York from homes in San Francisco.</p><p>Address of the bookmark: <a href="http://www.r2d3.us/visual-intro-to-machine-learning-part-1/" rel="nofollow">http://www.r2d3.us/visual-intro-to-machine-learning-part-1/</a></p>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</guid>
	<pubDate>Wed, 13 Jul 2016 08:08:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</link>
	<title><![CDATA[WiseScaffolder]]></title>
	<description><![CDATA[<p>Function</p>
<p>WiseScaffolder is a stand-alone semi-automatic application for genome scaffolding of pre-assembled contigs using mate-pair data. It also produces editable scaffold maps, allowing either to build gapped scaffolds or usable as a common thread for the manual improvement of scaffolds.</p>
<p>Description&nbsp;</p>
<p>WiseScaffolder includes 4 subcommands: dumpconfig generates a configuration file that notably specifies the average insert size of the mate-pair library preprocess allows the detection and correction of chimerae, the estimation of contigs copy number and produces valuable outputs for the manual improvement of scaffolds scaffold constitutes the central scaffold-builder and comprises two modules:</p>
<p>i) the interative_scaffold_extender, which works with big, unambiguous contigs, or when they run out, single copy contigs, and</p>
<p>ii) the small_contig_inserter, which inserts the small contigs within scaffolds buildfasta converts the scaffold(s) map(s) into Fasta sequences.</p><p>Address of the bookmark: <a href="http://abims.sb-roscoff.fr/wisescaffolder" rel="nofollow">http://abims.sb-roscoff.fr/wisescaffolder</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29018/crossmap</guid>
	<pubDate>Mon, 05 Sep 2016 04:07:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29018/crossmap</link>
	<title><![CDATA[CrossMap]]></title>
	<description><![CDATA[<ul>
<li>CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between&nbsp;<em>different assemblies</em>&nbsp;(such as Human&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/2928/">hg18 (NCBI36)</a>&nbsp;&lt;&gt;&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/2758/">hg19 (GRCh37)</a>, Mouse&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/165668/">mm9 (MGSCv37)</a>&nbsp;&lt;&gt;&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/327618/">mm10 (GRCm38)</a>).</li>
<li>It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.</li>
<li>CrossMap is designed to liftover genome coordinates between assemblies. It&rsquo;s&nbsp;<em>not</em>&nbsp;a program for aligning sequences to reference genome.</li>
<li>We&nbsp;<em>do not</em>&nbsp;recommend using CrossMap to convert genome coordinates between species.</li>
</ul><p>Address of the bookmark: <a href="http://crossmap.sourceforge.net/" rel="nofollow">http://crossmap.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28844/teannot</guid>
	<pubDate>Thu, 18 Aug 2016 10:02:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28844/teannot</link>
	<title><![CDATA[TEannot]]></title>
	<description><![CDATA[<p>We advise to run first the TEdenovo pipeline but it is not compulsory. We suppose you begin by running the TEannot pipeline on the example provided in the directory "db/" rather than directly on your own genomic sequences. Thus, from now on, the project name is "DmelChr4".</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto" rel="nofollow">https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28891/lumpy</guid>
	<pubDate>Thu, 25 Aug 2016 08:05:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28891/lumpy</link>
	<title><![CDATA[LUMPY]]></title>
	<description><![CDATA[<p>A probabilistic framework for structural variant discovery.</p>
<p>Ryan M Layer, Colby Chiang, Aaron R Quinlan, and Ira M Hall. 2014. "LUMPY: a Probabilistic Framework for Structural Variant Discovery." Genome Biology 15 (6): R84.&nbsp;<a href="http://dx.doi.org/10.1186/gb-2014-15-6-r84">doi:10.1186/gb-2014-15-6-r84</a>.</p>
<p>More at&nbsp;https://github.com/arq5x/lumpy-sv</p><p>Address of the bookmark: <a href="https://github.com/arq5x/lumpy-sv" rel="nofollow">https://github.com/arq5x/lumpy-sv</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28922/ka-ks-and-kaks-calculations</guid>
	<pubDate>Mon, 29 Aug 2016 11:44:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28922/ka-ks-and-kaks-calculations</link>
	<title><![CDATA[Ka, Ks and Ka/Ks calculations]]></title>
	<description><![CDATA[<p>gKaKs is a codon-based genome-level Ka/Ks computation pipeline developed and based on programs from four widely used packages: BLAT, BLASTALL (including bl2seq, formatdb and fastacmd), PAML (including codeml and yn00) and KaKs_Calculator (including 10 substitution rate estimation methods). gKaKs can automatically detect and eliminate frameshift mutations and premature stop codons to compute the substitution rates (Ka, Ks and Ka/Ks) between a well-annotated genome and a non-annotated genome or even a poorly assembled scaffold dataset. It is especially useful for newly sequenced genomes that have not been well annotated.&nbsp;</p>
<p>Look for KaKs calculation:</p>
<p>https://github.com/fumba/kaks-calculator</p>
<p>http://longlab.uchicago.edu/?q=gKaKs</p>
<p>http://www.ncbi.nlm.nih.gov/pubmed/23314322</p><p>Address of the bookmark: <a href="http://longlab.uchicago.edu/?q=gKaKs" rel="nofollow">http://longlab.uchicago.edu/?q=gKaKs</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>