<?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/38445?</link>
	<atom:link href="https://bioinformaticsonline.com/related/38445?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37302/fastani-fast-alignment-free-computation-of-whole-genome-average-nucleotide-identity-ani</guid>
	<pubDate>Fri, 13 Jul 2018 17:27:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37302/fastani-fast-alignment-free-computation-of-whole-genome-average-nucleotide-identity-ani</link>
	<title><![CDATA[FastANI:  fast alignment-free computation of whole-genome Average Nucleotide Identity (ANI)]]></title>
	<description><![CDATA[<p><span>FastANI is developed for fast alignment-free computation of whole-genome Average Nucleotide Identity (ANI). ANI is defined as mean nucleotide identity of orthologous gene pairs shared between two microbial genomes. FastANI supports pairwise comparison of both complete and draft genome assemblies. Its underlying procedure follows a similar workflow as described by&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/17220447">Goris et al. 2007</a><span>. However, it avoids expensive sequence alignments and uses&nbsp;</span><a href="https://github.com/marbl/MashMap">Mashmap</a><span>&nbsp;as its MinHash based sequence mapping engine to compute the orthologous mappings and alignment identity estimates. Based on our experiments with complete and draft genomes, its accuracy is on par with&nbsp;</span><a href="http://enve-omics.ce.gatech.edu/ani/">BLAST-based ANI solver</a><span>&nbsp;and it achieves two to three orders of magnitude speedup. Therefore, it is useful for pairwise ANI computation of large number of genome pairs. More details about its speed, accuracy and potential applications are described here: "</span><a href="https://doi.org/10.1101/225342">High-throughput ANI Analysis of 90K Prokaryotic Genomes Reveals Clear Species Boundaries</a><span>".</span></p><p>Address of the bookmark: <a href="https://github.com/ParBLiSS/FastANI" rel="nofollow">https://github.com/ParBLiSS/FastANI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42974/list-of-bioinformatics-packages-for-ngs-analysis</guid>
	<pubDate>Sat, 20 Mar 2021 00:28:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42974/list-of-bioinformatics-packages-for-ngs-analysis</link>
	<title><![CDATA[List of bioinformatics packages for NGS analysis !]]></title>
	<description><![CDATA[<p>Package suites gather software packages and installation tools for specific languages or platforms. We have some for bioinformatics software.</p><ul>
<li><a href="https://github.com/Bioconductor">Bioconductor</a>&nbsp;&ndash; A plethora of tools for analysis and comprehension of high-throughput genomic data, including 1500+ software packages. [&nbsp;<a href="https://link.springer.com/article/10.1186/gb-2004-5-10-r80">paper-2004</a>&nbsp;|&nbsp;<a href="https://www.bioconductor.org/">web</a>&nbsp;]</li>
<li><a href="https://github.com/biopython/biopython">Biopython</a>&nbsp;&ndash; Freely available tools for biological computing in Python, with included cookbook, packaging and thorough documentation. Part of the&nbsp;<a href="http://open-bio.org/">Open Bioinformatics Foundation</a>. Contains the very useful&nbsp;<a href="https://biopython.org/DIST/docs/api/Bio.Entrez-module.html">Entrez</a>&nbsp;package for API access to the NCBI databases. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/19304878">paper-2009</a>&nbsp;|&nbsp;<a href="https://biopython.org/">web</a>&nbsp;]</li>
<li><a href="https://github.com/bioconda">Bioconda</a>&nbsp;&ndash; A channel for the&nbsp;<a href="http://conda.pydata.org/docs/intro.html">conda package manager</a>&nbsp;specializing in bioinformatics software. Includes a repository with 3000+ ready-to-install (with&nbsp;<code>conda install</code>) bioinformatics packages. [&nbsp;<a href="https://pubmed.ncbi.nlm.nih.gov/29967506">paper-2018</a>&nbsp;|&nbsp;<a href="https://bioconda.github.io/">web</a>&nbsp;]</li>
<li><a href="https://github.com/BioJulia">BioJulia</a>&nbsp;&ndash; Bioinformatics and computational biology infastructure for the Julia programming language. [&nbsp;<a href="https://biojulia.net/">web</a>&nbsp;]</li>
<li><a href="https://github.com/rust-bio/rust-bio">Rust-Bio</a>&nbsp;&ndash; Rust implementations of algorithms and data structures useful for bioinformatics. [&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/early/2015/10/06/bioinformatics.btv573.short?rss=1">paper-2016</a>&nbsp;]</li>
<li><a href="https://github.com/seqan/seqan3">SeqAn</a>&nbsp;&ndash; The modern C++ library for sequence analysis.</li>
</ul>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6130/rna-bioinformatics-and-high-throughput-analysis-jena</guid>
  <pubDate>Sat, 09 Nov 2013 20:03:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[RNA Bioinformatics and High Throughput Analysis Jena]]></title>
  <description><![CDATA[
<p>Research Topics:</p>

<p>High Throughput Sequencing Analysis<br />Comparative Genomics<br />Identification and Annotation of Non-coding RNAs<br />Bioinformatic Analysis and System Biology of Viruses<br />Coevolution of Proteins and RNAs<br />Algorithmic Bioinformatics<br />Phylogenetic Analysis</p>

<p>http://www.rna.uni-jena.de/index.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</guid>
	<pubDate>Fri, 06 Jul 2018 04:27:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</link>
	<title><![CDATA[ReMILO: reference assisted misassembly detection algorithm using short and long reads.]]></title>
	<description><![CDATA[ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.<p>Address of the bookmark: <a href="https://github.com/songc001/remilo" rel="nofollow">https://github.com/songc001/remilo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41881/hdock-server</guid>
	<pubDate>Tue, 16 Jun 2020 01:54:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41881/hdock-server</link>
	<title><![CDATA[HDOCK SERVER]]></title>
	<description><![CDATA[<p>HDOCK SERVER</p>
<p>Protein-protein and protein-DNA/RNA docking based on a hybrid algorithm of template-based modeling and&nbsp;<em>ab initio</em>&nbsp;free docking.</p>
<p><span>The HDOCK server distinguishes itself from similar docking servers in its ability to support amino acid sequences as input and a hybrid docking strategy in which experimental information about the protein&ndash;protein binding site and small-angle X-ray scattering can be incorporated during the docking and post-docking processes.</span></p><p>Address of the bookmark: <a href="http://hdock.phys.hust.edu.cn/" rel="nofollow">http://hdock.phys.hust.edu.cn/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</guid>
	<pubDate>Tue, 23 May 2017 05:20:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</link>
	<title><![CDATA[GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.]]></title>
	<description><![CDATA[<p><span>GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexeyG/GRASS" rel="nofollow">https://github.com/AlexeyG/GRASS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/42296/igblast-117-is-now-available-with-improved-identification-of-productive-v-gene-sequences</guid>
	<pubDate>Sun, 01 Nov 2020 16:52:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42296/igblast-117-is-now-available-with-improved-identification-of-productive-v-gene-sequences</link>
	<title><![CDATA[IgBLAST 1.17 is now available with improved identification of productive V gene sequences]]></title>
	<description><![CDATA[<p>A new release of&nbsp;<a href="https://go.usa.gov/x7WMc" target="_blank">IgBLAST</a>&nbsp;(1.17), the popular package for classifying and analyzing immunoglobulin and T cell receptor sequences, is now available on the&nbsp;<a href="https://go.usa.gov/x7WMc" target="_blank">web</a>&nbsp;and from the&nbsp;<a href="https://ftp.ncbi.nih.gov/blast/executables/igblast/release/LATEST" target="_blank">FTP site</a>. The updated package is better at identifying productive V gene sequences. We added a new field , &ldquo;V frame shift&rdquo;, to the IgBLAST output to indicate whether the V gene translation frame contains a frame-shift. We have also updated the definition of a productive V(D)J sequence to now exclude those with internal frame shifts.</p><p>See the&nbsp;<a href="https://ncbi.github.io/igblast/" target="_blank">new IgBLAST manual</a>&nbsp;on the NCBI GitHub site for more information on setting up and running IgBLAST.</p><p>If you have any questions or concerns, please email us at&nbsp;<a href="mailto:blast-help@ncbi.nlm.nih.gov" target="_blank">blast-help@ncbi.nlm.nih.gov</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37915/dna-nucleotide-counter</guid>
	<pubDate>Fri, 12 Oct 2018 04:37:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37915/dna-nucleotide-counter</link>
	<title><![CDATA[DNA Nucleotide Counter]]></title>
	<description><![CDATA[<p style="margin: 2px 5px 4px 6px; color: #000011; font-size: 12px; font-style: normal; font-weight: 400; text-align: justify;">DNA Nucleotide Counter is delivered in a DNA Baser package together with other free molecular biology tools.<span>&nbsp;</span><a href="http://www.dnabaser.com/download/biology-tools-package-download-count.html">Download</a><span>&nbsp;</span>the package and double click it. The programs inside the package will be extracted to the destination folder (specified by you). Go to the destination folder&nbsp;and double click the program you want to use.</p>
<p style="margin: 2px 5px 4px 6px; color: #000011; font-size: 12px; font-style: normal; font-weight: 400; text-align: justify;">It<span>&nbsp;</span><a href="http://www.dnabaser.com/download/install-anywhere.html">installs in any computer</a><span>&nbsp;</span>even if you don't have administrator rights!</p><p>Address of the bookmark: <a href="http://www.dnabaser.com/download/DNA-Counter/index.html" rel="nofollow">http://www.dnabaser.com/download/DNA-Counter/index.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38067/metaplotr-a-perlr-pipeline-for-plotting-metagenes-of-nucleotide-modifications-and-other-transcriptomic-sites</guid>
	<pubDate>Mon, 05 Nov 2018 08:12:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38067/metaplotr-a-perlr-pipeline-for-plotting-metagenes-of-nucleotide-modifications-and-other-transcriptomic-sites</link>
	<title><![CDATA[MetaPlotR: a Perl/R pipeline for plotting metagenes of nucleotide modifications and other transcriptomic sites]]></title>
	<description><![CDATA[<p><span>An increasing number of studies are mapping protein binding and nucleotide modifications sites throughout the transcriptome. Often, these sites cluster in certain regions of the transcript, giving clues to their function. Hence, it is informative to summarize where in the transcript these sites occur. A metagene is a simple and effective tool for visualizing the distribution of sites along a simplified transcript model. In this work, we introduce MetaPlotR, a Perl/R pipeline for creating metagene plots.</span></p><p>Address of the bookmark: <a href="https://github.com/olarerin/metaPlotR" rel="nofollow">https://github.com/olarerin/metaPlotR</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>