<?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/37576?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/37576?offset=250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</guid>
	<pubDate>Sat, 21 May 2016 22:42:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27463/bpipe-a-tool-for-running-and-managing-bioinformatics-pipelines</link>
	<title><![CDATA[Bpipe - a tool for running and managing bioinformatics pipelines]]></title>
	<description><![CDATA[<p>Bpipe provides a platform for running big bioinformatics jobs that consist of a series of processing stages - known as 'pipelines'.</p>
<ul>
<li>January 20th, 2016 - New! Bpipe 0.9.9 released!</li>
<li>Download <a href="http://download.bpipe.org/versions/bpipe-0.9.9.tar.gz">latest</a>, <a href="http://download.bpipe.org">all</a></li>
<li><a href="http://docs.bpipe.org">Documentation</a></li>
<li><a href="https://groups.google.com/forum/#%21forum/bpipe-discuss">Mailing List</a> (Google Group)</li>
</ul>
<p>Bpipe has been published in <a href="http://bioinformatics.oxfordjournals.org/content/early/2012/04/11/bioinformatics.bts167.abstract">Bioinformatics</a>! If you use Bpipe, please cite:</p>
<p><em>Sadedin S, Pope B &amp; Oshlack A, Bpipe: A Tool for Running and Managing Bioinformatics Pipelines, Bioinformatics</em></p><p>Address of the bookmark: <a href="http://docs.bpipe.org/" rel="nofollow">http://docs.bpipe.org/</a></p>]]></description>
	<dc:creator>Radha Agarkar</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/35252/hgt-finder-a-new-tool-for-horizontal-gene-transfer-finding-and-application-to-aspergillus-genomes</guid>
	<pubDate>Wed, 17 Jan 2018 05:03:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35252/hgt-finder-a-new-tool-for-horizontal-gene-transfer-finding-and-application-to-aspergillus-genomes</link>
	<title><![CDATA[HGT-Finder: A New Tool for Horizontal Gene Transfer Finding and Application to Aspergillus genomes]]></title>
	<description><![CDATA[<p><span>HGT-Finder: </span></p>
<p><span>(i) can be used for HGT detection in both prokaryotes and eukaryotes, </span></p>
<p><span>(ii) can report a statistical&nbsp;</span><em>P</em><span>&nbsp;value for each gene to indicate how likely it is to be horizontally transferred, and </span></p>
<p><span>(iii) is fully automated (requires minimal human intervention), as well as very easy to install and run.&nbsp;</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4626719/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4626719/</a></p>]]></description>
	<dc:creator>Jit</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/44571/panacus-a-counting-tool-for-pangenome-graphs</guid>
	<pubDate>Fri, 14 Jun 2024 14:42:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44571/panacus-a-counting-tool-for-pangenome-graphs</link>
	<title><![CDATA[Panacus : A Counting Tool for Pangenome Graphs]]></title>
	<description><![CDATA[<p dir="auto"><code>panacus</code>&nbsp;is a tool for calculating statistics for&nbsp;<a href="https://github.com/GFA-spec/GFA-spec/blob/master/GFA1.md">GFA</a>&nbsp;files. It supports GFA files with&nbsp;<code>P</code>&nbsp;and&nbsp;<code>W</code>&nbsp;lines, but requires that the graph is&nbsp;<code>blunt</code>, i.e., nodes do not overlap and consequently, each link (<code>L</code>) points from the end of one segment (<code>S</code>) to the start of another.</p>
<p dir="auto"><code>panacus</code>&nbsp;supports the following calculations:</p>
<ul dir="auto">
<li>coverage histogram</li>
<li>pangenome growth statistics</li>
<li>path-/group-resolved coverage table</li>
</ul><p>Address of the bookmark: <a href="https://github.com/marschall-lab/panacus" rel="nofollow">https://github.com/marschall-lab/panacus</a></p>]]></description>
	<dc:creator>Neel</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/blog/view/45372/uncovering-evolution%E2%80%99s-blueprint-how-ntsynt-is-changing-comparative-genomics</guid>
	<pubDate>Mon, 19 Oct 2026 03:08:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45372/uncovering-evolution%E2%80%99s-blueprint-how-ntsynt-is-changing-comparative-genomics</link>
	<title><![CDATA[Uncovering Evolution’s Blueprint: How ntSynt Is Changing Comparative Genomics]]></title>
	<description><![CDATA[<p>Over millions of years, evolution has shaped all life on Earth, leaving clues in the DNA of every organism. While different species look and act very differently, their genomes still hold signs of a shared evolutionary past. These connections show up not just in similar DNA sequences, but also in how genetic material is arranged on chromosomes. To study these patterns, scientists use a concept called synteny, which helps them track changes in genomes, chromosome rearrangements, and relationships between species. However, as genome sequencing technology has advanced and thousands of high-quality genomes are now available, finding conserved regions across many genomes has become a much tougher computational challenge.</p><p>To tackle this problem, researchers developed a new bioinformatics tool called ntSynt. It was first introduced in a 2025 study in BMC Biology titled &ldquo;ntSynt: multi-genome synteny detection using minimizer graph mappings&rdquo;. This tool (https://github.com/BirolLab/ntSynt) helps researcher find conserved genomic regions across several species without relying on traditional whole-genome alignments or gene annotations. Instead, ntSynt uses short DNA sequences called minimizers as landmarks. It finds minimizers shared by different genomes and maps their relationships in a graph, making it possible to spot large genomic regions that have kept a similar structure over time. The tool uses Bloom filters and graph-based mapping, which lets scientists analyze many genomes at once while saving memory and processing time.</p><p>The team tested ntSynt using both simulated data and real genomic sequences from groups like humans, chimpanzees, bonobos, gorillas, rodents, and bees. Their results showed that ntSynt can find conserved genomic regions and spot structural differences between species. In simulated tests, ntSynt identified syntenic blocks with over 97% accuracy. One standout example involved eleven bee genomes from the genus Andrena, which have a lot of variation in chromosome organization. Despite these differences, ntSynt found conserved regions covering about 85% of the smallest bee genome, completing the analysis in just 14.7 minutes and using less than 4 GB of memory. These findings highlight ntSynt&rsquo;s potential for large-scale comparative genomics, where efficiency is crucial as more genomes become available.</p><p>An interesting result came up when the researchers compared primate genomes. When they looked at regions conserved between humans and other great apes, ntSynt flagged what looked like a large deletion in one gorilla genome assembly. After checking with long-read sequencing data, they found that the missing section was likely a mistake in the assembly, not a real evolutionary change. This means ntSynt can help not only with studying evolutionary relationships but also with spotting possible errors in genome assemblies. By highlighting unexpected breaks in regions that are usually conserved, the tool helps scientists tell apart true evolutionary changes from technical mistakes in reference sequences.</p><p>The importance of ntSynt becomes even clearer when we look at global projects to sequence and study Earth&rsquo;s biodiversity. Projects like the Earth BioGenome Project aim to create genomic resources for many different organisms, opening up new ways to explore the history of life. But generating genomic data is just the beginning; making sense of these relationships requires powerful and scalable tools. ntSynt helps by letting researchers study chromosome evolution, conserved genome structures, and rearrangements across many species. While the tool has some limits, especially with detecting duplicated regions or analyzing very different genomes, its speed and scalability make it a valuable tool for modern comparative genomics.</p><p>The creation of ntSynt marks a significant advancement in our understanding of how genomes have evolved and become diverse over Earth's history. Since each conserved region in the genome is evidence of common ancestry and each rearrangement gives hinThe development of ntSynt is a big step forward in understanding how genomes have changed and diversified over time. Each conserved region in a genome points to shared ancestry, and each rearrangement offers clues about evolutionary events in different lineages. ntSynt helps scientists spot these patterns more easily, opening up new ways to study genome evolution across the tree of life. Evolution&rsquo;s story isn&rsquo;t just in the DNA sequence, but also in how those sequences are arranged and preserved over millions of years. Tools like ntSynt are helping scientists read this hidden story more clearly and reveal the deep genomic connections that link all life on Earth.</p><p>More at&nbsp;https://link.springer.com/article/10.1186/s12915-025-02455-w?</p>]]></description>
	<dc:creator>Jitendra Narayan</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>

</channel>
</rss>