<?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/36907?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/36907?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</guid>
	<pubDate>Thu, 18 May 2017 05:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32855/maf2synteny</link>
	<title><![CDATA[maf2synteny]]></title>
	<description><![CDATA[<p>A tool for converting for recovering synteny blocks from multiple alignment (in MAF fromat)</p>
<p>This tool is a standalone version of Ragout module [<a href="http://fenderglass.github./Ragout">http://fenderglass.github./Ragout</a>]</p><p>Address of the bookmark: <a href="https://github.com/fenderglass/maf2synteny" rel="nofollow">https://github.com/fenderglass/maf2synteny</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39380/mgert-mobile-genetic-elements-retrieving-tool</guid>
	<pubDate>Sat, 18 May 2019 08:58:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39380/mgert-mobile-genetic-elements-retrieving-tool</link>
	<title><![CDATA[MGERT: Mobile Genetic Elements Retrieving Tool]]></title>
	<description><![CDATA[<p><em>MGERT</em><span>&nbsp;is a computational pipeline for easy retrieving of MGE's coding sequences of a particular family from genome assemblies.&nbsp;</span><em>MGERT</em><span>&nbsp;utilizes several established bioinformatic tools combined into single pipeline which hides different technical quirks from an inexperienced user.</span></p><p>Address of the bookmark: <a href="https://github.com/andrewgull/MGERT" rel="nofollow">https://github.com/andrewgull/MGERT</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44487/r-package-for-pca-analysis</guid>
	<pubDate>Sun, 24 Mar 2024 20:06:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44487/r-package-for-pca-analysis</link>
	<title><![CDATA[R Package for PCA Analysis]]></title>
	<description><![CDATA[<p><span>An R package for performing principal component analysis (PCA) of genomics data. The package performs PCA, generates the publication-ready plots, and identifies population-specific outlier individuals. The package can be accessed on GitHub:&nbsp;https://github.com/Devashish13/PopulationStructure</span></p><p>Address of the bookmark: <a href="https://rpubs.com/Devashish13/PCAGenomics" rel="nofollow">https://rpubs.com/Devashish13/PCAGenomics</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45249/from-dna-chaos-to-a-clear-microbial-story</guid>
	<pubDate>Fri, 21 Aug 2026 11:22:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45249/from-dna-chaos-to-a-clear-microbial-story</link>
	<title><![CDATA[From DNA Chaos to a Clear Microbial Story]]></title>
	<description><![CDATA[<p>Imagine opening a metagenomic dataset and finding millions of DNA fragments, each carrying a tiny piece of information about the microbial world inside a sample. The challenge is not generating the data &mdash; it is turning that data into a meaningful story.</p><p>This is where MeTAline comes in.</p><p>MeTAline is a reproducible workflow designed to simplify shotgun metagenomic analysis. It brings together important steps such as quality control, host-DNA removal, taxonomic profiling and functional analysis, using tools including Kraken2, MetaPhlAn4 and HUMAnN.</p><p>What makes it especially useful is its ability to handle large datasets while keeping analyses organized and reproducible. Built with Snakemake and supporting containerized environments, MeTAline can also be used on high-performance computing systems.</p><p>In simple terms, MeTAline helps researchers move from millions of confusing DNA fragments to a clearer picture of who is there, what they might be doing, and what the data could mean.</p><p>Sometimes, the biggest challenge in science isn't collecting more data &mdash; it's finding the story hidden inside it.</p><p>Read more at&nbsp;https://academic.oup.com/nargab/article/7/4/lqaf158/8340158?login=false</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</guid>
	<pubDate>Tue, 16 Mar 2021 05:41:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42963/davi-deep-learning-based-tool-for-alignment-and-single-nucleotide-variant-identification</link>
	<title><![CDATA[DAVI: Deep learning-based tool for alignment and single nucleotide variant identification]]></title>
	<description><![CDATA[<p>DAVI consists of models for both global and local alignment and for variant calling. We have evaluated the performance of DAVI against existing state-of-the-art tool sets and found that its accuracy and performance is comparable to existing tools used for bench-marking. We further demonstrate that while existing tools are based on data generated from a specific sequencing technology, the models proposed in DAVI are generic and can be used across different NGS technologies as well as across different species</p>
<p>https://iopscience.iop.org/article/10.1088/2632-2153/ab7e19/pdf</p><p>Address of the bookmark: <a href="https://github.com/gguptaiitd/NEAT" rel="nofollow">https://github.com/gguptaiitd/NEAT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</guid>
	<pubDate>Sat, 18 Nov 2017 16:55:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</link>
	<title><![CDATA[CHSMiner: a GUI tool to identify chromosomal homologous segments]]></title>
	<description><![CDATA[<div id="ASec1">
<h3>Background</h3>
<p>The identification of chromosomal homologous segments (CHS) within and between genomes is essential for comparative genomics. Various processes including insertion/deletion and inversion could cause the degeneration of CHSs.</p>
</div>
<div id="ASec2">
<h3>Results</h3>
<p>Here we present a Java software CHSMiner that detects CHSs based on shared gene content alone. It implements fast greedy search algorithm and rigorous statistical validation, and its friendly graphical interface allows interactive visualization of the results. We tested the software on both simulated and biological realistic data and compared its performance with similar existing software and data source.</p>
</div>
<div id="ASec3">
<h3>Conclusion</h3>
<p>CHSMiner is characterized by its integrated workflow, fast speed and convenient usage. It will be useful for both experimentalists and bioinformaticians interested in the structure and evolution of genomes.</p>
<p>&nbsp;</p>
<p>https://github.com/zhenwang100/CHSMiner</p>
</div><p>Address of the bookmark: <a href="https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2" rel="nofollow">https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</guid>
	<pubDate>Thu, 28 Dec 2017 09:10:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</link>
	<title><![CDATA[CAMSA :: a tool for Comparative Analysis and Merging of Scaffold Assemblies]]></title>
	<description><![CDATA[<p>CAMSA &ndash; is a tool for&nbsp;<span>C</span>omparative&nbsp;<span>A</span>nalysis and&nbsp;<span>M</span>erging of&nbsp;<span>S</span>caffold&nbsp;<span>A</span>ssemblies, distributed both as a standalone software package and as Python library under the MIT license.</p>
<p>Main features:</p>
<ol>
<li>works with any number of scaffold assemblies in de-novo non-progressive fashion</li>
<li>allows to simultaneously work with scaffold assemblies obtained from any&nbsp;<em>in silico</em>&nbsp;and&nbsp;<em>in vitro</em>&nbsp;techniques, supporting multiple existing formats via built-in converters</li>
<li>creates an extensive report with several comparative quality metrics (both on assembly level and on the level of individual assembly points)</li>
<li>constructs a merged combined scaffold assembly</li>
<li>provides an interactive framework for a visual comparative analysis of the given assemblies</li>
</ol><p>Address of the bookmark: <a href="https://cblab.org/camsa/" rel="nofollow">https://cblab.org/camsa/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>