<?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/36711?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/36711?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</guid>
	<pubDate>Fri, 31 Jan 2020 02:36:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40789/complete-genome-sequence-of-wuhan-seafood-market-pneumonia-virus-is-out</link>
	<title><![CDATA[Complete genome sequence of Wuhan seafood market pneumonia virus is out !]]></title>
	<description><![CDATA[<p>Wuhan-Hu-1 claimed at least 40 lives and infected at least 1300 others in China. Cases are now being reported from Thailand, Singapore, Malaysia, South Korea, Japan, Vietnam, Nepal, France, Australia and even as far as the US.&nbsp;On Jan 10 2020, while news of the first fatality was barely trickling in, the <a href="https://www.ncbi.nlm.nih.gov/nuccore/MN908947">29,903 letters</a> constituting the viral genome from an affected individual in Wuhan had already been elucidated (even though a few corrections were made subsequently). All the viral genome sequences from affected individuals are very very close to each other. Several are identical and none has more than 5 differences (99.983% similarity). This strongly suggests that transmission into humans came from a single pointed source and happened very recently, between Sep-Dec 2019.</p><p>Check out the detail at https://www.ncbi.nlm.nih.gov/nuccore/MN908947</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41300/china%E2%80%99s-bgi-says-it-can-sequence-a-genome-for-just-100</guid>
	<pubDate>Sat, 29 Feb 2020 04:49:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41300/china%E2%80%99s-bgi-says-it-can-sequence-a-genome-for-just-100</link>
	<title><![CDATA[China’s BGI says it can sequence a genome for just $100]]></title>
	<description><![CDATA[<p>Using technology originally acquired in the US, the Chinese gene giant BGI Group says it will make genome sequencing cheaper than ever, breaking the $100 barrier for the first time.</p><p>The Shenzhen company says the low cost will be possible with an &ldquo;extreme&rdquo; DNA sequencing system it plans to offer that is capable of decoding the genomes of 100,000 people a year.</p><p>Ref:&nbsp;<a href="https://www.technologyreview.com/s/615289/china-bgi-100-dollar-genome/">https://www.technologyreview.com/s/615289/china-bgi-100-dollar-genome/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</guid>
	<pubDate>Tue, 25 Aug 2020 03:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</link>
	<title><![CDATA[VICUNA: a software tool that enables consensus assembly of ultra-deep sequence derived from diverse viral or other heterogeneous populations.]]></title>
	<description><![CDATA[<p><span>VICUNA</span><span>&nbsp;is a&nbsp;</span><em>de novo</em><span>&nbsp;assembly program targeting populations with high mutation rates. It creates a single linear representation of the mixed population on which intra-host variants can be mapped. For clinical samples rich in contamination (e.g., &gt;95%), VICUNA can leverage existing genomes, if available, to assemble only target-alike reads. After initial assembly, it can also use existing genomes to perform guided merging of contigs. For each data set (e.g., Illumina paired read, 454), VICUNA outputs consensus sequence(s) and the corresponding multiple sequence alignment of constituent reads. VICUNA efficiently handles ultra-deep sequence data with tens of thousands fold coverage.</span></p>
<p><a href="http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf">http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf</a></p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/viral-genomics/vicuna" rel="nofollow">https://www.broadinstitute.org/viral-genomics/vicuna</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Wed, 06 Oct 2021 07:01:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43439/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44508/a-web-based-tool-for-sequence-alignment-statistics-and-innovative-visualization</guid>
	<pubDate>Thu, 04 Apr 2024 01:44:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44508/a-web-based-tool-for-sequence-alignment-statistics-and-innovative-visualization</link>
	<title><![CDATA[A web-based tool for sequence alignment statistics and innovative visualization]]></title>
	<description><![CDATA[<p>AlignStatPlot, a new R package and online tool that is well-documented and easy-to usefor MSA and post-MSA analysis. This tool performs both traditional and cutting-edge analy-ses on sequencing data and generates new visualisation methods for MSA results. Whencompared to currently available tools, AlignStatPlot provides a robust ability to handle andvisualise diversity data, while the online version will save time and encourage researchersto focus on explaining their findings. It is a simple tool that can be used in conjunction withpopulation genetics software (PDF) AlignStatPlot: An R package and online tool for robust sequence alignment statistics and innovative visualization of big data.</p><p>Address of the bookmark: <a href="https://bioinformatics.um6p.ma/AlignStatPlot/" rel="nofollow">https://bioinformatics.um6p.ma/AlignStatPlot/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</guid>
	<pubDate>Thu, 31 Aug 2023 02:43:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</link>
	<title><![CDATA[Steps to find all the repeats in the genome !]]></title>
	<description><![CDATA[<div><p>To find repeats in a genome from 2 to 9 length using a Perl script, you can use the RepeatMasker tool with the "--length" option<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. Here's a step-by-step guide:</p></div><div><ol>
<li>Install RepeatMasker: First, you need to install RepeatMasker on your system. You can download it from the RepeatMasker website<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
</ol></div><div><ol>
<li>Prepare the genome sequence: Make sure you have the genome sequence in a FASTA file format. Let's assume the file is named "genome.fasta".</li>
</ol><blockquote><p>./RepeatMasker -pa &lt;number_of_processors&gt; -nolow -norna -no_is -div &lt;divergence_value&gt; -lib RepeatMaskerLib.embl -gff -xsmall -small -poly -species &lt;species_name&gt; -dir &lt;output_directory&gt; -length &lt;min_length&gt;-&lt;max_length&gt; genome.fasta</p></blockquote><div><p>Replace the following placeholders with appropriate values:</p><ul>
<li><code>&lt;number_of_processors&gt;</code>: The number of processors/threads you want to use for parallel processing.</li>
<li><code>&lt;divergence_value&gt;</code>: The divergence value for the species you are analyzing. You can find divergence values for different species in the RepeatMasker documentation<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
<li><code>&lt;species_name&gt;</code>: The name of the species you are analyzing.</li>
<li><code>&lt;output_directory&gt;</code>: The directory where you want the output files to be saved.</li>
<li><code>&lt;min_length&gt;</code>&nbsp;and&nbsp;<code>&lt;max_length&gt;</code>: The minimum and maximum lengths of the repeats you want to find (in this case, 2 and 9).</li>
</ul></div><div><ol>
<li>Analyze the output: RepeatMasker will generate several output files, including a .out file. You can parse this file to extract the information you need. There is a Perl tool called "one_code_to_find_them_all.pl" that can help you parse RepeatMasker output files<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. You can download it from the source provided.</li>
</ol></div><div><ol>
<li>Use the provided Perl script: Once you have the "one_code_to_find_them_all.pl" script, you can run it to conveniently parse the RepeatMasker output files. Here's an example of how to use it:</li>
</ol><blockquote><p>perl one_code_to_find_them_all.pl --rm &lt;RepeatMasker_out_file&gt; --length &lt;length_file&gt;</p></blockquote></div><p>&nbsp;</p></div><div><div><p>Replace&nbsp;<code>&lt;RepeatMasker_out_file&gt;</code>&nbsp;with the path to your RepeatMasker .out file, and&nbsp;<code>&lt;length_file&gt;</code>&nbsp;with the path to a file containing the lengths of the reference elements.</p></div><div><p>This script will generate several output files, including .log.txt and .copynumber.csv, which contain quantitative information about the identified repeat elements.</p></div><div><p>Remember to adjust the parameters and options according to your specific needs and the characteristics of your genome.</p></div></div>]]></description>
	<dc:creator>Neel</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/36720/dupcar-reconstructing-contiguous-ancestral-regions-with-duplications</guid>
	<pubDate>Mon, 21 May 2018 11:09:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36720/dupcar-reconstructing-contiguous-ancestral-regions-with-duplications</link>
	<title><![CDATA[DUPCAR: Reconstructing Contiguous Ancestral Regions with Duplications]]></title>
	<description><![CDATA[we propose a heuristic algorithm, called DUPCAR, for reconstructing ancestral genomic orders with duplications. The method starts from the order of genes in modern genomes and predicts predecessor and successor relationships in the ancestor. Then a greedy algorithm is used to reconstruct the ancestral orders by connecting genes into contiguous regions based on predicted adjacencies. Computer simulation was used to validate the algorithm. We also applied the method to reconstruct the ancestral chromosome X of placental mammals and the ancestral genomes of the ciliate Paramecium tetraurelia.<p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3205822/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3205822/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43804/agora-algorithm-for-gene-order-reconstruction-in-ancestors</guid>
	<pubDate>Mon, 28 Feb 2022 23:26:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43804/agora-algorithm-for-gene-order-reconstruction-in-ancestors</link>
	<title><![CDATA[AGORA: Algorithm for Gene Order Reconstruction in Ancestors]]></title>
	<description><![CDATA[<p dir="auto">AGORA stands for &ldquo;Algorithm for Gene Order Reconstruction in Ancestors&rdquo; and was developed by Matthieu Muffato in the DYOGEN Laboratory at the &Eacute;cole normale sup&eacute;rieure in Paris in 2008.</p>
<div>
<pre><code>    // | |     //   ) )  //   ) ) //   ) )  // | |
   //__| |    //        //   / / //___/ /  //__| |
  / ___  |   //  ____  //   / / / ___ (   / ___  |
 //    | |  //    / / //   / / //   | |  //    | |
//     | | ((____/ / ((___/ / //    | | //     | |
</code></pre>
</div>
<p dir="auto">AGORA is used to generate ancestral genomes for the&nbsp;<a href="https://www.genomicus.biologie.ens.fr/genomicus">Genomicus</a>&nbsp;online server for gene order comparison, and has been in constant use in the group since.</p><p>Address of the bookmark: <a href="https://github.com/DyogenIBENS/Agora" rel="nofollow">https://github.com/DyogenIBENS/Agora</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>