<?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/44541?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/44541?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35920/mesquite-a-modular-system-for-evolutionary-analysis</guid>
	<pubDate>Tue, 13 Mar 2018 06:54:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35920/mesquite-a-modular-system-for-evolutionary-analysis</link>
	<title><![CDATA[Mesquite: A modular system for evolutionary analysis]]></title>
	<description><![CDATA[<p><span>Mesquite is modular, extendible software for evolutionary biology, designed to help biologists organize and analyze comparative data about organisms. Its emphasis is on phylogenetic analysis, but some of its modules concern population genetics, while others do non-phylogenetic multivariate analysis. Because it is modular, the analyses available depend on the modules installed.</span></p>
<p><span>https://github.com/MesquiteProject/MesquiteCore</span></p><p>Address of the bookmark: <a href="http://mesquiteproject.org/" rel="nofollow">http://mesquiteproject.org/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39441/snakepipes-a-toolkit-based-on-snakemake-and-python-for-analysis-of-ngs-data</guid>
	<pubDate>Thu, 30 May 2019 04:06:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39441/snakepipes-a-toolkit-based-on-snakemake-and-python-for-analysis-of-ngs-data</link>
	<title><![CDATA[snakepipes: A toolkit based on snakemake and python for analysis of NGS data]]></title>
	<description><![CDATA[<p><span><span>snakePipes are flexible and powerful workflows built using&nbsp;</span><a href="https://github.com/maxplanck-ie/snakepipes/blob/master/snakemake.readthedocs.io">snakemake</a><span>&nbsp;that simplify the analysis of NGS data.</span></span></p>
<ul>
<li>DNA-mapping*</li>
<li>ChIP-seq*</li>
<li>RNA-seq*</li>
<li>ATAC-seq*</li>
<li>scRNA-seq</li>
<li>Hi-C</li>
<li>Whole Genome Bisulfite Seq/WGBS</li>
</ul>
<p><span>(*Also available in "allele-specific" mode)</span></p>
<p><span>snakePipes can be installed via conda : </span></p>
<p><span>'conda install -c mpi-ie -c bioconda -c conda-forge snakePipes'. </span></p>
<p><span>Source code (</span><a href="https://github.com/maxplanck-ie/snakepipes" target="">https://github.com/maxplanck-ie/snakepipes</a><span>) and documentation (</span><a href="https://snakepipes.readthedocs.io/en/latest/" target="">https://snakepipes.readthedocs.io/en/latest/</a><span>) are available online.</span></p><p>Address of the bookmark: <a href="https://github.com/maxplanck-ie/snakepipes" rel="nofollow">https://github.com/maxplanck-ie/snakepipes</a></p>]]></description>
	<dc:creator>Jit</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/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</guid>
	<pubDate>Wed, 25 Nov 2020 19:51:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</link>
	<title><![CDATA[DnaSP: DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms]]></title>
	<description><![CDATA[<p><span>DnaSP, DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms using data from a single locus (a multiple sequence aligned -MSA data), or from several loci (a Multiple-MSA data, such as formats generated by some assembler RAD-seq software). DnaSP can estimate several measures of DNA sequence variation within and between populations in noncoding, synonymous or nonsynonymous sites, or in various sorts of codon positions), as well as linkage disequilibrium, recombination, gene flow and gene conversion parameters.</span></p><p>Address of the bookmark: <a href="http://www.ub.edu/dnasp/" rel="nofollow">http://www.ub.edu/dnasp/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43766/genometools-the-versatile-open-source-genome-analysis-software</guid>
	<pubDate>Wed, 02 Feb 2022 04:00:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43766/genometools-the-versatile-open-source-genome-analysis-software</link>
	<title><![CDATA[GenomeTools: The versatile open source genome analysis software]]></title>
	<description><![CDATA[<p>The&nbsp;<em>GenomeTools</em>&nbsp;genome analysis system is a&nbsp;<a href="http://genometools.org/license.html">free</a>&nbsp;collection of bioinformatics&nbsp;<a href="http://genometools.org/tools.html">tools</a>&nbsp;(in the realm of genome informatics) combined into a single binary named&nbsp;<em>gt</em>. It is based on a C library named &ldquo;libgenometools&rdquo; which consists of several modules.</p>
<p><img src="http://genometools.org/images/annotation.png" alt="image" style="border: 0px;"></p>
<p>If you are interested in gene prediction, have a look at&nbsp;<a href="http://genomethreader.org/" title="GenomeThreader gene prediction        software"><em>GenomeThreader</em></a>.</p>
<p>http://genometools.org/pub/</p><p>Address of the bookmark: <a href="http://genometools.org/" rel="nofollow">http://genometools.org/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44257/calculate-the-significance-of-the-difference-between-two-trends</guid>
	<pubDate>Tue, 14 Mar 2023 05:41:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44257/calculate-the-significance-of-the-difference-between-two-trends</link>
	<title><![CDATA[Calculate the significance of the difference between two trends]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>To calculate the significance of the difference between two trends, you can use a statistical test such as a t-test or ANOVA (analysis of variance). Here are the general steps to follow:</p><ol>
<li>
<p>Define your null hypothesis (H0) and alternative hypothesis (H1). For example, H0 might be that there is no significant difference between the two trends, while H1 might be that there is a significant difference.</p>
</li>
<li>
<p>Collect data on the two trends. Make sure that the data is independent, normally distributed, and has equal variances.</p>
</li>
<li>
<p>Calculate the means and standard deviations of each trend.</p>
</li>
<li>
<p>Calculate the test statistic using a t-test or ANOVA. The test statistic will depend on the specific test you choose, but it will generally compare the difference in means between the two trends to the variability within each trend.</p>
</li>
<li>
<p>Determine the p-value associated with the test statistic. The p-value represents the probability of obtaining a test statistic as extreme as the one you calculated, assuming that the null hypothesis is true.</p>
</li>
<li>
<p>Compare the p-value to your chosen significance level (usually 0.05 or 0.01). If the p-value is less than or equal to the significance level, reject the null hypothesis and conclude that there is a significant difference between the two trends. If the p-value is greater than the significance level, fail to reject the null hypothesis and conclude that there is not enough evidence to support a significant difference.</p>
</li>
</ol><p>It's important to note that the specific details of each step will depend on the type of test you choose and the software you use to perform the analysis.</p><p>The most common methods for comparing means include:</p><table>
<thead>
<tr><th>Methods</th><th>R function</th><th>Description</th></tr>
</thead>
<tbody>
<tr>
<td>T-test</td>
<td>t.test()</td>
<td>Compare two groups (parametric)</td>
</tr>
<tr>
<td>Wilcoxon test</td>
<td>wilcox.test()</td>
<td>Compare two groups (non-parametric)</td>
</tr>
<tr>
<td>ANOVA</td>
<td>aov() or anova()</td>
<td>Compare multiple groups (parametric)</td>
</tr>
<tr>
<td>Kruskal-Wallis</td>
<td>kruskal.test()</td>
<td>Compare multiple groups (non-parametric)<br /><br /></td>
</tr>
</tbody>
</table></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</guid>
	<pubDate>Fri, 30 May 2014 04:48:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</link>
	<title><![CDATA[Next generation sequencing(NGS) books]]></title>
	<description><![CDATA[<p>Employing different technologies, the purpose of NGS platform is to decode the identity or modification on the nucleotides. NGS platforms evolve quickly and capture the main stream.</p>
<p>This bookmark is created to provide NGS online books links.</p><p>Address of the bookmark: <a href="http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version" rel="nofollow">http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</guid>
	<pubDate>Fri, 02 Feb 2018 03:24:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35418/karyoploter-plot-whole-genomes-with-arbitrary-data</link>
	<title><![CDATA[karyoploteR: plot whole genomes with arbitrary data]]></title>
	<description><![CDATA[<p><span><a href="http://bioconductor.org/packages/karyoploteR">karyoploteR</a></span><span>&nbsp;is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.</span></p><p>Address of the bookmark: <a href="https://bernatgel.github.io/karyoploter_tutorial/" rel="nofollow">https://bernatgel.github.io/karyoploter_tutorial/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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>

</channel>
</rss>