<?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/37830?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/37830?offset=250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</guid>
	<pubDate>Tue, 28 Jan 2020 03:27:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</link>
	<title><![CDATA[FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads]]></title>
	<description><![CDATA[<p>FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.</p>
<p><a href="http://bioinfo.ut.ee/FastGT/">http://bioinfo.ut.ee/FastGT/</a></p>
<p><strong><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></strong></p><p>Address of the bookmark: <a href="http://bioinfo.ut.ee/FastGT/" rel="nofollow">http://bioinfo.ut.ee/FastGT/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</guid>
	<pubDate>Sat, 26 Dec 2020 08:35:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42485/fastprongs-fast-preprocessing-of-next-generation-sequencing-reads</link>
	<title><![CDATA[FastProNGS: fast preprocessing of next-generation sequencing reads]]></title>
	<description><![CDATA[<p><span>FastProNGS to integrate the quality control process with automatic adapter removal. Parallel processing was implemented to speed up the process by allocating multiple threads. Compared with similar up-to-date preprocessing tools, FastProNGS is by far the fastest.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/Megagenomics/FastProNGS" rel="nofollow">https://github.com/Megagenomics/FastProNGS</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</guid>
	<pubDate>Mon, 06 Feb 2017 04:26:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30831/fsa-fast-statistical-alignment</link>
	<title><![CDATA[FSA: Fast Statistical Alignment]]></title>
	<description><![CDATA[<p><span>FSA is a probabilistic multiple sequence alignment algorithm which uses a "distance-based" approach to aligning homologous protein, RNA or DNA sequences. Much as distance-based phylogenetic reconstruction methods like Neighbor-Joining build a phylogeny using only pairwise divergence estimates, FSA builds a multiple alignment using only pairwise estimations of homology. This is made possible by the sequence annealing technique for constructing a multiple alignment from pairwise comparisons, developed by Ariel Schwartz in&nbsp;</span><a href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-39.html">"Posterior Decoding Methods for Optimization and Control of Multiple Alignments</a><span>."</span></p>
<p>FSA brings the high accuracies previously available only for small-scale analyses of proteins or RNAs to large-scale problems such as aligning thousands of sequences or megabase-long sequences. FSA introduces several novel methods for constructing better alignments:</p>
<ul>
<li>FSA uses machine-learning techniques to estimate gap and substitution parameters on the fly for each set of input sequences. This "query-specific learning" alignment method makes FSA very robust: it can produce superior alignments of sets of homologous sequences which are subject to very different evolutionary constraints.</li>
<li>FSA is capable of aligning hundreds or even thousands of sequences using a randomized inference algorithm to reduce the computational cost of multiple alignment. This randomized inference can be over ten times faster than a direct approach with little loss of accuracy.</li>
<li>FSA can quickly align very long sequences using the "anchor annealing" technique for resolving anchors and projecting them with transitive anchoring. It then stitches together the alignment between the anchors using the methods described above.</li>
<li>The included GUI, MAD (Multiple Alignment Display), can display the intermediate alignments produced by FSA, where each character is colored according to the probability that it is correctly aligned (see the picture and&nbsp;<a href="http://fsa.sourceforge.net/images/Suchard_SIV.fsa.mov">movie</a>&nbsp;at the top of the page).</li>
</ul>
<p><span>You can see more information on the&nbsp;</span><a href="http://fsa.sourceforge.net/FAQ.html">FAQ</a><span>.&nbsp;</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://fsa.sourceforge.net/" rel="nofollow">http://fsa.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</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/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/42040/proactiv-estimation-of-promoter-activity-from-rna-seq-data</guid>
	<pubDate>Thu, 13 Aug 2020 10:21:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42040/proactiv-estimation-of-promoter-activity-from-rna-seq-data</link>
	<title><![CDATA[proActiv: Estimation of Promoter Activity from RNA-Seq data]]></title>
	<description><![CDATA[<p>proActiv is an R package that estimates promoter activity from RNA-Seq data. proActiv uses aligned reads and genome annotations as input, and provides absolute and relative promoter activity as output. The package can be used to identify active promoters and alternative promoters, the details of the method are described in&nbsp;<a href="https://github.com/GoekeLab/proActiv#reference">Demircioglu et al</a>.</p>
<p>Additional data on differential promoters in tissues and cancers from TCGA, ICGC, GTEx, and PCAWG can be downloaded here:&nbsp;<a href="https://jglab.org/data-and-software/">https://jglab.org/data-and-software/</a></p><p>Address of the bookmark: <a href="https://github.com/GoekeLab/proActiv" rel="nofollow">https://github.com/GoekeLab/proActiv</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35108/mobyle-a-new-full-web-bioinformatics-framework</guid>
	<pubDate>Sun, 07 Jan 2018 19:33:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35108/mobyle-a-new-full-web-bioinformatics-framework</link>
	<title><![CDATA[Mobyle: a new full web bioinformatics framework]]></title>
	<description><![CDATA[<p><span>Mobyle, to provide a flexible and usable Web environment for defining and running bioinformatics analyses. It embeds simple yet powerful data management features that allow the user to reproduce analyses and to combine tools using a hierarchical typing system. Mobyle offers invocation of services distributed over remote Mobyle servers, thus enabling a federated network of curated bioinformatics portals without the user having to learn complex concepts or to install sophisticated software.</span></p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/25/22/3005/179064" rel="nofollow">https://academic.oup.com/bioinformatics/article/25/22/3005/179064</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38457/pilongrid-parallel-wrapper-around-the-pilon-framework</guid>
	<pubDate>Thu, 13 Dec 2018 09:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38457/pilongrid-parallel-wrapper-around-the-pilon-framework</link>
	<title><![CDATA[PilonGrid: parallel wrapper around the Pilon framework]]></title>
	<description><![CDATA[<p>The distribution is a parallel wrapper around the&nbsp;<a href="https://github.com/broadinstitute/pilon">Pilon</a>&nbsp;framework The pipeline is composed of bash scripts, an example mapping.fofn which shows how to input your fastq files (you give paths to the R1 file), and how to launch the pipeline.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/skoren/PilonGrid" rel="nofollow">https://github.com/skoren/PilonGrid</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40221/dash-a-web-application-framework-that-provides-pure-python-abstraction-around-html-css-and-javascript</guid>
	<pubDate>Tue, 05 Nov 2019 06:39:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40221/dash-a-web-application-framework-that-provides-pure-python-abstraction-around-html-css-and-javascript</link>
	<title><![CDATA[Dash: a web application framework that provides pure Python abstraction around HTML, CSS, and JavaScript.]]></title>
	<description><![CDATA[<p style="margin-top: 0px; margin-bottom: 0.75rem;">Dash is a web application framework that provides pure Python abstraction around HTML, CSS, and JavaScript.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">Dash Bio is a suite of bioinformatics components that make it simpler to analyze and visualize bioinformatics data and interact with them in a Dash application.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">The source can be found on GitHub at<span>&nbsp;</span><a href="https://github.com/plotly/dash-bio">plotly/dash-bio</a>.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">These docs are using Dash Bio version 0.1.4.</p><p>Address of the bookmark: <a href="https://dash.plot.ly/dash-bio" rel="nofollow">https://dash.plot.ly/dash-bio</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/3918/the-human-genome-project-video-3d-animation-introduction-low</guid>
	<pubDate>Sat, 24 Aug 2013 19:01:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/3918/the-human-genome-project-video-3d-animation-introduction-low</link>
	<title><![CDATA[The Human Genome Project Video   3D Animation Introduction Low)]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/YxoQFSBwyms" frameborder="0" allowfullscreen></iframe>]]></description>
	
</item>

</channel>
</rss>