<?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/41969?offset=110</link>
	<atom:link href="https://bioinformaticsonline.com/related/41969?offset=110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38692/geneck-gene-network-construction-kit-is-a-comprehensive-online-tool-kit-that-integrate-various-statistical-methods-to-construct-gene-networks</guid>
	<pubDate>Tue, 15 Jan 2019 09:39:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38692/geneck-gene-network-construction-kit-is-a-comprehensive-online-tool-kit-that-integrate-various-statistical-methods-to-construct-gene-networks</link>
	<title><![CDATA[GeNeCK (Gene Network Construction Kit) is a comprehensive online tool kit that integrate various statistical methods to construct gene networks]]></title>
	<description><![CDATA[<p><strong>GeNeCK</strong><span>&nbsp;(Gene Network Construction Kit) is a comprehensive online tool kit that integrate various statistical methods to construct gene networks based on gene expression data and optional hub gene information.</span></p>
<p><span><span>It efficiently constructs gene networks from expression data. It allows the user to use ten different network construction methods (such as partial correlation-, likelihood-, Bayesian- and mutual information-based methods) and integrates the resulting networks from multiple methods. Hub gene information, if available, can be incorporated to enhance performance.</span></span></p>
<p><span><span><span>GeNeCK is an efficient and easy-to-use web application for gene regulatory network construction. It can be accessed at&nbsp;</span><span><a href="http://lce.biohpc.swmed.edu/geneck" target="_blank"><span>http://lce.biohpc.swmed.edu/geneck</span></a></span></span></span></p><p>Address of the bookmark: <a href="http://lce.biohpc.swmed.edu/geneck/" rel="nofollow">http://lce.biohpc.swmed.edu/geneck/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42362/magic-a-tool-for-predicting-transcription-factors-and-cofactors-driving-gene-sets-using-encode-data</guid>
	<pubDate>Thu, 26 Nov 2020 11:05:04 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42362/magic-a-tool-for-predicting-transcription-factors-and-cofactors-driving-gene-sets-using-encode-data</link>
	<title><![CDATA[MAGIC: A tool for predicting transcription factors and cofactors driving gene sets using ENCODE data]]></title>
	<description><![CDATA[<p><span>The algorithm presented herein,&nbsp;</span><strong>M</strong><span>ining&nbsp;</span><strong>A</strong><span>lgorithm for&nbsp;</span><strong>G</strong><span>enet</span><strong>I</strong><span>c&nbsp;</span><strong>C</strong><span>ontrollers (MAGIC), uses ENCODE ChIP-seq data to look for statistical enrichment of TFs and cofactors in gene bodies and flanking regions in gene lists without an&nbsp;</span><em>a priori</em><span>&nbsp;binary classification of genes as targets or non-targets. When compared to other TF mining resources, MAGIC displayed favourable performance in predicting TFs and cofactors that drive gene changes in 4 settings: </span></p>
<p><span>1) A cell line expressing or lacking single TF, </span></p>
<p><span>2) Breast tumors divided along PAM50 designations </span></p>
<p><span>3) Whole brain samples from WT mice or mice lacking a single TF in a particular neuronal subtype </span></p>
<p><span>4) Single cell RNAseq analysis of neurons divided by Immediate Early Gene expression levels. </span></p>
<p><span>In summary, MAGIC is a standalone application that produces meaningful predictions of TFs and cofactors in transcriptomic experiments.</span></p>
<p><span>More at&nbsp;https://uwmadison.app.box.com/s/8j90e5h2rjrsz3bacaxnq8kor2o64vyg</span></p><p>Address of the bookmark: <a href="https://github.com/asroopra/MAGIC" rel="nofollow">https://github.com/asroopra/MAGIC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</guid>
	<pubDate>Wed, 21 Feb 2024 15:01:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</link>
	<title><![CDATA[OMArk: software for proteome (protein-coding gene repertoire) quality assessment]]></title>
	<description><![CDATA[<p><span>OMArk is a software for proteome (protein-coding gene repertoire) quality assessment. It provides measures of proteome completeness, characterizes the consistency of all protein coding genes with regard to their homologs, and identifies the presence of contamination from other species. OMArk relies on the OMA orthology database, from which it exploits orthology relationships, and on the OMAmer software for fast placement of all proteins into gene families.</span></p><p>Address of the bookmark: <a href="https://github.com/DessimozLab/OMArk" rel="nofollow">https://github.com/DessimozLab/OMArk</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39913/twinblast-when-two-is-better-than-one</guid>
	<pubDate>Sat, 07 Sep 2019 08:50:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39913/twinblast-when-two-is-better-than-one</link>
	<title><![CDATA[TwinBLAST: When Two Is Better than One]]></title>
	<description><![CDATA[<p>TwinBLAST is a web-based tool for viewing 2 BLAST reports simultaneouslyside-by-side. It uses ExtJS (www.sencha.com/products/extjs/) to provide 2independently scrollable panels. BioPerl (www.bioperl.org) is used to indexraw BLAST reports and Bio::Graphics is used to draw pictograms of the BLASThits.</p>
<p><a href="https://github.com/IGS/twinblast">https://github.com/IGS/twinblast</a></p>
<p><a href="https://mra.asm.org/content/8/35/e00842-19">https://mra.asm.org/content/8/35/e00842-19</a></p><p>Address of the bookmark: <a href="https://github.com/IGS/twinblast" rel="nofollow">https://github.com/IGS/twinblast</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</guid>
	<pubDate>Tue, 01 Jan 2019 12:01:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</link>
	<title><![CDATA[HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning]]></title>
	<description><![CDATA[<p><span>HECIL&mdash;Hybrid Error Correction with Iterative Learning&mdash;a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.&nbsp;</span></p>
<p><span><span>HECIL&rsquo;s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.</span></span></p><p>Address of the bookmark: <a href="https://github.com/NDBL/HECIL" rel="nofollow">https://github.com/NDBL/HECIL</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:14:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</link>
	<title><![CDATA[Hercules: a profile HMM-based hybrid error correction algorithm for long reads]]></title>
	<description><![CDATA[<p><span>Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability: </span></p>
<p><span>Hercules source code is available at https://github.com/BilkentCompGen/Hercules</span></p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/Hercules" rel="nofollow">https://github.com/BilkentCompGen/Hercules</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</guid>
	<pubDate>Mon, 06 Mar 2017 03:49:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</link>
	<title><![CDATA[Prokka: tool for the rapid annotation of prokaryotic genomes]]></title>
	<description><![CDATA[<p>Prokka is a software tool for the rapid annotation of prokaryotic genomes. A typical 4 Mbp genome can be fully annotated in less than 10 minutes on a quad-core computer, and scales well to 32 core SMP systems. It produces GFF3, GBK and SQN files that are ready for editing in Sequin and ultimately submitted to Genbank/DDJB/ENA.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.vicbioinformatics.com/software.prokka.shtml" rel="nofollow">http://www.vicbioinformatics.com/software.prokka.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43011/deg-50-a-database-of-essential-genes-in-both-prokaryotes-and-eukaryotes</guid>
	<pubDate>Tue, 30 Mar 2021 11:47:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43011/deg-50-a-database-of-essential-genes-in-both-prokaryotes-and-eukaryotes</link>
	<title><![CDATA[DEG 5.0: a database of essential genes in both prokaryotes and eukaryotes]]></title>
	<description><![CDATA[<p><span>Essential genes are those indispensable for the survival of an organism, and their functions are therefore considered a foundation of life. Determination of a minimal gene set needed to sustain a life form, a fundamental question in biology, plays a key role in the emerging field, synthetic biology. </span></p>
<p><span></span><span>DEG is freely available at the website&nbsp;</span><a href="http://tubic.tju.edu.cn/deg" target="_blank">http://tubic.tju.edu.cn/deg</a><span>&nbsp;or&nbsp;</span><a href="http://www.essentialgene.org/" target="_blank">http://www.essentialgene.org</a><span>.</span></p><p>Address of the bookmark: <a href="http://www.essentialgene.org/" rel="nofollow">http://www.essentialgene.org/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>