<?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/38304?offset=100</link>
	<atom:link href="https://bioinformaticsonline.com/related/38304?offset=100" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/bookmarks/view/27216/yass-genomic-similarity-search-tool</guid>
	<pubDate>Mon, 02 May 2016 09:26:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27216/yass-genomic-similarity-search-tool</link>
	<title><![CDATA[YASS :: genomic similarity search tool]]></title>
	<description><![CDATA[<p>YASS is a genomic similarity search tool, for nucleic (DNA/RNA) sequences in fasta or plain text format (<em>it produces local pairwise alignments</em>). Like most of the heuristic pairwise local alignment tools for DNA sequences (FASTA, BLAST, PATTERNHUNTER, BLASTZ/LASTZ, LAST ...), YASS uses <em>seeds</em> to detect potential similarity regions, and then tries to extend them to local alignments. This genomic search tool uses <em>multiple transition constrained spaced seeds</em> that enable to search more fuzzy repeats, as non-coding DNA/RNA. Another simple, but interesting feature is that you can specify the seed pattern used in the search step (as provided for example by <a href="http://bioinfo.lifl.fr/yass/iedera.php">iedera</a>).</p>
<p>Main features of YASS are:</p>
<ul>
<li>multiple, possibly overlapping seeds and a new hit criterion to ensure a good sensitivity/selectivity trade-off</li>
<li>transition-constrained spaced seeds to improve sensitivity (transition mutations are purine to purine [<code>A&lt;-&gt;G</code>] or pyrimidine to pyrimidine [<code>C&lt;-&gt;T</code>])</li>
<li>using different scoring schemes with bit-score and E-value evaluated according to the sequence background frequencies</li>
<li>parameterizable <em>output</em> filter for low complexity repeats</li>
<li>reporting of various alignment statistical parameters (mutation bias along triplets, transition/transversion)</li>
<li>post-processing step to group gapped alignments</li>
</ul><p>Address of the bookmark: <a href="http://bioinfo.lifl.fr/yass/" rel="nofollow">http://bioinfo.lifl.fr/yass/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</guid>
	<pubDate>Wed, 01 Mar 2017 08:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31207/laj-viewing-and-manipulating-the-output-from-pairwise-alignment-programs</link>
	<title><![CDATA[Laj: viewing and manipulating the output from pairwise alignment programs]]></title>
	<description><![CDATA[<p>Laj is a tool for viewing and manipulating the output from pairwise alignment programs such as <a href="http://bio.cse.psu.edu/">blastz</a>. It can display interactive dotplot, pip, and text representations of the alignments, a diagram showing the locations of exons and repeats, and annotation links to other web sites containing additional information about particular regions.</p>
<p>The program is written in Java in order to provide a graphical user interface that is portable across a variety of computer platforms; indeed its name stands for "Local Alignments with Java". Currently it exists in two forms, a stand-alone application and a web-based applet, with slightly different capabilities.</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/~ratan/" rel="nofollow">http://www.bx.psu.edu/~ratan/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</guid>
	<pubDate>Tue, 02 May 2017 07:58:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</link>
	<title><![CDATA[Mapping NGS]]></title>
	<description><![CDATA[<p>NGS data are just a bunch of sequences, you have no idea which region in the genome each sequences comes from, which gene it represents...<br>To know that you have to align the sequences to the reference sequence. The reference sequence is in most cases the full genome sequence but sometimes, a library of EST sequences is used.<br>In either way, aligning your sequence reads to the reference sequence is called mapping.</p>
<p>The most used mappers of DNA-seq data are&nbsp;<a href="http://bio-bwa.sourceforge.net/" target="_blank">BWA</a>&nbsp;and&nbsp;<a href="http://bowtie-bio.sourceforge.net/bowtie2/index.shtml" target="_blank">Bowtie</a>&nbsp;for DNA-Seq data and&nbsp;<a href="http://tophat.cbcb.umd.edu/" target="_blank">Tophat</a>,&nbsp;<a href="https://github.com/alexdobin/STAR" target="_blank">STAR</a>&nbsp;or&nbsp;<a href="http://www.ccb.jhu.edu/software/hisat/index.shtml" target="_blank">HISAT</a>&nbsp;for RNA-Seq data. Mappers differ in which options they can take in, how fast and how accurate they are. Bowtie is faster than BWA, but looses some sensitivity (does not map an equal amount of reads to the correct position in the genome).</p><p>Address of the bookmark: <a href="http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data" rel="nofollow">http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39017/macse-multiple-alignment-of-coding-sequences-accounting-for-frameshifts-and-stop-codons</guid>
	<pubDate>Mon, 18 Feb 2019 04:21:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39017/macse-multiple-alignment-of-coding-sequences-accounting-for-frameshifts-and-stop-codons</link>
	<title><![CDATA[MACSE: Multiple Alignment of Coding SEquences Accounting for Frameshifts and Stop Codons]]></title>
	<description><![CDATA[<p>MACSE aligns coding NT sequences with respect to their AA translation while allowing NT sequences to contain multiple frameshifts and/or stop codons. MACSE is hence the first automatic solution to align protein-coding gene datasets containing non-functional sequences (pseudogenes) without disrupting the underlying codon structure. It has also proved useful in detecting undocumented frameshifts in public database sequences and in aligning next-generation sequencing reads/contigs against a reference coding sequence.</p>
<p>For further details about the underlying algorithm see the original publication:<br><a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0022594" target="_new">MACSE: Multiple Alignment of Coding SEquences accounting for frameshifts and stop codons.<br>Vincent Ranwez, S&eacute;bastien Harispe, Fr&eacute;d&eacute;ric Delsuc, Emmanuel JP Douzery<br>PLoS One 2011, 6(9): e22594</a>.</p><p>Address of the bookmark: <a href="https://bioweb.supagro.inra.fr/macse/index.php?menu=releases" rel="nofollow">https://bioweb.supagro.inra.fr/macse/index.php?menu=releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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>

</channel>
</rss>