<?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/34862?offset=230</link>
	<atom:link href="https://bioinformaticsonline.com/related/34862?offset=230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36583/eugi-a-novel-resource-for-studying-genomic-islands-to-facilitate-horizontal-gene-transfer-detection-in-eukaryotes</guid>
	<pubDate>Sat, 12 May 2018 07:26:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36583/eugi-a-novel-resource-for-studying-genomic-islands-to-facilitate-horizontal-gene-transfer-detection-in-eukaryotes</link>
	<title><![CDATA[EuGI: a novel resource for studying genomic islands to facilitate horizontal gene transfer detection in eukaryotes]]></title>
	<description><![CDATA[<p><span>SWGIS v2.0 along with the EuGI database, which houses GIs identified in 66 different eukaryotic species, and the EuGI web-resource, provide the first comprehensive resource for studying HGT in eukaryotes.</span></p>
<p>https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8</p><p>Address of the bookmark: <a href="https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8" rel="nofollow">https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-018-4724-8</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<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/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</guid>
	<pubDate>Thu, 13 Aug 2020 10:06:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42038/pyparanoid-a-pipeline-for-rapid-identification-of-homologous-gene-families-in-a-set-of-genomes</link>
	<title><![CDATA[PyParanoid: a pipeline for rapid identification of homologous gene families in a set of genomes]]></title>
	<description><![CDATA[<p>PyParanoid is a pipeline for rapid identification of homologous gene families in a set of genomes - a central task of any comparative genomics analysis. The "gold standard" for identifying homologs is to use reciprocal best hits (RBHs) which depends on performing a all-vs-all sequence comparison, usually using BLAST, to determine homology. However, these methods are computationally expensive, requiring&nbsp;O(n2)&nbsp;resources to identify RBHs. This is problematic, as the modern deluge of sequencing data means that comparative genomics analyses could be performed on datasets of thousands of strains.</p><p>Address of the bookmark: <a href="https://github.com/ryanmelnyk/PyParanoid" rel="nofollow">https://github.com/ryanmelnyk/PyParanoid</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/34940/jpred4-a-protein-secondary-structure-prediction-server</guid>
	<pubDate>Fri, 29 Dec 2017 16:14:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34940/jpred4-a-protein-secondary-structure-prediction-server</link>
	<title><![CDATA[JPred4: A Protein Secondary Structure Prediction Server]]></title>
	<description><![CDATA[<p><span>JPred4 (</span><a href="http://www.compbio.dundee.ac.uk/jpred4" target="">http://www.compbio.dundee.ac.uk/jpred4</a><span>) is the latest version of the popular JPred protein secondary structure prediction server which provides predictions by the JNet algorithm, one of the most accurate methods for secondary structure prediction.</span></p><p>Address of the bookmark: <a href="http://www.compbio.dundee.ac.uk/jpred4/" rel="nofollow">http://www.compbio.dundee.ac.uk/jpred4/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/39704/the-rogers-lab</guid>
  <pubDate>Mon, 15 Jul 2019 08:07:44 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Rogers Lab]]></title>
  <description><![CDATA[
<p>The Rogers lab studies evolution of genome structure. We explore the ways that complex mutations like duplications, deletions, rearrangements, and retrogenes can create new genetic material. We study how these new mutations are important for adaptation. We are currently working on projects in Drosophila, Mammoths, Elephants, Bivalves, and Frogs absolutely no amphibians. This multi-organism approach can help us understand when and why complex mutations are important for organism fitness.</p>

<p>More at http://evolscientist.com/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44889/gfaffix-identifies-walk-preserving-shared-affixes-in-variation-graphs-and-collapses-them-into-a-non-redundant-graph-structure</guid>
	<pubDate>Thu, 28 Aug 2025 03:11:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44889/gfaffix-identifies-walk-preserving-shared-affixes-in-variation-graphs-and-collapses-them-into-a-non-redundant-graph-structure</link>
	<title><![CDATA[GFAffix : Identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.]]></title>
	<description><![CDATA[<p><span>GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.</span></p>
<p>&nbsp;</p>
<p><span><img src="https://github.com/codialab/GFAffix/raw/main/doc/gfaffix-illustration.png?raw=true" alt="image" style="border: 0px; border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/codialab/GFAffix" rel="nofollow">https://github.com/codialab/GFAffix</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</guid>
	<pubDate>Tue, 16 Aug 2016 08:34:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28809/kissplice</link>
	<title><![CDATA[KisSplice]]></title>
	<description><![CDATA[<p>KisSplice is a software that enables to analyse RNA-seq data with or without a reference genome. It is an exact local transcriptome assembler that allows to identify SNPs, indels and alternative splicing events. It can deal with an arbitrary number of biological conditions, and will quantify each variant in each condition. It has been tested on Illumina datasets of up to 1G reads. Its memory consumption is around 5Gb for 100M reads.</p>
<p>KisSplice is not a full-length transcriptome assembler. This means that it will output the variable regions of the transcripts, not reconstruct them entirely.</p>
<p>KisSplice comes as a workflow, with several possible post-treatments meant to facilitate the analysis of the results. The choice of the post-treatment depends on the availability of a reference genome/transcriptome and on the need to perform a differential analysis, as summarised in the following table.</p><p>Address of the bookmark: <a href="http://kissplice.prabi.fr/" rel="nofollow">http://kissplice.prabi.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</guid>
	<pubDate>Fri, 01 Jul 2016 12:57:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28200/machine-learning</link>
	<title><![CDATA[Machine Learning !!!]]></title>
	<description><![CDATA[<p>In machine learning, computers apply&nbsp;<strong>statistical learning</strong>&nbsp;techniques to automatically identify patterns in data. These techniques can be used to make highly accurate predictions.</p>
<p><em>Keep scrolling.</em>&nbsp;Using a data set about homes, we will create a machine learning model to distinguish homes in New York from homes in San Francisco.</p><p>Address of the bookmark: <a href="http://www.r2d3.us/visual-intro-to-machine-learning-part-1/" rel="nofollow">http://www.r2d3.us/visual-intro-to-machine-learning-part-1/</a></p>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</guid>
	<pubDate>Wed, 13 Jul 2016 08:08:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</link>
	<title><![CDATA[WiseScaffolder]]></title>
	<description><![CDATA[<p>Function</p>
<p>WiseScaffolder is a stand-alone semi-automatic application for genome scaffolding of pre-assembled contigs using mate-pair data. It also produces editable scaffold maps, allowing either to build gapped scaffolds or usable as a common thread for the manual improvement of scaffolds.</p>
<p>Description&nbsp;</p>
<p>WiseScaffolder includes 4 subcommands: dumpconfig generates a configuration file that notably specifies the average insert size of the mate-pair library preprocess allows the detection and correction of chimerae, the estimation of contigs copy number and produces valuable outputs for the manual improvement of scaffolds scaffold constitutes the central scaffold-builder and comprises two modules:</p>
<p>i) the interative_scaffold_extender, which works with big, unambiguous contigs, or when they run out, single copy contigs, and</p>
<p>ii) the small_contig_inserter, which inserts the small contigs within scaffolds buildfasta converts the scaffold(s) map(s) into Fasta sequences.</p><p>Address of the bookmark: <a href="http://abims.sb-roscoff.fr/wisescaffolder" rel="nofollow">http://abims.sb-roscoff.fr/wisescaffolder</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>