<?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/41881?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/41881?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</guid>
	<pubDate>Tue, 04 Oct 2016 14:50:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</link>
	<title><![CDATA[MIRO : miRNA omics]]></title>
	<description><![CDATA[<p><span>The MIRO (the miRNA omics) pipeline is a flexible and powerful tool for the analysis of miRNA (or more generall short RNA) expression using short-read deep sequencing data. In its present implementation MIRO is especially adapted for the analysis of reads generated with the Illumina sequencing platform. MIRO allows to preprocess the Solexa-reads, map them flexibly to several reference genomes using one of four different mappers, create differential gene (miRNA) expression profiles and cluster reads using one of several algorithm. MIRO output is furthermore compatible with software such as genome browsers and miRDeep.</span></p><p>Address of the bookmark: <a href="http://seq.crg.es/download/software/Miro/" rel="nofollow">http://seq.crg.es/download/software/Miro/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34867/magic-blast-a-tool-for-mapping-large-next-generation-rna-or-dna-sequencing-runs-against-a-whole-genome-or-transcriptome</guid>
	<pubDate>Tue, 26 Dec 2017 22:23:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34867/magic-blast-a-tool-for-mapping-large-next-generation-rna-or-dna-sequencing-runs-against-a-whole-genome-or-transcriptome</link>
	<title><![CDATA[Magic-BLAST: a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome.]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41046/iseqqc-a-tool-for-expression-based-quality-control-in-rna-sequencing</guid>
	<pubDate>Sun, 16 Feb 2020 08:47:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41046/iseqqc-a-tool-for-expression-based-quality-control-in-rna-sequencing</link>
	<title><![CDATA[iSeqQC: a tool for expression-based quality control in RNA sequencing]]></title>
	<description><![CDATA[<p><span>iSeqQC, an expression-based QC tool that detects outliers either produced due to variable laboratory conditions or due to dissimilarity within a phenotypic group. iSeqQC implements various statistical approaches including unsupervised clustering, agglomerative hierarchical clustering and correlation coefficients to provide insight into outliers.</span></p>
<p><a href="http://cancerwebpa.jefferson.edu/iSeqQC/">http://cancerwebpa.jefferson.edu/iSeqQC/</a></p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3399-8">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3399-8</a></p><p>Address of the bookmark: <a href="https://github.com/gkumar09/iSeqQC" rel="nofollow">https://github.com/gkumar09/iSeqQC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43997/tools-for-rna-classification</guid>
	<pubDate>Tue, 08 Nov 2022 03:39:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43997/tools-for-rna-classification</link>
	<title><![CDATA[Tools for RNA classification]]></title>
	<description><![CDATA[<p><span>barrnap</span>&nbsp;-&nbsp;<a href="https://github.com/tseemann/barrnap" target="_blank">https://github.com/tseemann/barrnap</a></p><p><span>CPAT</span>&nbsp;-&nbsp;<a href="https://github.com/liguowang/cpat" target="_blank">https://github.com/liguowang/cpat</a>,&nbsp;<a href="http://lilab.research.bcm.edu/" target="_blank">http://lilab.research.bcm.edu/</a>&nbsp;(web server)</p><p><span>CPC2</span>&nbsp;-&nbsp;<a href="https://github.com/gao-lab/CPC2_standalone" target="_blank">https://github.com/gao-lab/CPC2_standalone</a>,&nbsp;<a href="http://cpc2.gao-lab.org/" target="_blank">http://cpc2.gao-lab.org/</a>&nbsp;(web server)</p><p><span>Infernal</span>&nbsp;-&nbsp;<a href="http://eddylab.org/infernal/" target="_blank">http://eddylab.org/infernal/</a>,&nbsp;<a href="https://github.com/EddyRivasLab/infernal" target="_blank">https://github.com/EddyRivasLab/infernal</a></p><p><span>NCBI RefSeq</span>&nbsp;-&nbsp;<a href="https://www.ncbi.nlm.nih.gov/refseq/" target="_blank">https://www.ncbi.nlm.nih.gov/refseq/</a></p><p><span>Rfam</span>&nbsp;-&nbsp;<a href="http://rfam.xfam.org/" target="_blank">http://rfam.xfam.org/</a>,&nbsp;<a href="https://docs.rfam.org/en/latest/index.html" target="_blank">https://docs.rfam.org/en/latest/index.html</a></p><p><span>SILVA</span>&nbsp;-&nbsp;<a href="https://www.arb-silva.de/" target="_blank">https://www.arb-silva.de/</a></p><p><span>RNAmmer</span>&nbsp;-&nbsp;<a href="http://www.cbs.dtu.dk/services/RNAmmer/" target="_blank">http://www.cbs.dtu.dk/services/RNAmmer/</a>&nbsp;(web server, standalone download link)</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44713/understanding-rna-seq-normalization-methods-tpm-vs-fpkm-vs-cpm</guid>
	<pubDate>Wed, 11 Dec 2024 00:59:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44713/understanding-rna-seq-normalization-methods-tpm-vs-fpkm-vs-cpm</link>
	<title><![CDATA[Understanding RNA-Seq Normalization Methods: TPM vs. FPKM vs. CPM]]></title>
	<description><![CDATA[<p>RNA sequencing (RNA-Seq) is a powerful technology used to study transcriptomes, providing insights into gene expression levels. However, raw RNA-Seq data requires normalization to account for sequencing depth and gene length, enabling accurate comparisons between genes and samples. Among the most widely used normalization methods are TPM (Transcripts Per Million), FPKM (Fragments Per Kilobase Million), and CPM (Counts Per Million). Each method has its unique principles and applications, which we&rsquo;ll explore in this blog.</p><h2>Why Normalize RNA-Seq Data?</h2><p>Normalization is a crucial step in RNA-Seq analysis for the following reasons:</p><ul>
<li>
<p><strong>Sequencing depth:</strong> Different RNA-Seq experiments produce varying numbers of reads, making direct comparisons between samples misleading.</p>
</li>
<li>
<p><strong>Gene length:</strong> Longer genes inherently generate more reads, irrespective of their actual expression level.</p>
</li>
<li>
<p><strong>Bias reduction:</strong> Normalization mitigates technical biases, enabling meaningful biological interpretation.</p>
</li>
</ul><h2>TPM (Transcripts Per Million)</h2><p>TPM measures the proportion of reads mapped to a transcript, normalized by transcript length and sequencing depth. It is calculated as:</p><h3>Key Features:</h3><ol>
<li>
<p><strong>Proportionality:</strong> TPM values sum to 1,000,000 across all transcripts in a sample, making it easier to compare between samples.</p>
</li>
<li>
<p><strong>Intuitive interpretation:</strong> TPM values directly represent the abundance of transcripts in a sample.</p>
</li>
<li>
<p><strong>Preferred for comparisons:</strong> TPM facilitates between-sample comparisons better than FPKM.</p>
</li>
</ol><h2>FPKM (Fragments Per Kilobase Million)</h2><p>FPKM normalizes read counts by transcript length and sequencing depth, but without enforcing proportionality like TPM. It is defined as:</p><h3>Key Features:</h3><ol>
<li>
<p><strong>Historical significance:</strong> FPKM was one of the first normalization methods used for RNA-Seq.</p>
</li>
<li>
<p><strong>Single-end vs. paired-end:</strong> In paired-end sequencing, FPKM becomes RPKM (Reads Per Kilobase Million).</p>
</li>
<li>
<p><strong>Limited utility:</strong> FPKM values are not as robust as TPM for cross-sample comparisons due to lack of proportionality.</p>
</li>
</ol><h2>CPM (Counts Per Million)</h2><p>CPM normalizes raw read counts by sequencing depth, without considering gene length. It is expressed as:</p><h3>Key Features:</h3><ol>
<li>
<p><strong>Simplicity:</strong> CPM is straightforward and computationally less intensive.</p>
</li>
<li>
<p><strong>Application:</strong> Suitable for non-length-dependent analyses, such as comparing total expression levels or differential expression analysis.</p>
</li>
<li>
<p><strong>Gene length agnostic:</strong> CPM does not correct for gene length, making it less ideal for measuring expression levels.</p>
</li>
</ol><h2>When to Use Each Method</h2><ul>
<li>
<p><strong>TPM:</strong> Best for comparing expression levels between samples, especially when transcript length and sequencing depth vary.</p>
</li>
<li>
<p><strong>FPKM:</strong> Useful for historical consistency but generally replaced by TPM.</p>
</li>
<li>
<p><strong>CPM:</strong> Ideal for differential expression analysis when gene length normalization is unnecessary.</p>
</li>
</ul><h2>Conclusion</h2><p>Choosing the right normalization method depends on the specific objectives of your RNA-Seq analysis. TPM&rsquo;s proportionality and robustness make it the preferred choice for most applications, while CPM serves well for differential expression studies. Although FPKM paved the way for RNA-Seq normalization, it has largely been supplanted by TPM in modern workflows. Understanding these methods and their nuances ensures accurate and meaningful interpretations of RNA-Seq data.</p><h3>References:</h3><ol>
<li>
<p>Li, B., &amp; Dewey, C. N. (2011). RSEM: accurate transcript quantification from RNA-Seq data with or without a reference genome. <em>BMC Bioinformatics.</em></p>
</li>
<li>
<p>Trapnell, C., et al. (2010). Transcript assembly and quantification by RNA-Seq reveals unannotated transcripts and isoform switching during cell differentiation. <em>Nature Biotechnology.</em></p>
</li>
<li>
<p>Law, C. W., et al. (2014). voom: precision weights unlock linear model analysis tools for RNA-seq read counts. <em>Genome Biology.</em></p>
</li>
</ol>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41493/coronavirus-resources</guid>
	<pubDate>Wed, 25 Mar 2020 17:11:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41493/coronavirus-resources</link>
	<title><![CDATA[Coronavirus Resources !]]></title>
	<description><![CDATA[<p><span>2019nCoVR features comprehensive integration of genomic and proteomic sequences as well as their metadata information from the GISAID, NCBI, NMDC and CNCB/NGDC. It also incorporates a wide range of relevant information including scientific literatures, news, and popular articles for science dissemination, and provides visualization functionalities for genome variation analysis results based on all collected 2019-nCoV strains.</span></p>
<p><span>Annotation</span></p>
<p><span><a href="https://bigd.big.ac.cn/ncov/variation/annotation">https://bigd.big.ac.cn/ncov/variation/annotation</a></span></p>
<p><span>Genome wharehouse&nbsp;</span></p>
<p><span><a href="https://bigd.big.ac.cn/gwh/browse/index">https://bigd.big.ac.cn/gwh/browse/index</a></span></p>
<p>Released Genome</p>
<p><a href="https://bigd.big.ac.cn/ncov/release_genome">https://bigd.big.ac.cn/ncov/release_genome</a></p>
<p>Download data&nbsp;</p>
<p><a href="ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/">ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/</a></p>
<p>Raw data</p>
<p><a href="https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae">https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae</a></p><p>Address of the bookmark: <a href="https://bigd.big.ac.cn/ncov/about" rel="nofollow">https://bigd.big.ac.cn/ncov/about</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</guid>
	<pubDate>Sun, 28 Jun 2020 10:17:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41910/the-wavefront-alignment-wfa-algorithm</link>
	<title><![CDATA[The wavefront alignment (WFA) algorithm]]></title>
	<description><![CDATA[<p><span>The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of</span><br><span>homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.</span></p><p>Address of the bookmark: <a href="https://github.com/smarco/WFA" rel="nofollow">https://github.com/smarco/WFA</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</guid>
	<pubDate>Thu, 07 Aug 2014 18:08:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/13523/megadock-40</link>
	<title><![CDATA[MEGADOCK 4.0]]></title>
	<description><![CDATA[<p>An ultra&ndash;high-performance protein&ndash;protein docking software for heterogeneous supercomputers</p>
<p id="p-4"><strong>Summary:</strong> The application of protein&ndash;protein docking in large-scale interactome analysis is a major challenge in structural bioinformatics and requires huge computing resources. In this work, we present MEGADOCK 4.0, an FFT-based docking software that makes extensive use of recent heterogeneous supercomputers and shows powerful, scalable performance of over 97% strong scaling.</p>
<p id="p-5"><strong>Availability and Implementation:</strong> MEGADOCK 4.0 is written in C++ with OpenMPI and NVIDIA CUDA 5.0 (or later) and is freely available to all academic and non-profit users at: <a href="http://www.bi.cs.titech.ac.jp/megadock">http://www.bi.cs.titech.ac.jp/megadock</a>.</p>
<p id="p-6"><strong>Contact:</strong> <a href="mailto:akiyama@cs.titech.ac.jp">akiyama@cs.titech.ac.jp</a></p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short</a></p>]]></description>
	<dc:creator>Suleman Khan</dc:creator>
</item>

</channel>
</rss>