<?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/43319?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/43319?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</guid>
	<pubDate>Sat, 09 Dec 2017 08:59:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34579/moss-a-system-for-detecting-software-similarity</link>
	<title><![CDATA[MOSS: A System for Detecting Software Similarity]]></title>
	<description><![CDATA[<p><span>Moss (for a Measure Of Software Similarity) is an automatic system for determining the similarity of programs. To date, the main application of Moss has been in detecting plagiarism in programming classes. Since its development in 1994, Moss has been very effective in this role. The algorithm behind moss is a significant improvement over other cheating detection algorithms (at least, over those known to us).</span></p>
<p><span><span>Moss can currently analyze code written in the following languages:</span></span></p>
<p>C, C++, Java, C#, Python, Visual Basic, Javascript, FORTRAN, ML, Haskell, Lisp, Scheme, Pascal, Modula2, Ada, Perl, TCL, Matlab, VHDL, Verilog, Spice, MIPS assembly, a8086 assembly, a8086 assembly, MIPS assembly, HCL2.</p><p>Address of the bookmark: <a href="https://theory.stanford.edu/~aiken/moss/" rel="nofollow">https://theory.stanford.edu/~aiken/moss/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</guid>
	<pubDate>Sun, 14 Apr 2019 20:35:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</link>
	<title><![CDATA[GMASS: a novel measure for genomeassembly structural similarity]]></title>
	<description><![CDATA[<div id="Abstract">
<div id="ASec3">
<p id="Par3">The GMASS score is a novel measure for representing structural similarity between two assemblies. It will contribute to the understanding of assembly output and developing de novo assemblers.</p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z</a></p>
</div>
</div><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php" rel="nofollow">http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28554/megan6</guid>
	<pubDate>Mon, 25 Jul 2016 05:45:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28554/megan6</link>
	<title><![CDATA[MEGAN6]]></title>
	<description><![CDATA[<p>Microbiome analysis using a single application</p>
<p>MEGAN6 is a comprehensive toolbox for interactively analyzing microbiome data. All the interactive tools you need in one application.</p>
<ul>
<li>Taxonomic analysis using the NCBI taxonomy or a customized taxonomy such as SILVA</li>
<li>Functional analysis using InterPro2GO, SEED, eggNOG or KEGG</li>
<li>Bar charts, word clouds, Voronoi tree maps and many other charts</li>
<li>PCoA, clustering and networks</li>
<li>Supports metadata</li>
<li>MEGAN parses many different types of input</li>
</ul>
<p>Why use MEGAN6?</p>
<div>&nbsp;The software is:</div>
<div><ol>
<li>Easy to use. MEGAN6 is a single application and all features are available through menus, toolbars and graphics. No scripting skills required.</li>
<li>Powerful. MEGAN6 allows you to work with hundreds of samples containing&nbsp;hundreds of millions of sequencing reads. Blast-like analysis can be performed using DIAMOND.</li>
<li>Comprehensive. MEGAN6 offers a large range of analysis tools, and is under active development.</li>
</ol></div><p>Address of the bookmark: <a href="https://ab.inf.uni-tuebingen.de/software/megan6" rel="nofollow">https://ab.inf.uni-tuebingen.de/software/megan6</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33791/slactree-svg-large-annotated-circular-tree-drawing</guid>
	<pubDate>Mon, 03 Jul 2017 08:02:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33791/slactree-svg-large-annotated-circular-tree-drawing</link>
	<title><![CDATA[slacTree: SVG Large Annotated Circular Tree drawing]]></title>
	<description><![CDATA[<p>A simple, extensible, Perl script for producing figures of large phylogenetic trees.</p>
<ul>
<li>While there are many other tree drawing programs, slacTree was originally written in 2009 to fill a need for producing publication quality figures of circular trees with more than 1000 taxa with custom annotations</li>
<li>Because it is a single Perl script with very few dependencies, it is easy to run, and easy to further customize</li>
<li>SVG is used because it is a scalable format allowing for very small representations of entire trees or highly magnified regions with unlimited resolution</li>
<li>Circular and radial trees are more compact than linear representations</li>
<li></li>
</ul>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/mccrowjp/slacTree" rel="nofollow">https://github.com/mccrowjp/slacTree</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</guid>
	<pubDate>Wed, 27 Nov 2019 05:32:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40298/environment-for-tree-exploration-ete-is-a-python-programming-toolkit-that-assists-in-the-recontruction-manipulation-analysis-and-visualization-of-phylogenetic-trees</link>
	<title><![CDATA[Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees]]></title>
	<description><![CDATA[<p><span>The Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees (although clustering trees or any other tree-like data structure are also supported).</span></p>
<p><span>Other tools</span></p>
<p><span><a href="https://github.com/shenwei356/taxonkit">https://github.com/shenwei356/taxonkit</a></span></p>
<p>&nbsp;</p>
<ul>
<li>ETE, version:&nbsp;<a href="https://pypi.org/project/ete3/3.1.1/">3.1.1</a></li>
<li>BioPython, version:&nbsp;<a href="https://pypi.org/project/biopython/1.73/">1.73</a></li>
<li>taxadb, version:&nbsp;<a href="https://pypi.org/project/taxadb/0.9.0">0.10.1</a></li>
<li>TaxonKit, version:&nbsp;<a href="https://github.com/shenwei356/taxonkit/releases/tag/0.10.1">0.5.0</a></li>
</ul><p>Address of the bookmark: <a href="https://pypi.org/project/ete3/3.1.1/" rel="nofollow">https://pypi.org/project/ete3/3.1.1/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45303/the-tree-that-learned-to-read-genomes</guid>
	<pubDate>Fri, 11 Sep 2026 00:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45303/the-tree-that-learned-to-read-genomes</link>
	<title><![CDATA[The Tree That Learned to Read Genomes]]></title>
	<description><![CDATA[<p>Imagine trying to reconstruct a family tree when many family photographs are missing, some names are unclear, and different relatives remember the past differently. This is similar to the challenge scientists face when trying to understand how organisms are related. Their family records are genomes, and the family tree is a phylogenetic tree. With modern sequencing technologies, scientists now have access to thousands of genomes, but comparing them can be difficult, especially when genomes are incomplete or poorly annotated.</p><p>A recent study by Webster and Chapman introduces Buscogeny (https://github.com/Jwebster89/Buscogeny), an open-source bioinformatics pipeline designed to make this process easier. The tool uses BUSCO (Benchmarking Universal Single-Copy Orthologs), which identifies conserved genes that are expected to occur as single copies in particular groups of organisms. These genes act like evolutionary landmarks, allowing researchers to compare genomes and investigate their relationships.</p><p>Buscogeny brings several steps of phylogenomic analysis into one workflow. It identifies BUSCO genes, extracts and aligns their sequences, removes unreliable regions, combines information from multiple genes, and uses the resulting data to construct a phylogenetic tree. It also provides quality-control information, helping researchers identify genomes that may be too incomplete for reliable analysis.</p><p>The authors demonstrate the usefulness of Buscogeny with bacterial and fungal genomes, including Alternaria. This is particularly valuable because fungal genomes can vary greatly in quality and annotation. Ultimately, Buscogeny helps transform massive amounts of genomic data into an understandable evolutionary story. Each DNA sequence becomes a clue, each conserved gene becomes a landmark, and together these clues reveal a picture of how life is connected.</p><p>More at&nbsp;https://link.springer.com/article/10.1007/s10123-025-00752-6?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40946/free-genomics-data</guid>
	<pubDate>Fri, 07 Feb 2020 14:08:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40946/free-genomics-data</link>
	<title><![CDATA[Free Genomics data !]]></title>
	<description><![CDATA[<p><span>The specimens were collected by the Oxford Wytham Woods and Edinburgh Lohse lab teams. DNA extraction and sequencing was carried out by the Sanger Institute Scientific Operations teams. Assemblies were carried out by the Tree of Life team (Shane McCarthy) and colleagues in Pacific Biosciences (Jonas Korlach).</span></p>
<p><a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p><p>Address of the bookmark: <a href="https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/" rel="nofollow">https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</guid>
	<pubDate>Mon, 27 Jun 2016 11:23:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</link>
	<title><![CDATA[Kaiju]]></title>
	<description><![CDATA[<p>Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.</p>
<p>By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database <em>nr</em> used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.</p>
<p>Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.</p>
<p>Kaiju is described in <a href="http://www.nature.com/ncomms/2016/160413/ncomms11257/full/ncomms11257.html">Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. <em>Nat. Commun.</em> 7:11257</a> (open access).</p><p>Address of the bookmark: <a href="http://kaiju.binf.ku.dk/" rel="nofollow">http://kaiju.binf.ku.dk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43650/rules-for-pango-lineage</guid>
	<pubDate>Tue, 14 Dec 2021 04:40:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43650/rules-for-pango-lineage</link>
	<title><![CDATA[Rules for Pango Lineage !]]></title>
	<description><![CDATA[<p>All the rules to classify a Lineage !</p>
<p>https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/</p><p>Address of the bookmark: <a href="https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/" rel="nofollow">https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</guid>
	<pubDate>Thu, 09 Aug 2018 04:09:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</link>
	<title><![CDATA[PureCN: copy number calling and SNV classification using targeted short read sequencing]]></title>
	<description><![CDATA[<p>This package estimates tumor purity, copy number, and loss of heterozygosity (LOH), and classifies single nucleotide variants (SNVs) by somatic status and clonality. PureCN is designed for targeted short read sequencing data, integrates well with standard somatic variant detection and copy number pipelines, and has support for tumor samples without matching normal samples.</p>
<p>Author: Markus Riester [aut, cre], Angad P. Singh [aut]</p>
<p>Maintainer: Markus Riester &lt;markus.riester at novartis.com&gt;</p>
<div id="bioc_citation_outer">
<p>Citation (from within R, enter&nbsp;<code>citation("PureCN")</code>):</p>
<div id="bioc_citation">
<p>Riester M, Singh A, Brannon A, Yu K, Campbell C, Chiang D, Morrissey M (2016). &ldquo;PureCN: Copy number calling and SNV classification using targeted short read sequencing.&rdquo;&nbsp;<em>Source Code for Biology and Medicine</em>,&nbsp;<strong>11</strong>, 13. doi:&nbsp;<a href="http://doi.org/10.1186/s13029-016-0060-z">10.1186/s13029-016-0060-z</a>.</p>
</div>
</div><p>Address of the bookmark: <a href="http://bioconductor.org/packages/release/bioc/html/PureCN.html" rel="nofollow">http://bioconductor.org/packages/release/bioc/html/PureCN.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>