<?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/32855?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/32855?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/33006/avid-a-global-alignment-program</guid>
	<pubDate>Wed, 24 May 2017 05:19:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33006/avid-a-global-alignment-program</link>
	<title><![CDATA[AVID: A Global Alignment Program]]></title>
	<description><![CDATA[<p>A new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36216/crusview</guid>
	<pubDate>Thu, 12 Apr 2018 09:22:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36216/crusview</link>
	<title><![CDATA[CrusView]]></title>
	<description><![CDATA[<p><span>CrusView&nbsp;is a java based tool for karyotype/genome visualization and comparison of crucifer&nbsp;Species. It also integrates an binary version of KGBassembler and a&nbsp;post-modification step for its assembling result.</span></p><p>Address of the bookmark: <a href="http://www.cmbb.arizona.edu/?page_id=250" rel="nofollow">http://www.cmbb.arizona.edu/?page_id=250</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/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/42150/parallellastz-lastz-with-multi-threads-support</guid>
	<pubDate>Sat, 22 Aug 2020 05:58:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42150/parallellastz-lastz-with-multi-threads-support</link>
	<title><![CDATA[parallelLastz: Lastz with multi-threads support.]]></title>
	<description><![CDATA[<p>Running Lastz (<a href="https://github.com/lastz/lastz">https://github.com/lastz/lastz</a>) in parallel mode. This program is for single computer with multiple core processors.</p>
<p>When the query file format is fasta, you can specify many threads to process it. It can reduce run time linearly, and use almost equal memory as the original lastz program. This is useful when you lastz a big query file to a huge reference like human whole genome sequence.</p>
<p>The program is an extension on the original lastz program which was written by Bob Harris (the LASTZ guy).</p><p>Address of the bookmark: <a href="https://github.com/jnarayan81/parallelLastz" rel="nofollow">https://github.com/jnarayan81/parallelLastz</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</guid>
	<pubDate>Thu, 28 Aug 2025 02:56:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</link>
	<title><![CDATA[AlfaPang: alignment free algorithm for pangenome graph construction]]></title>
	<description><![CDATA[<p><span>AlfaPang constructs variation graphs, leveraging its alignment-free and reference-free approach, based solely on intrinsic sequence properties. This design allows AlfaPang's runtime and memory usage to scale linearly with the size of input sequences, enabling it to handle significantly larger genome sets compared to other methods.</span></p><p>Address of the bookmark: <a href="https://github.com/AdamCicherski/AlfaPang" rel="nofollow">https://github.com/AdamCicherski/AlfaPang</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>