<?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/36905?offset=260</link>
	<atom:link href="https://bioinformaticsonline.com/related/36905?offset=260" 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/42204/g-nest-the-gene-neighborhood-scoring-tool</guid>
	<pubDate>Fri, 25 Sep 2020 20:09:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42204/g-nest-the-gene-neighborhood-scoring-tool</link>
	<title><![CDATA[G-NEST: The Gene NEighborhood Scoring Tool]]></title>
	<description><![CDATA[<p><span>The Gene NEighborhood Scoring Tool (G-NEST) combines genomic location, gene expression, and evolutionary sequence conservation data to score putative gene neighborhoods across all window sizes. Primary author of final code = William F. Martin. Example data files are in the separate repository.</span></p><p>Address of the bookmark: <a href="https://github.com/dglemay/G-NEST" rel="nofollow">https://github.com/dglemay/G-NEST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44637/tools-to-access-the-quality-of-your-assembled-genome</guid>
	<pubDate>Thu, 08 Aug 2024 23:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44637/tools-to-access-the-quality-of-your-assembled-genome</link>
	<title><![CDATA[Tools to access the quality of your assembled genome !]]></title>
	<description><![CDATA[<ul dir="auto">
<li><a href="https://github.com/linsalrob/fasta_validator">FASTA VALIDATOR</a>&nbsp;+&nbsp;<a href="https://github.com/shenwei356/seqkit">SEQKIT RMDUP</a>: FASTA validation</li>
<li><a href="https://genometools.org/tools/gt_gff3validator.html">GENOMETOOLS GT GFF3VALIDATOR</a>: GFF3 validation</li>
<li><a href="https://github.com/PlantandFoodResearch/assemblathon2-analysis/blob/a93cba25d847434f7eadc04e63b58c567c46a56d/assemblathon_stats.pl">ASSEMBLATHON STATS</a>: Assembly statistics</li>
<li><a href="https://genometools.org/tools/gt_stat.html">GENOMETOOLS GT STAT</a>: Annotation statistics</li>
<li><a href="https://github.com/ncbi/fcs">NCBI FCS ADAPTOR</a>: Adaptor contamination pass/fail</li>
<li><a href="https://github.com/ncbi/fcs">NCBI FCS GX</a>: Foreign organism contamination pass/fail</li>
<li><a href="https://gitlab.com/ezlab/busco">BUSCO</a>: Gene-space completeness estimation</li>
<li><a href="https://github.com/tolkit/telomeric-identifier">TIDK</a>: Telomere repeat identification</li>
<li><a href="https://github.com/oushujun/LTR_retriever/blob/master/LAI">LAI</a>: Continuity of repetitive sequences</li>
<li><a href="https://github.com/DerrickWood/kraken2">KRAKEN2</a>: Taxonomy classification</li>
<li><a href="https://github.com/igvteam/juicebox.js">HIC CONTACT MAP</a>: Alignment and visualisation of HiC data</li>
<li><a href="https://github.com/mummer4/mummer">MUMMER</a>&nbsp;&rarr;&nbsp;<a href="http://circos.ca/documentation/">CIRCOS</a>&nbsp;+&nbsp;<a href="https://plotly.com/">DOTPLOT</a>&nbsp;&amp;&nbsp;<a href="https://github.com/lh3/minimap2">MINIMAP2</a>&nbsp;&rarr;&nbsp;<a href="https://github.com/schneebergerlab/plotsr">PLOTSR</a>: Synteny analysis</li>
<li><a href="https://github.com/marbl/merqury">MERQURY</a>: K-mer completeness, consensus quality and phasing assessment</li>
</ul>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45299/the-gene-detectives-how-a-new-computational-tool-is-helping-us-read-the-history-written-in-our-genes</guid>
	<pubDate>Thu, 10 Sep 2026 21:23:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45299/the-gene-detectives-how-a-new-computational-tool-is-helping-us-read-the-history-written-in-our-genes</link>
	<title><![CDATA[The Gene Detectives: How a New Computational Tool Is Helping Us Read the History Written in Our Genes]]></title>
	<description><![CDATA[<p>Imagine opening an ancient family album with no names, dates, or captions. Some photographs are missing, others have been copied, and a few show people who look almost identical. Your challenge is to discover who is related to whom and reconstruct the family story. In evolutionary biology, scientists face a similar mystery when they study genes. Every genome contains clues about its past, but genes can be duplicated, lost, and changed over millions of years, making their history difficult to trace.</p><p>A recent study published in PLOS Computational Biology introduces REvolutionH-tl 2.0 (https://pypi.org/project/revolutionhtl/), a computational tool designed to help solve this mystery. The software analyzes protein sequences and identifies evolutionary relationships between genes. It can help researchers detect important events such as gene duplication, gene loss, and speciation, allowing them to reconstruct how genes evolved across different organisms.</p><p>What makes the tool especially interesting is its focus on both speed and interpretation. The researchers compared REvolutionH-tl 2.0 with several existing computational tools and reported that it achieved competitive accuracy while requiring less computational time in their tests. The tool also includes visualization features, helping researchers turn complicated genetic data into evolutionary stories that are easier to explore.</p><p>Genes are more than simple sequences of DNA; they are records of life&rsquo;s long history. Each surviving gene carries traces of the changes that shaped it. By bringing together computational analysis and visualization, REvolutionH-tl 2.0 acts like a detective, helping scientists uncover these hidden stories. Ultimately, tools like this can improve our understanding of how genomes evolved and how genes acquired the roles they perform today.</p><p>More at&nbsp;https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013017</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35420/telomerehunter</guid>
	<pubDate>Fri, 02 Feb 2018 04:23:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35420/telomerehunter</link>
	<title><![CDATA[TelomereHunter]]></title>
	<description><![CDATA[<p><span>TelomereHunter is a tool for estimating telomere content from human whole-genome sequencing data. It is designed to take BAM files from a tumor and a matching control sample as input. However, it is also possible to run TelomereHunter with one input file. TelomereHunter extracts and sorts telomeric reads from the input sample(s). For the estimation of telomere content, GC biases are taken into account. Finally, the results of TelomereHunter are visualized in several diagrams.</span><br><br><span>TelomereHunter is available for download at the following address:&nbsp;</span><a href="https://pypi.python.org/pypi/telomerehunter/" target="_blank">https://pypi.python.org/pypi/telomerehunter/</a></p><p>Address of the bookmark: <a href="http://www.dkfz.de/en/applied-bioinformatics/telomerehunter/telomerehunter.html" rel="nofollow">http://www.dkfz.de/en/applied-bioinformatics/telomerehunter/telomerehunter.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34141/rami-a-tool-for-identification-and-characterization-of-phylogenetic-clusters-in-microbial-communities</guid>
	<pubDate>Mon, 07 Aug 2017 18:49:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34141/rami-a-tool-for-identification-and-characterization-of-phylogenetic-clusters-in-microbial-communities</link>
	<title><![CDATA[RAMI: a tool for identification and characterization of phylogenetic clusters in microbial communities]]></title>
	<description><![CDATA[<p>RAMI, which clusters related nodes in a phylogenetic tree based on the patristic distance. RAMI also produces indices of cluster properties and other indices used in population and community studies on-the-fly.</p>
<p><strong>Availability:</strong>&nbsp;RAMI is licensed under GNU GPL and can be run or downloaded from&nbsp;<a href="http://www.acgt.se/online.html" target="">http://www.acgt.se/online.html</a>.</p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article-lookup/doi/10.1093/bioinformatics/btp051" rel="nofollow">https://academic.oup.com/bioinformatics/article-lookup/doi/10.1093/bioinformatics/btp051</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/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>