<?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/44234?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/44234?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</guid>
	<pubDate>Fri, 01 Nov 2019 00:20:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</link>
	<title><![CDATA[Kalign: fast multiple sequence alignment program for biological sequences.]]></title>
	<description><![CDATA[<p><span>Kalign is a fast multiple sequence alignment program for biological sequences.</span></p>
<p>Align sequences and output the alignment in MSF format:</p>
<pre><code>kalign -i BB11001.tfa -f msf  -o out.msf
</code></pre>
<p>Align sequences and output the alignment in clustal format:</p>
<pre><code>kalign -i BB11001.tfa -f clu -o out.clu
</code></pre>
<p>Re-align sequences in an existing alignment:</p>
<pre><code>kalign -i BB11001.msf  -o out.afa
</code></pre>
<p>Reformat existing alignment:</p>
<pre><code>kalign -i BB11001.msf -r afa -o out.afa</code></pre><p>Address of the bookmark: <a href="https://github.com/TimoLassmann/kalign" rel="nofollow">https://github.com/TimoLassmann/kalign</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41602/nucdiff-in-depth-characterization-and-annotation-of-differences-between-two-sets-of-dna-sequences</guid>
	<pubDate>Tue, 05 May 2020 10:35:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41602/nucdiff-in-depth-characterization-and-annotation-of-differences-between-two-sets-of-dna-sequences</link>
	<title><![CDATA[NucDiff: In-depth characterization and annotation of differences between two sets of DNA sequences]]></title>
	<description><![CDATA[<p>NucDiff locates and categorizes differences between two closely related nucleotide sequences. It is able to deal with very fragmented genomes, structural rearrangements and various local differences. These features make NucDiff to be perfectly suitable to compare assemblies with each other or with available reference genomes.</p>
<p>NucDiff provides information about the types of differences and their locations. It is possible to upload the results into genome browser for visualization and further inspection. It was written in Python and uses the NUCmer package from MUMmer[1] for sequence comparison.</p>
<p><br><br></p><p>Address of the bookmark: <a href="https://github.com/uio-cels/NucDiff" rel="nofollow">https://github.com/uio-cels/NucDiff</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</guid>
	<pubDate>Fri, 26 Jul 2024 06:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</link>
	<title><![CDATA[Basics of BLAST Programs !]]></title>
	<description><![CDATA[<p>The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity. Developed by the National Center for Biotechnology Information (NCBI), BLAST is widely used for identifying species, finding functional and evolutionary relationships between sequences, and predicting the function of novel sequences.</p><p>Key Features of BLAST:<br />1. Sequence Comparison: BLAST searches for local alignments between the query sequence and sequences in a database. It identifies regions of similarity, which can help infer functional and evolutionary relationships.</p><p>2. Speed and Efficiency: BLAST uses heuristic algorithms, making it faster than exhaustive search methods, suitable for large-scale database searches.</p><p>3. Versatility: There are several versions of BLAST for different types of sequence comparisons:<br /> - blastn: Compares a nucleotide query sequence against a nucleotide sequence database.<br /> - blastp: Compares a protein query sequence against a protein sequence database.<br /> - blastx: Compares a nucleotide query sequence translated in all reading frames against a protein sequence database.<br /> - tblastn: Compares a protein query sequence against a nucleotide sequence database translated in all reading frames.<br /> - tblastx: Compares the six-frame translations of a nucleotide query sequence against the six-frame translations of a nucleotide sequence database.</p><p>4. Scoring and E-value: BLAST results are scored based on the quality and length of the alignments. The E-value (expect value) indicates the number of alignments one can expect to find by chance, with lower E-values representing more significant matches.</p><p>5. Output Formats: BLAST provides results in various formats, including plain text, HTML, XML, and JSON, making it adaptable for different types of analyses and integrations with other tools.</p><p>Applications of BLAST:<br />- Genomic Research: Identifying genes, understanding genetic diversity, and mapping genome sequences.<br />- Protein Function Prediction: Inferring the function of unknown proteins by comparing them to known protein sequences.<br />- Evolutionary Studies: Exploring evolutionary relationships between organisms by comparing their genetic material.<br />- Medical Research: Identifying pathogens, understanding disease mechanisms, and developing treatments by comparing sequences of interest.</p><p>Overall, BLAST is an essential tool in bioinformatics, offering a reliable and efficient way to analyze and interpret biological sequence data.</p>]]></description>
	<dc:creator>BioStar</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/pages/view/43954/elgg-installation-steps</guid>
	<pubDate>Wed, 07 Sep 2022 00:43:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/43954/elgg-installation-steps</link>
	<title><![CDATA[Elgg Installation steps !]]></title>
	<description><![CDATA[<p>Elgg is an open source social networking engine that allows the creation of social environments such as campus social networks and internal collaborative platforms for organizations. Elgg offers a number of social networking features including microblogging, messaging, file-sharing and groups. This tutorial will guide you through the process of installing Elgg on a Ubuntu 18.04 VPS.</p><h2 id="Prerequisites">Prerequisites</h2><ul>
<li>A fresh Vultr Cloud Compute instance with Ubuntu 18.04 and root access.</li>
</ul><h2 id="Step_1__Install_Apache__MySQL__and_PHP">Step 1: Install Apache, MySQL, and PHP</h2><p>Elgg requires MySQL, PHP, and a web server. Before you can install Elgg, you will need to install the Apache web server, MySQL, and PHP.</p><p>Update the repository list.</p><pre><code>apt-get update
</code></pre><p>Install the Apache web server.</p><pre><code>apt-get install apache2 -y
</code></pre><p>Install MySQL.</p><pre><code>apt-get install mysql-server -y
</code></pre><p>Complete the MySQL installation by executing the following command.</p><pre><code>/usr/bin/mysql_secure_installation
</code></pre><p>During the installation, you will be asked to enter a root password. Enter a secure password. This will be the MySQL root password.</p><pre><code>Would you like to setup VALIDATE PASSWORD plugin? [Y/N] N
New password: password
Re-enter new password: password
Remove anonymous users? [Y/N] Y
Disallow root login remotely? [Y/N] Y
Remove test database and access to it? [Y/N] Y
Reload privilege tables now? [Y/N] Y
</code></pre><p>Install PHP 7.2, as well as the PHP modules required by Elgg.</p><pre><code>apt-get install php7.2 libapache2-mod-php7.2 php7.2-common php7.2-sqlite3 php7.2-curl php7.2-intl php7.2-mbstring php7.2-xmlrpc php7.2-mysql php7.2-gd php7.2-xml php7.2-cli php7.2-zip -y
</code></pre><h2 id="Step_2__Create_a_MySQL_database_for_Elgg">Step 2: Create a MySQL database for Elgg</h2><p>Elgg will require a MySQL database. Log into the MySQL console.</p><pre><code>mysql -u root -p
</code></pre><p>When prompted for a password, enter the MySQL root password you set in step 1. Once you are logged in to the MySQL console, create a new database.</p><pre><code>CREATE DATABASE elgg;
</code></pre><p>Create a new MySQL user and grant it privileges to the newly created database. You can replace&nbsp;<code>username</code>&nbsp;and&nbsp;<code>password</code>&nbsp;with the username and password of your choice.</p><pre><code>GRANT ALL PRIVILEGES on elgg.* to 'username'@'localhost' identified by 'password';
FLUSH PRIVILEGES;
</code></pre><p>Exit the MySQL console.</p><pre><code>exit
</code></pre><h2 id="Step_3__Download_and_Install_Elgg">Step 3: Download and Install Elgg</h2><p>Download the latest version of Elgg.</p><pre><code>cd /var/www/html
rm -r index.html
wget https://elgg.org/download/elgg-2.3.7.zip
</code></pre><p>Unzip the downloaded archive and move the files to the root of the Apache web server.</p><pre><code>apt install unzip
unzip elgg-2.3.7.zip
mv ./elgg-2.3.7/* . &amp;&amp; rm elgg-2.3.7.zip &amp;&amp; rm -r elgg-2.3.7
</code></pre><p>Create a data directory for Elgg.</p><pre><code>sudo mkdir -p /var/www/html/data
</code></pre><p>Set the appropriate file permissions.</p><pre><code>sudo chown -R www-data:www-data /var/www/html/
sudo chmod -R 755 /var/www/html/
</code></pre><h2 id="Step_4__Configure_Apache_for_Elgg">Step 4: Configure Apache for Elgg</h2><p>Elgg requires the Apache rewrite module. Enable the Apache rewrite module.</p><pre><code>sudo a2enmod rewrite
</code></pre><p>Create an Apache configuration file for the Elgg installation.</p><pre><code>sudo nano /etc/apache2/sites-available/elgg.conf
</code></pre><p>Paste the following snippet to the file, replacing&nbsp;<code>example.com</code>&nbsp;with your own domain name.</p><pre><code>&lt;VirtualHost *:80&gt;
     DocumentRoot /var/www/html/
     ServerName example.com
     &lt;Directory /var/www/html/&gt;
          Options FollowSymlinks
          AllowOverride All
          Require all granted
     &lt;/Directory&gt;
     ErrorLog ${APACHE_LOG_DIR}/error.log
     CustomLog ${APACHE_LOG_DIR}/access.log combined
&lt;/VirtualHost&gt;
</code></pre><p>Enable the configuration and restart the Apache server.</p><pre><code> sudo a2ensite elgg.conf
 sudo systemctl restart apache2.service</code></pre>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</guid>
	<pubDate>Tue, 28 Jan 2020 03:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</link>
	<title><![CDATA[VG: variation graph data structures, interchange formats, alignment, genotyping, and variant calling methods]]></title>
	<description><![CDATA[<p><em>Variation graphs</em>&nbsp;provide a succinct encoding of the sequences of many genomes. A variation graph (in particular as implemented in vg) is composed of:</p>
<ul>
<li><em>nodes</em>, which are labeled by sequences and ids</li>
<li><em>edges</em>, which connect two nodes via either of their respective ends</li>
<li><em>paths</em>, describe genomes, sequence alignments, and annotations (such as gene models and transcripts) as walks through nodes connected by edges</li>
</ul><p>Address of the bookmark: <a href="https://github.com/vgteam/vg" rel="nofollow">https://github.com/vgteam/vg</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34445/inc-seq-accurate-single-molecule-reads-using-nanopore-sequencing</guid>
	<pubDate>Mon, 27 Nov 2017 10:38:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34445/inc-seq-accurate-single-molecule-reads-using-nanopore-sequencing</link>
	<title><![CDATA[INC-Seq: accurate single molecule reads using nanopore sequencing]]></title>
	<description><![CDATA[<p><span>INC-Seq reads enabled accurate species-level classification, identification of species at 0.1&nbsp;% abundance and robust quantification of relative abundances, providing a cheap and effective approach for pathogen detection and microbiome profiling on the MinION system.</span></p><p>Address of the bookmark: <a href="https://github.com/CSB5/INC-Seq" rel="nofollow">https://github.com/CSB5/INC-Seq</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35883/arcs-scaffolding-genome-drafts-with-linked-reads</guid>
	<pubDate>Tue, 06 Mar 2018 16:35:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35883/arcs-scaffolding-genome-drafts-with-linked-reads</link>
	<title><![CDATA[ARCS: scaffolding genome drafts with linked reads]]></title>
	<description><![CDATA[<p><span>ARCS, an application that utilizes the barcoding information contained in linked reads to further organize draft genomes into highly contiguous assemblies. We show how the contiguity of an ABySS&nbsp;</span><em>H.sapiens</em><span>genome assembly can be increased over six-fold, using moderate coverage (25-fold) Chromium data. We expect ARCS to have broad utility in harnessing the barcoding information contained in linked read data for connecting high-quality sequences in genome assembly drafts.</span></p><p>Address of the bookmark: <a href="https://github.com/bcgsc/ARCS/" rel="nofollow">https://github.com/bcgsc/ARCS/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</guid>
	<pubDate>Tue, 08 May 2018 04:27:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</link>
	<title><![CDATA[HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads]]></title>
	<description><![CDATA[<p><strong>HISAT2</strong><span>&nbsp;is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for graphs&nbsp;</span><a href="http://dl.acm.org/citation.cfm?id=2674828">[Sir&eacute;n et al. 2014]</a><span>, we designed and implemented a graph FM index (GFM), an original approach and its first implementation to the best of our knowledge. In addition to using one global GFM index that represents a population of human genomes, HISAT2 uses a large set of small GFM indexes that collectively cover the whole genome (each index representing a genomic region of 56 Kbp, with 55,000 indexes needed to cover the human population). These small indexes (called local indexes), combined with several alignment strategies, enable rapid and accurate alignment of sequencing reads. This new indexing scheme is called a Hierarchical Graph FM index (HGFM).&nbsp;</span></p>
<p><span>more at&nbsp;https://ccb.jhu.edu/software/hisat2/index.shtml</span></p><p>Address of the bookmark: <a href="https://github.com/infphilo/hisat2" rel="nofollow">https://github.com/infphilo/hisat2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36635/circlator-automated-circularization-of-genome-assemblies-using-long-sequencing-reads</guid>
	<pubDate>Tue, 15 May 2018 09:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36635/circlator-automated-circularization-of-genome-assemblies-using-long-sequencing-reads</link>
	<title><![CDATA[Circlator: automated circularization of genome assemblies using long sequencing reads]]></title>
	<description><![CDATA[A tool to circularize genome assemblies. The algorithm and benchmarks are described in the Genome Biology manuscript. 

Citation: "Circlator: automated circularization of genome assemblies using long sequencing reads", Hunt et al, Genome Biology 2015 Dec 29;16(1):294. doi: 10.1186/s13059-015-0849-0. PMID: 26714481.<p>Address of the bookmark: <a href="http://sanger-pathogens.github.io/circlator/" rel="nofollow">http://sanger-pathogens.github.io/circlator/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>