<?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/37776?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/37776?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43952/elastic-blast</guid>
	<pubDate>Tue, 06 Sep 2022 18:14:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43952/elastic-blast</link>
	<title><![CDATA[Elastic BLAST !]]></title>
	<description><![CDATA[<p><a href="https://blast.ncbi.nlm.nih.gov/doc/elastic-blast/elasticblast.html?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=elasticblast-top3-20220823">ElasticBLAST</a>&nbsp;is a new way to&nbsp;<a href="https://blast.ncbi.nlm.nih.gov/?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=elasticblast-top3-20220823">BLAST</a>&nbsp;large numbers of queries, faster and on the cloud. Here are the top three reasons you should use ElasticBLAST:</p>
<h6><strong><img src="https://i0.wp.com/ncbiinsights.ncbi.nlm.nih.gov/wp-content/uploads/2022/08/ElasticBLAST_Larger-e1659978198941.png?resize=150%2C120&amp;ssl=1" alt="" width="150" height="120" style="border: 0px;">1. ElasticBLAST can handle much LARGER queries!&nbsp;</strong></h6>
<p>ElasticBLAST can search query sets that have&nbsp;<em>hundreds to millions of sequences</em>&nbsp;and against BLAST databases of all sizes.</p>
<h6><span><img src="https://i0.wp.com/ncbiinsights.ncbi.nlm.nih.gov/wp-content/uploads/2022/08/ElasticBLAST_Faster.png?resize=150%2C120&amp;ssl=1" alt="" width="150" height="120" style="border: 0px;">2. ElasticBLAST is FASTER</span></h6>
<p>ElasticBLAST distributes your searches across multiple cloud instances to process them simultaneously. The ability to scale resources in this way allows you to process large numbers of queries in a shorter time than you could with BLAST+.</p>
<h6><img src="https://i0.wp.com/ncbiinsights.ncbi.nlm.nih.gov/wp-content/uploads/2022/08/ElasticBLAST_Easy.png?resize=150%2C120&amp;ssl=1" alt="" width="150" height="120" style="border: 0px;">3. ElasticBLAST is EASY to run on the cloud<strong><br></strong></h6>
<p>ElasticBLAST is easy to set up using our step-by-step instructions&nbsp;<span>(</span><a href="https://blast.ncbi.nlm.nih.gov/doc/elastic-blast/quickstart-aws.html?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=elasticblast-top3-20220823" target="_blank"><span><span>Amazon Web&nbsp;</span><span>Services (AWS)</span></span></a><span>,&nbsp;</span><a href="https://blast.ncbi.nlm.nih.gov/doc/elastic-blast/quickstart-gcp.html?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=elasticblast-top3-20220823" target="_blank"><span>Google Cloud Platform (GCP)</span></a><span><span>)</span>&nbsp;<span>and</span>&nbsp;<span>allows&nbsp;</span><span>you&nbsp;</span><span>to leverage the power of</span><span>&nbsp;the&nbsp;</span><span>cloud. Once configured, i</span><span>t</span>&nbsp;<span>manages the software and database installation, handles partitioning of the BLAST workload among the various instances, and deallocates cloud resources when the searches are done.</span></span></p>
<p><span><span>ElasticBLAST</span>&nbsp;<span>also&nbsp;</span><span>selects the instance (</span><span>i.e.,</span><span>&nbsp;machine) type for you based on database size. Of course, you can also choose the instance type manually if you prefer</span><span>.&nbsp;</span></span></p><p>Address of the bookmark: <a href="https://blast.ncbi.nlm.nih.gov/doc/elastic-blast/" rel="nofollow">https://blast.ncbi.nlm.nih.gov/doc/elastic-blast/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</guid>
	<pubDate>Tue, 16 Mar 2021 05:45:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</link>
	<title><![CDATA[Nucl2Vec: Local alignment of DNA sequences using Distributed Vector Representation]]></title>
	<description><![CDATA[<p><span>We demonstrate a novel approach for</span><span>local alignment of DNA reads with respect to reference genome.</span><span>For this process we have used Skip-gram model for creating</span><span>encoding(Nucl2Vec) and k-nearest neighbor for the alignment.</span><span>With our new approach we have reduced computation cost for</span><span>local alignment , while achieving accuracy comparable to existing</span><span>defacto standard BWA-MEM tool.</span> </p>
<p><em>https://prakharg24.github.io/papers/401851.full.pdf</em></p><p>Address of the bookmark: <a href="https://prakharg24.github.io/papers/401851.full.pdf" rel="nofollow">https://prakharg24.github.io/papers/401851.full.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34562/harvest-a-suite-of-core-genome-alignment-and-visualization-tools</guid>
	<pubDate>Fri, 08 Dec 2017 07:16:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34562/harvest-a-suite-of-core-genome-alignment-and-visualization-tools</link>
	<title><![CDATA[Harvest: a suite of core-genome alignment and visualization tools]]></title>
	<description><![CDATA[<p>Harvest is a suite of core-genome alignment and visualization tools for quickly analyzing thousands of intraspecific microbial genomes, including variant calls, recombination detection, and phylogenetic trees.</p>
<p><a href="https://harvest.readthedocs.io/en/latest/_images/screen.png"><img src="https://harvest.readthedocs.io/en/latest/_images/screen.png" alt="_images/screen.png" style="border: 0px;"></a><span></span></p>
<p><strong>Tools</strong></p>
<ul>
<li><a href="https://harvest.readthedocs.io/en/latest/content/parsnp.html">Parsnp</a>&nbsp;- Core-genome alignment and analysis</li>
<li><a href="https://harvest.readthedocs.io/en/latest/content/gingr.html">Gingr</a>&nbsp;- Interactive visualization of alignments, trees and variants</li>
<li><a href="https://harvest.readthedocs.io/en/latest/content/harvest-tools.html">HarvestTools</a>&nbsp;- Archiving and postprocessing</li>
<li></li>
</ul><p>Address of the bookmark: <a href="https://harvest.readthedocs.io/en/latest/" rel="nofollow">https://harvest.readthedocs.io/en/latest/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34920/xmatchview-smith-waterman-alignment-visualization</guid>
	<pubDate>Thu, 28 Dec 2017 09:00:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34920/xmatchview-smith-waterman-alignment-visualization</link>
	<title><![CDATA[xmatchview: smith-waterman alignment visualization]]></title>
	<description><![CDATA[<p><span>xmatchview and xmatchview-conifer are imaging tools for comparing the synteny between DNA sequences. It allows users to align 2 DNA sequences in fasta format using cross_match and displays the alignment in a variety of image formats. xmatchview and xmatchview-conifer are written in python and run on linux and windows. They serve as visual tools for analyzing cross_match alignments. Cross_match (Green, P. (1994)&nbsp;</span><a href="http://www.phrap.org/">http://www.phrap.org</a><span>) uses an implementation of the Smith-Waterman algorithm for comparing DNA sequences that is sensitive.</span></p>
<p><span>http://www.bcgsc.ca/platform/bioinfo/software/xmatchview</span></p><p>Address of the bookmark: <a href="https://github.com/warrenlr/xmatchview" rel="nofollow">https://github.com/warrenlr/xmatchview</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37198/understanding-blastn-output-format-6</guid>
	<pubDate>Wed, 27 Jun 2018 18:38:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37198/understanding-blastn-output-format-6</link>
	<title><![CDATA[Understanding BLASTn output format 6 !]]></title>
	<description><![CDATA[<h3 id="sites-page-title-header" style="text-align: left;"><span>BLASTn output format 6</span></h3><div id="sites-canvas-main"><div id="sites-canvas-main-content"><div dir="ltr"><div><div><em>BLASTn</em> maps DNA against DNA, for example gene sequences against a reference genome<br /><br /><code><strong>blastn</strong>  -query <span>genes.ffn</span>  -subject <span>genome.fna</span>  -outfmt <strong>6</strong></code></div><h2>BLASTn tabular output format 6</h2>
<p><strong>Column headers:</strong><br /><code>qseqid sseqid pident length mismatch gapopen qstart qend sstart send evalue bitscore</code><br /></p>
<table border="1" cellspacing="0">
<tbody>
<tr>
<td> 1.</td>
<td> qseqid</td>
<td> query (e.g., gene) sequence id</td>
</tr>
<tr>
<td> 2.</td>
<td> sseqid</td>
<td> subject (e.g., reference genome) sequence id</td>
</tr>
<tr>
<td> 3.</td>
<td> pident</td>
<td> percentage of identical matches</td>
</tr>
<tr>
<td> 4.</td>
<td> length</td>
<td> alignment length</td>
</tr>
<tr>
<td> 5.</td>
<td> mismatch</td>
<td> number of mismatches</td>
</tr>
<tr>
<td> 6.</td>
<td> gapopen</td>
<td> number of gap openings</td>
</tr>
<tr>
<td> 7.</td>
<td> qstart</td>
<td> start of alignment in query</td>
</tr>
<tr>
<td> 8.</td>
<td> qend</td>
<td> end of alignment in query</td>
</tr>
<tr>
<td> 9.</td>
<td> sstart</td>
<td> start of alignment in subject</td>
</tr>
<tr>
<td> 10.</td>
<td> send</td>
<td> end of alignment in subject</td>
</tr>
<tr>
<td> 11.</td>
<td> evalue</td>
<td> <a href="http://www.metagenomics.wiki/tools/blast/evalue">expect value</a></td>
</tr>
<tr>
<td> 12.</td>
<td> bitscore</td>
<td> <a href="http://www.metagenomics.wiki/tools/blast/evalue"><strong>bit score</strong></a></td>
</tr>
</tbody>
</table>
<p><strong><br /></strong></p>
</div><h2><a name="TOC-Define-your-own-output-format" id="TOC-Define-your-own-output-format"></a>Define your own output format</h2><div><em>by adding the option -outfmt, as for example: </em><strong><br /></strong></div>
<p><code><strong>-outfmt</strong> <strong>"6</strong> <span>qseqid sseqid pident qlen length mismatch gapope evalue bitscore</span><strong>"</strong></code><br /><br /><em><strong>supported format specifiers are:</strong></em><br /><code>qseqid    </code>Query Seq-id<br /><code>qgi       </code>Query GI<br /><code>qacc      </code>Query accesion<br /><code>qaccver   </code>Query accesion.version<br /><code>qlen      </code>Query sequence length<br /><code>sseqid    </code>Subject Seq-id<br /><code>sallseqid </code>All subject Seq-id(s), separated by a ';'<br /><code>sgi       </code>Subject GI<br /><code>sallgi    </code>All subject GIs<br /><code>sacc      </code>Subject accession<br /><code>saccver   </code>Subject accession.version<br /><code>sallacc   </code>All subject accessions<br /><code>slen      </code>Subject sequence length<br /><code>qstart    </code>Start of alignment in query<br /><code>qend      </code>End of alignment in query<br /><code>sstart    </code>Start of alignment in subject<br /><code>send      </code>End of alignment in subject<br /><code>qseq      </code>Aligned part of query sequence<br /><code>sseq      </code>Aligned part of subject sequence<br /><code>evalue    </code>Expect value<br /><code>bitscore  </code>Bit score<br /><code>score     </code>Raw score<br /><code>length    </code>Alignment length<br /><code>pident    </code>Percentage of identical matches<br /><code>nident    </code>Number of identical matches<br /><code>mismatch  </code>Number of mismatches<br /><code>positive  </code>Number of positive-scoring matches<br /><code>gapopen   </code>Number of gap openings<br /><code>gaps      </code>Total number of gaps<br /><code>ppos      </code>Percentage of positive-scoring matches<br /><code>frames    </code>Query and subject frames separated by a '/'<br /><code>qframe    </code>Query frame<br /><code>sframe    </code>Subject frame<br /><code>btop      </code>Blast traceback operations (BTOP)<br /><code>staxids   </code>Subject Taxonomy ID(s), separated by a ';'<br /><code>sscinames </code>Subject Scientific Name(s), separated by a ';'<br /><code>scomnames </code>Subject Common Name(s), separated by a ';'<br /><code>sblastnames </code>Subject Blast Name(s), separated by a ';'   (in alphabetical order)<br /><code>sskingdoms  </code>Subject Super Kingdom(s), separated by a ';'     (in alphabetical order) <br /><code>stitle      </code>Subject Title<br /><code>salltitles  </code>All Subject Title(s), separated by a '&lt;&gt;'<br /><code>sstrand   </code>Subject Strand<br /><code>qcovs     </code>Query Coverage Per Subject<br /><code>qcovhsp   </code>Query Coverage Per HSP<br /><strong><br /><em>default values are:</em></strong><br /><code><code>-outfmt "</code>6 qseqid sseqid pident length mismatch gapopen qstart qend sstart send evalue bitscore"</code></p>
</div></div></div>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37677/installing-blat-on-linux</guid>
	<pubDate>Tue, 11 Sep 2018 08:17:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37677/installing-blat-on-linux</link>
	<title><![CDATA[Installing BLAT on Linux !]]></title>
	<description><![CDATA[<p><span>It's been a while since I last installed BLAT and when I went to the download directory at UCSC:&nbsp;</span><a href="http://users.soe.ucsc.edu/~kent/src/">http://users.soe.ucsc.edu/~kent/src/</a><span>&nbsp;I found that the latest blast is now version 35 and that the code to download was:&nbsp;</span><a href="http://users.soe.ucsc.edu/~kent/src/blatSrc35.zip">blatSrc35.zip</a><span>. However, you can also get pre-compiled binaries at:&nbsp;</span><a href="http://hgdownload.cse.ucsc.edu/admin/exe/">http://hgdownload.cse.ucsc.edu/admin/exe/</a><span>&nbsp;and that there was a linux x86_64 executable for my architecture available at:&nbsp;</span><a href="http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/blat/">http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/blat/</a><span>. Though YYMV, BLAT can be a little bit of a tricky beast to get going, so I decided to download the source code and compile that.</span><br /><br /><span>I will be compiling this code as 'root' as a system tool in&nbsp;</span><code>/usr/local/src</code><span>, so do not scream at me for that.</span><br /><br /><span>First I created an /usr/local/src/blat directory and I copied the blatSrc35.zip file into that.</span><br /><br /><span>Next I used</span></p><pre><code>unzip blatSrc35.zip</code></pre><p><span>to unpack the archive. This gives a directory blatSrc now move into that directory.</span></p><pre><code>#cd blatSrc</code></pre><p><span>before you begin read the README file that comes with the source code.</span><br /><br /><span>One thing about building blat is that you need to set the MACHTYPE variable so that the BLAT sources know what type of machine you are compiling the software on.</span><br /><br /><span>on most *nix machines, typing</span></p><pre><code>echo $MACHTYPE</code></pre><p><span>will return the machine architecture type.</span><br /><br /><span>On my CentOS 6 based system this gave:</span></p><pre><code>x86_64-redhat-linux-gnu</code></pre><p><span>However, what BLAT requires is the 'short value' (ie the first part of the MACHTYPE). To correct this, in the bash shell type (change this to the correct MACHTYPE for your system)</span></p><pre><code>MACHTYPE=x86_64
export MACHTYPE</code></pre><p><span>now running the command:</span></p><pre><code>echo $MACHTYPE</code></pre><p><span>should give the correct short form of the MACHTYPE:</span></p><pre><code>x86_64</code></pre><p><span>now create the directory lib/$MACHTYPE in the source tree. ie:</span></p><pre><code>mkdir lib/$MACHTYPE</code></pre><p><span>For my machine, lib/x86_64 already existed, so I did not have to do this, but this is not the case for all architectures.</span><br /><br /><span>The BLAT code assumes that you are compiling BLAT as a non-privileged (ie non-root) user. As a result, you must create the directory for the executables to go into:</span><br /><br /><span>mkdir ~/bin/$MACHTYPE</span><br /><br /><span>If you are installing as a normal user, edit your .bashrc to add the following (change the x86_64 to be your MACHTYPE):</span><br /><br /><span>export PATH=~/bin/x86_64::$PATH</span><br /><br /><span>For me, though, this was not good enough. I wanted the executables in /usr/local/bin where all my other code goes. As a result I did some hackery...</span><br /><br /><span>There is a master make template in the&nbsp;</span><code>inc</code><span>&nbsp;directory called&nbsp;</span><code>common.mk</code><span>&nbsp;and I edited this file with the command:</span><br /><br /><span>vi inc/common.mk</span><br /><br /><span>I replaced the line</span></p><pre><code>    BINDIR=${HOME}/bin/${MACHTYPE}</code></pre><p><span>with</span></p><pre><code>    BINDIR=/usr/local/bin</code></pre><p><span>saved and quit (as this is in my path, I do not need to do anything else)</span><br /><br /><span>All the preparation is now done and you can create the blat executables by going into the toplevel of the blat source tree (for me it was&nbsp;</span><code>/usr/local/src/blat/blatSrc</code><span>, but change to wherever you unpacked blat into).</span><br /><br /><span>Now simply run the command:</span></p><pre><code>make</code></pre><p><span>to compile the code.</span><br /><br /><span>Blat installed cleanly and the executables were all neatly placed in /usr/local/bin/x86_64, just like I wanted.</span><br /><br /><span>now simply running the command:</span></p><pre><code>blat</code></pre><p><span>on the command line gives me information on blat and sample usage.</span><br /><br /><span>Blat is installed and it's installed properly in my system code tree!!!</span></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</guid>
	<pubDate>Mon, 04 Nov 2019 07:09:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</link>
	<title><![CDATA[Shouji: a fast and efficient pre-alignment filter for sequence alignment]]></title>
	<description><![CDATA[<p>The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.</p>
<p>&nbsp;<img src="https://github.com/BilkentCompGen/Shoji/raw/master/Figure1-GitHub.png" alt="image" style="border: 0px;"></p>
<p>We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.</p>
<p>More at <a href="https://github.com/CMU-SAFARI/Shouji">https://github.com/CMU-SAFARI/Shouji</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Shouji" rel="nofollow">https://github.com/CMU-SAFARI/Shouji</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42405/caretta-%E2%80%93-a-multiple-protein-structure-alignment-and-feature-extraction-suite</guid>
	<pubDate>Fri, 18 Dec 2020 02:09:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42405/caretta-%E2%80%93-a-multiple-protein-structure-alignment-and-feature-extraction-suite</link>
	<title><![CDATA[Caretta – A multiple protein structure alignment and feature extraction suite]]></title>
	<description><![CDATA[<h3>Caretta &ndash;&nbsp;a multiple protein structure alignment and feature extraction suite</h3>
<p><span>Caretta, a multiple structure alignment suite meant for homologous but sequentially divergent protein families which consistently returns accurate alignments with a higher coverage than current state-of-the-art tools. Caretta is available as a GUI and command-line application and additionally outputs an aligned structure feature matrix for a given set of input structures, which can readily be used in downstream steps for supervised or unsupervised machine learning.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.bioinformatics.nl/caretta/" rel="nofollow">http://www.bioinformatics.nl/caretta/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</guid>
	<pubDate>Fri, 01 Feb 2019 11:55:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</link>
	<title><![CDATA[Evaluation of genome assembly software based on long reads]]></title>
	<description><![CDATA[<p>TGS technologies have been used to produce highly accurate de novo assemblies of hundreds of microbial genomes and highly contiguous reconstructions of many dozens of plant and animal genomes, enabling new insights into evolution and sequence diversity. They have also been applied to resequencing analyses, to create detailed maps of structural variations in many species. Also, these new technologies have been used to fill in many of the gaps in the human reference genome.</p><p>In this report, we compare and evaluate several genome assembly software based on TSG technology. The experimentation has been performed on 4 reference genomes and the results evaluated with the QUAST software. The 11 software that have been evaluated are: Celera Assembler , Falcon , Miniasm, Newbler , SGA Assembler, Smartdenovo, Abruijn, Ra, DBG2OLC, Spades and Cerulean. The first 8 software use only long reads, while the 3 last software can merge long and short reads</p>]]></description>
	<dc:creator>BioStar</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/38886" length="382699" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</guid>
	<pubDate>Fri, 17 Sep 2021 01:57:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</link>
	<title><![CDATA[LncPipe:A Nextflow-based pipeline for comprehensive analyses of long non-coding RNAs from RNA-seq datasets]]></title>
	<description><![CDATA[<p><span>The pipeline was developed based on a popular workflow framework&nbsp;</span><a href="https://github.com/nextflow-io/nextflow">Nextflow</a><span>, composed of four core procedures including reads alignment, assembly, identification and quantification. It contains various unique features such as well-designed lncRNAs annotation strategy, optimized calculating efficiency, diversified classification and interactive analysis report.&nbsp;</span><a href="https://github.com/likelet/LncPipe">LncPipe</a><span>&nbsp;allows users additional control in interuppting the pipeline, resetting parameters from command line, modifying main script directly and resume analysis from previous checkpoint.</span></p>
<p>Ref&nbsp;https://www.lncrnablog.com/lncpipe-a-nextflow-based-pipeline-for-identification-and-analysis-of-long-non-coding-rnas-from-rna-seq-data/</p>
<p><img src="https://ars.els-cdn.com/content/image/1-s2.0-S1673852718301176-gr1.jpg" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/likelet/LncPipe" rel="nofollow">https://github.com/likelet/LncPipe</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>