<?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/33901?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/33901?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</guid>
	<pubDate>Sat, 02 Jun 2018 07:38:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</link>
	<title><![CDATA[GLEAN: an unsupervised learning system to integrate disparate sources of gene structure evidence]]></title>
	<description><![CDATA[<p><span>GLEAN is an unsupervised learning system to integrate disparate sources of gene structure evidence (gene model predictions, EST/protein genomic sequence alignments, SAGE/peptide tags, etc) to produce a consensus gene prediction, without prior training.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/glean-gene/" rel="nofollow">https://sourceforge.net/projects/glean-gene/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</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/41033/clark-fast-accurate-and-versatile-sequence-classification-system</guid>
	<pubDate>Sat, 15 Feb 2020 01:49:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41033/clark-fast-accurate-and-versatile-sequence-classification-system</link>
	<title><![CDATA[CLARK: Fast, accurate and versatile sequence classification system]]></title>
	<description><![CDATA[<p><span></span><a href="http://dx.doi.org/10.1186/s12864-015-1419-2"><strong>CLARK</strong></a><span>, a method based on a supervised sequence classification using discriminative&nbsp;</span><em>k</em><span>-mers. Considering two distinct specific classification problems (see the article for details), namely (1) the taxonomic classification of metagenomic reads to known bacterial genomes, and (2) the assignment of BAC clones and transcript to chromosome arms/centromeres (in the absence of a finished assembly for the reference genome), CLARK outperforms in classification speed and precision the best state-of-the-art methods.</span></p>
<p><span><a href="http://clark.cs.ucr.edu/Spaced/">http://clark.cs.ucr.edu/Spaced/</a></span></p><p>Address of the bookmark: <a href="http://clark.cs.ucr.edu/Spaced/" rel="nofollow">http://clark.cs.ucr.edu/Spaced/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43826/tiara-deep-learning-based-classification-system-for-eukaryotic-sequences</guid>
	<pubDate>Mon, 14 Mar 2022 23:02:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43826/tiara-deep-learning-based-classification-system-for-eukaryotic-sequences</link>
	<title><![CDATA[Tiara: deep learning-based classification system for eukaryotic sequences]]></title>
	<description><![CDATA[<p><span>With a large number of metagenomic datasets becoming available, eukaryotic metagenomics emerged as a new challenge. The proper classification of eukaryotic nuclear and organellar genomes is an essential step toward a better understanding of eukaryotic diversity.</span></p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/38/2/344/6375939" rel="nofollow">https://academic.oup.com/bioinformatics/article/38/2/344/6375939</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</guid>
	<pubDate>Sat, 03 Jun 2023 20:15:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44329/metabuli-%EB%B6%84%EB%A6%AC-improves-metagenomic-read-classification</link>
	<title><![CDATA[Metabuli 분리 improves metagenomic read classification]]></title>
	<description><![CDATA[<p><span>Metabuli 분리 improves metagenomic read classification through metamers, DNA-AA k-mers, to be sensitive and specific, recovering 99% and 98% of DNA or AA classifiers.</span></p>
<p>&nbsp;</p>
<p><span><span>Metabuli is metagenomic classifier that jointly analyze both DNA and amino acid (AA) sequences. DNA-based classifiers can make specific classifications, exploiting point mutations to distinguish close taxa. AA-based classifiers have higher sensitivity in detecting homology between query and reference sequences, leverageing higher conservation of AA sequences. Metabuli combines the information of both sequence types using a novel k-mer structure,&nbsp;</span><em>metamer</em><span>, to enable both specific and sensitive characterization of metagenomic samples. In addition, it can classify reads against a database of any size as long as it fits in the hard disk.</span> </span></p><p>Address of the bookmark: <a href="https://github.com/steineggerlab/Metabuli" rel="nofollow">https://github.com/steineggerlab/Metabuli</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</guid>
	<pubDate>Fri, 26 Aug 2016 06:00:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28903/genevalidator-identify-problems-with-predicted-genes</link>
	<title><![CDATA[GeneValidator - Identify problems with predicted genes]]></title>
	<description><![CDATA[<p>GeneValidator helps in identifing problems with gene predictions and provide useful information extracted from analysing orthologs in BLAST databases. The results produced can be used by biocurators and researchers who need accurate gene predictions.</p>
<p>If you would like to use GeneValidator on a few sequences, see our online&nbsp;<a href="http://genevalidator.sbcs.qmul.ac.uk/">GeneValidator Web App</a>&nbsp;-<a href="http://genevalidator.sbcs.qmul.ac.uk/">http://genevalidator.sbcs.qmul.ac.uk</a>.</p>
<p>If you use GeneValidator in your work, please cite us as follows:</p>
<blockquote>
<p><a href="http://bioinformatics.oxfordjournals.org/content/early/2016/02/26/bioinformatics.btw015">Dragan M<span>&Dagger;</span>, Moghul MI<span>&Dagger;</span>, Priyam A, Bustos C &amp; Wurm Y. 2016. GeneValidator: identify problems with protein-coding gene predictions.&nbsp;<em>Bioinformatics</em>, doi: 10.1093/bioinformatics/btw015</a>.</p>
<p>&nbsp;</p>
</blockquote>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/wurmlab/genevalidator" rel="nofollow">https://github.com/wurmlab/genevalidator</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35787/protein-subcellular-localization-prediction</guid>
	<pubDate>Thu, 01 Mar 2018 06:20:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35787/protein-subcellular-localization-prediction</link>
	<title><![CDATA[Protein Subcellular Localization Prediction]]></title>
	<description><![CDATA[<p>Assigning subcellular localization to a protein is an important step towards elucidating its interaction partners, function, and potential role(s) in the cellular machinery. Computational tools offer an attractive complement to time-consuming and laborious experimental methods.</p>
<p>http://abi.inf.uni-tuebingen.de/Services/YLoc/webloc.cgi</p><p>Address of the bookmark: <a href="https://abi.inf.uni-tuebingen.de/Research/Systems%20Biology/protein-subcellular-localization" rel="nofollow">https://abi.inf.uni-tuebingen.de/Research/Systems%20Biology/protein-subcellular-localization</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33651/darkhorse-a-method-for-genome-wide-prediction-of-horizontal-gene-transfer</guid>
	<pubDate>Thu, 22 Jun 2017 07:58:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33651/darkhorse-a-method-for-genome-wide-prediction-of-horizontal-gene-transfer</link>
	<title><![CDATA[DarkHorse: a method for genome-wide prediction of horizontal gene transfer]]></title>
	<description><![CDATA[<p><span>A new approach to rapid, genome-wide identification and ranking of horizontal transfer candidate proteins is presented. The method is quantitative, reproducible, and computationally undemanding. It can be combined with genomic signature and/or phylogenetic tree-building procedures to improve accuracy and efficiency. The method is also useful for retrospective assessments of horizontal transfer prediction reliability, recognizing orthologous sequences that may have been previously overlooked or unavailable. These features are demonstrated in bacterial, archaeal, and eukaryotic examples.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1852411/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1852411/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37669/strum-structure-based-prediction-of-protein-stability-changes-upon-single-point-mutation</guid>
	<pubDate>Mon, 10 Sep 2018 13:21:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37669/strum-structure-based-prediction-of-protein-stability-changes-upon-single-point-mutation</link>
	<title><![CDATA[STRUM: structure-based prediction of protein stability changes upon single-point mutation]]></title>
	<description><![CDATA[<p><span>STRUM is a method for predicting the fold stability change (&Delta;&Delta;G) of protein molecules upon single-point nsSNP mutations. STRUM adopts a gradient boosting regression approch to train the Gibbs free-energy changes on a variety of features at different levels of sequence and structure properties. The unique characteristics of STRUM is the combination of sequence profiles with low-resolution structure models from protein structure prediction, which helps enhance the robustness and accuracy of the method and make it applicable to various protein seqences, including those without experimental structures&nbsp;</span></p><p>Address of the bookmark: <a href="https://zhanglab.ccmb.med.umich.edu/STRUM/" rel="nofollow">https://zhanglab.ccmb.med.umich.edu/STRUM/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>