<?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/43315?offset=410</link>
	<atom:link href="https://bioinformaticsonline.com/related/43315?offset=410" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/28269/4dgenome</guid>
	<pubDate>Mon, 04 Jul 2016 00:44:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28269/4dgenome</link>
	<title><![CDATA[4DGenome]]></title>
	<description><![CDATA[<p><span>Records in 4DGenome are compiled through comprehensive literature curation of experimentally-derived and computationally-predicted interactions. The current release contains 4,433,071 experimentally-derived and 3,605,176 computationally-predicted interactions in 5 organisms. Experimental data cover both high throughput datasets and individiual focused studies.&nbsp;</span><br><br><span>All interaction data are freely available in a standardized file format. Records can be queried by genomic regions, gene names, organism, and detection technology.&nbsp;</span></p><p>Address of the bookmark: <a href="http://4dgenome.research.chop.edu/" rel="nofollow">http://4dgenome.research.chop.edu/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29235/valet</guid>
	<pubDate>Thu, 22 Sep 2016 04:27:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29235/valet</link>
	<title><![CDATA[valet]]></title>
	<description><![CDATA[<div>
<div>
<div>VALET is a pipeline for performing&nbsp;<em>de novo</em>&nbsp;validation of metagenomic assemblies. VALET checks a number of properties that should hold true for a correct assembly (e.g., mate-pairs are aligned at the correct distance from each other in the assembly, the depth of coverage is fairly uniform along contigs, etc.). The violations of these invariants are reported allowing one to pinpoint areas that were potentially mis-assembled, or to compare the quality of different assemblies. For comparing multiple assemblies of the same data-sets, VALET also reports an overall estimate of the likelihood a particular assembly is correct.</div>
</div>
</div>
<div>
<div>Home Page:&nbsp;</div>
<div>
<div><a href="https://github.com/jgluck/VALET">VALET code repository</a></div>
</div>
</div><p>Address of the bookmark: <a href="https://www.cbcb.umd.edu/software/valet" rel="nofollow">https://www.cbcb.umd.edu/software/valet</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28870/genemania</guid>
	<pubDate>Mon, 22 Aug 2016 09:55:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28870/genemania</link>
	<title><![CDATA[GeneMANIA]]></title>
	<description><![CDATA[<p>Faster, more accurate algorithms function prediction "GeneMANIA (Multiple Association Network Integration Algorithm)" have however been developed in recent years and are publicly available on the web, indicating the future direction of function prediction.</p><p>Address of the bookmark: <a href="http://genemania.org/" rel="nofollow">http://genemania.org/</a></p>]]></description>
	<dc:creator>Jit</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/28937/sushi-an-rbioconductor-package-for-visualizing-genomic-data</guid>
	<pubDate>Wed, 31 Aug 2016 08:29:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28937/sushi-an-rbioconductor-package-for-visualizing-genomic-data</link>
	<title><![CDATA[Sushi: An R/Bioconductor package for visualizing genomic data]]></title>
	<description><![CDATA[<p>Sushi: An R/Bioconductor package for visualizing genomic data</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/Sushi/inst/doc/Sushi.pdf" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/Sushi/inst/doc/Sushi.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29008/circos-visualize</guid>
	<pubDate>Fri, 02 Sep 2016 08:29:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29008/circos-visualize</link>
	<title><![CDATA[CIRCOS Visualize !!]]></title>
	<description><![CDATA[<p>Before uploading a data file, check the&nbsp;<a href="http://mkweb.bcgsc.ca/tableviewer/samples">samples gallery</a>&nbsp;to make sure that your data format is compatible.</p>
<ul>
<li>Your file must be&nbsp;<strong>plain text</strong>.</li>
<li>Your data values must be&nbsp;<strong>non-negative integers</strong>.</li>
<li>Data must be space-separated (<strong>one or more</strong>&nbsp;tab or space, which will be collapsed).</li>
<li>No two rows or columns may have the same name.</li>
<li>Column and row names must&nbsp;<strong>begin with a letter</strong>&nbsp;(e.g. 'A', 'A0', 'A-0') and can only contain letters, numbers and _. No punctuation!</li>
<li>Maximum row + column total is 150 &mdash; if exceeded, rows and columns are limited to 75.</li>
<li>If you are using order, size and color rows/columns in combination they must appear in that order.</li>
</ul>
<p>Need help? Post questions to the&nbsp;<a href="https://groups.google.com/forum/#!forum/circos-data-visualization">Circos Google Group</a>.</p>
<p>http://mkweb.bcgsc.ca/tableviewer/visualize/</p><p>Address of the bookmark: <a href="http://mkweb.bcgsc.ca/tableviewer/visualize/" rel="nofollow">http://mkweb.bcgsc.ca/tableviewer/visualize/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29112/sybil</guid>
	<pubDate>Wed, 07 Sep 2016 03:20:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29112/sybil</link>
	<title><![CDATA[Sybil]]></title>
	<description><![CDATA[<p><span>The Sybil software package provides a primarily web-based front-end to comparative genome datasets warehoused in a chado relational database. It was developed by the bioinformatics department at The Institute for Genomic Research (</span><a href="http://www.tigr.org/">TIGR</a><span>) and development continues at the J. Craig Venter Institute (</span><a href="http://jcvi.org/">JCVI</a><span>) and the Institute for Genome Sciences (</span><a href="http://igs.umaryland.edu/">IGS</a><span>) at the University of Maryland: Baltimore. Sybil has been used at TIGR/JCVI, IGS, NYU, New York Medical College, Novartis Vaccines and University of Maryland: College Park to support a number of research projects that involve comparative genome analysis. The following sections provide some high-level technical details about the overall architecture and external dependencies of the Sybil package.</span></p><p>Address of the bookmark: <a href="http://sybil.sourceforge.net/" rel="nofollow">http://sybil.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29270/blast-ring-image-generator-brig</guid>
	<pubDate>Fri, 30 Sep 2016 09:18:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29270/blast-ring-image-generator-brig</link>
	<title><![CDATA[BLAST Ring Image Generator (BRIG)]]></title>
	<description><![CDATA[<p>BRIG is a free cross-platform (Windows/Mac/Unix) application that can display circular comparisons between a large number of genomes, with a focus on handling genome assembly data. The application is available at: <a href="http://sourceforge.net/projects/brig">http://sourceforge.net/projects/brig</a></p>
<p>If you have any questions or comments, post them on <a href="http://sourceforge.net/tracker/?group_id=328245">one of the trackers</a> on BRIG&rsquo;s SourceForge page: <a href="http://sourceforge.net/tracker/?group_id=328245">http://sourceforge.net/tracker/?group_id=328245</a>.</p>
<p>Features:</p>
<ul>
<li>Images show similarity between a central reference sequence and other sequences as concentric rings.</li>
<li>BRIG will perform all BLAST comparisons and file parsing automatically via a simple GUI.</li>
<li>Contig boundaries and read coverage can be displayed for draft genomes; customized graphs and annotations can be displayed.</li>
<li>Using a user-defined set of genes as input, BRIG can display gene presence, absence, truncation or sequence variation in a set of complete genomes, draft genomes or even raw, unassembled sequence data.</li>
<li>BRIG also accepts SAM-formatted read-mapping files enabling genomic regions present in unassembled sequence data from multiple samples to be compared simultaneously</li>
</ul><p>Address of the bookmark: <a href="http://brig.sourceforge.net/" rel="nofollow">http://brig.sourceforge.net/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</guid>
	<pubDate>Sat, 01 Oct 2016 14:45:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</link>
	<title><![CDATA[Nemo – A stochastic, individual-base, genetically explicit simulation platform]]></title>
	<description><![CDATA[<ul>
<li>
<p>A&nbsp;<strong>recombination map</strong>&nbsp;has been added for all multi-locus traits. The map positions (chromosomal) for neutral markers (e.g. SNPs) and loci under selection (QTLs, deleterious mutations, DMIs) can now be specified explicitly, or set at random. The map can hold an unlimited number of loci of different types jointly, at any recombination scale (cM or lower). The effects of linkage can thus be finely explored.</p>
</li>
<li>
<p>A new trait coding for (Bateson-)<strong>Dobzhansky-Muller incompatibility loci</strong>. Multiple haploid or diploid pairs of incompatible loci can be spread throughout the genome and affect individual fitness.</p>
</li>
<li>
<p><strong>Multi-type selection</strong>:&nbsp;<a href="http://nemo2.sourceforge.net/classIndividual.html" title="This class contains traits along with other individual information (sex, pedigree, etc. ).">Individual</a>&nbsp;fitness can be jointly determined by different types of loci under selectinon, such as QTLs coding for quantitative traits under spatially variable selection, universally deleterious mutations, and Dobzhansky-Muller incompatibility loci.</p>
</li>
<li>
<p><strong>An unlimited number of quantitative traits</strong>&nbsp;under different forms of selection can be modelled, based on universally pleiotropic loci with several bi- or multi-allelic models.</p>
</li>
<li>
<p><strong>Spatial and temporal variation of selection</strong>&nbsp;on quantitative traits is possible, modelling shifts of environmental conditions over time.</p>
</li>
<li>
<p>The dispersal matrix describing the movement of individuals among sub-populations can be replaced by a connectivity matrix and a reduced dispersal matrix describing migration only among the connected sub-populations. This offers a substantial gain in computing time and system memory when simulating very large grids.</p>
</li>
<li>
<p>Input parameters' arguments may be specified in separate files. This is particularly convenient when specifying large matrices.</p>
</li>
<li>
<p>Many adjustments have been made for refined control of the input of parameters and data output. See updates in the manual.</p>
</li>
</ul><p>Address of the bookmark: <a href="http://nemo2.sourceforge.net/index.html" rel="nofollow">http://nemo2.sourceforge.net/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>