<?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/39674?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/39674?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29123/artemis-comparison-tool-act</guid>
	<pubDate>Wed, 07 Sep 2016 03:54:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29123/artemis-comparison-tool-act</link>
	<title><![CDATA[Artemis Comparison Tool (ACT)]]></title>
	<description><![CDATA[<p><span>ACT is a Java application for displaying pairwise comparisons between two or more DNA sequences. It can be used to identify and analyse regions of similarity and difference between genomes and to explore conservation of synteny, in the context of the entire sequences and their annotation.&nbsp;It can read complete EMBL,&nbsp;GENBANK and GFF entries or sequences in FASTA or raw format.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act" rel="nofollow">http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act</a></p>]]></description>
	<dc:creator>Shruti Paniwala</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/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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29384/phymmbl</guid>
	<pubDate>Mon, 10 Oct 2016 08:56:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29384/phymmbl</link>
	<title><![CDATA[PHYMMBL]]></title>
	<description><![CDATA[<p><span>Metagenomics sequencing projects collect samples of DNA from uncharacterized environments that may contain hundreds or even thousands of species. One of the main challenges in analyzing a metagenome is phylogenetic classification of raw sequence reads into groups representing the same or similar species. Such classification is a useful prerequisite for genome assembly and for analysis of the biological diversity present in a sample. The newest sequencing technologies have simultaneously made metagenomics easier, by making the sequencing process faster, and more difficult, by producing shorter read lengths than previous technologies. Methods for classifying sequences as short as 100 base pairs (bp) have until now been relatively inaccurate, requiring metagenomics projects to use older, long-read technologies.&nbsp;</span><strong>Phymm</strong><span>, a new classification approach for metagenomics data which uses interpolated Markov models (IMMs) to taxonomically classify DNA sequences, can accurately classify reads as short as 100 bp. Its accuracy for short reads represents a significant leap forward over previous composition-based classification methods.&nbsp;</span><strong>PhymmBL</strong><span>&nbsp;(rhymes with "thimble"), the hybrid classifier included in this distribution which combines analysis from both Phymm and&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/BLAST">BLAST</a><span>, produces even higher accuracy.</span></p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/software/phymm/" rel="nofollow">http://www.cbcb.umd.edu/software/phymm/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29574/beagle</guid>
	<pubDate>Thu, 27 Oct 2016 11:19:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29574/beagle</link>
	<title><![CDATA[Beagle]]></title>
	<description><![CDATA[<p>Beagle is a software package that performs genotype calling, genotype phasing, imputation of ungenotyped markers, and identity-by-descent segment detection.</p>
<p>Beagle version 4.1 has a more accurate genotype phasing algorithm and a very fast and accurate genotype imputation algorithm. Version 4.1 also has several changes to the command line arguments which are described in the&nbsp;<a href="http://faculty.washington.edu/browning/beagle/release_notes" target="_blank">release notes</a>. The "ped" argument has no effect in version 4.1. If your data contains nuclear families and you want to model the parent-offspring relationships when phasing genotypes, please use&nbsp;<a href="https://faculty.washington.edu/browning/beagle/b4_0.html">version 4.0</a>.</p>
<p>If you use Beagle 4.1 in a published analysis, please report the program version and cite the appropriate article.</p>
<p>The citation for Beagle's phasing algorithm is:</p>
<p>S R Browning and B L Browning (2007) Rapid and accurate haplotype phasing and missing data inference for whole genome association studies by use of localized haplotype clustering. Am J Hum Genet 81:1084-1097.<a href="http://dx.doi.org/doi:10.1086/521987" target="_blank">doi:10.1086/521987</a></p>
<p>The citation for Beagle's genotype imputation algorithm is:</p>
<p>B L Browning and S R Browning (2016). Genotype imputation with millions of reference samples. Am J Hum Genet 98:116-126.<a href="http://dx.doi.org/doi:10.1016/j.ajhg.2015.11.020" target="_blank">doi:10.1016/j.ajhg.2015.11.020</a></p>
<p>The citation for Beagle's IBD detection algorithm is:</p>
<p>B L Browning and S R Browning (2013). Improving the accuracy and efficiency of identity-by-descent detection in population data. Genetics 194(2):459-71.<a href="http://dx.doi.org/doi:10.1534/genetics.113.150029" target="_blank">doi:10.1534/genetics.113.150029</a></p><p>Address of the bookmark: <a href="http://faculty.washington.edu/browning/beagle/beagle.html" rel="nofollow">http://faculty.washington.edu/browning/beagle/beagle.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29614/art-set-of-simulation-tools</guid>
	<pubDate>Thu, 03 Nov 2016 08:28:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29614/art-set-of-simulation-tools</link>
	<title><![CDATA[ART: Set of Simulation Tools]]></title>
	<description><![CDATA[<p>ART is a set of simulation tools to generate synthetic next-generation sequencing reads. ART simulates sequencing reads by mimicking real sequencing process with empirical error models or quality profiles summarized from large recalibrated sequencing data. ART can also simulate reads using user own read error model or quality profiles. ART supports simulation of single-end, paired-end/mate-pair reads of three major commercial next-generation sequencing platforms: Illumina's Solexa, Roche's 454 and Applied Biosystems' SOLiD. ART can be used to test or benchmark a variety of method or tools for next-generation sequencing data analysis, including read alignment, de novo assembly, SNP and structure variation discovery. ART was used as a primary tool for the simulation study of the <span><a href="http://www.1000genomes.org/" target="_blank">1000 Genomes Project<span></span></a></span> . ART is implemented in C++ with optimized algorithms and is highly efficient in read simulation. ART outputs reads in the FASTQ format, and alignments in the ALN format. ART can also generate alignments in the SAM alignment or UCSC BED file format. ART can be used together with genome variants simulators (e.g. <span><a href="http://bioinform.github.io/varsim/" target="_blank">VarSim<span></span></a></span>) for evaluating variant calling tools or methods.</p><p>Address of the bookmark: <a href="http://www.niehs.nih.gov/research/resources/software/biostatistics/art/" rel="nofollow">http://www.niehs.nih.gov/research/resources/software/biostatistics/art/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</guid>
	<pubDate>Fri, 04 Nov 2016 12:50:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</link>
	<title><![CDATA[R Graphical Cookbook by Winston Chang]]></title>
	<description><![CDATA[<p>R Graphical Cookbook by Winston Chang</p><p>A very nice book by Winston Chang for R ethusiast. The R code presented in these pages is the R code actually used to produce the Figures in the book. There will be differences compared to the code chunks shown in the text of the book, but in most cases the differences will be that these pages contain additional code to lay out multiple plots on a single "page".</p><p>The code presented for each figure is self-contained, i.e., all code required to produce the figure is included. This means that there is sometimes considerable overlap of code between several figures  In some cases, it may be necessary to install an add-on package from CRAN to get the code to run.</p><p>More books at http://www.e-reading.club/bookreader.php/137370/C486x_APPb.pdf</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29638" length="37521" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29995/hga</guid>
	<pubDate>Tue, 29 Nov 2016 07:25:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29995/hga</link>
	<title><![CDATA[HGA]]></title>
	<description><![CDATA[<p>HGA tool version 1.0 This tool helps to apply the Hierarchical Genome Assembly (HGA) method. The tool will apply: 1. Partitioning a given reads dataset into a given number of partitions. 2. Assembling each partitions using a pre-specified assembler (Velvet or SPAdes in this version) and using a given kmer size. 3. Merging all the assemblies of the partition. 4. Combining all the assemblies of the partition (using velvet with kmer value of 31). 5. Finaly, re-assembling the whole dataset with the merged contigs or the combined contigs, using a given kmer size.</p>
<p>https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</p><p>Address of the bookmark: <a href="https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA" rel="nofollow">https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30074/minia</guid>
	<pubDate>Thu, 08 Dec 2016 05:07:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30074/minia</link>
	<title><![CDATA[Minia]]></title>
	<description><![CDATA[<p>Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day. The output of Minia is a set of contigs. Minia produces results of similar contiguity and accuracy to other de Bruijn assemblers (e.g. Velvet).</p>
<h3>Download</h3>
<p><a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-bin-Linux.tar.gz">Minia 2.0.7 Linux 64-bits binaries</a>&nbsp;(<a href="https://github.com/GATB/minia/releases/download/v2.0.7/minia-v2.0.7-Source.tar.gz">Source code</a>)&nbsp;<span>(<a href="http://minia.genouest.org/files/minia-1.6906.tar.gz">Legacy codebase</a>)</span></p>
<h3>For the impatient</h3>
<p>A typical Minia command line looks like:</p>
<pre>./minia -in <span>reads.fa</span> -kmer-size <span>31</span> -abundance-min <span>3</span> -out <span>output_prefix</span></pre>
<p>Type</p>
<pre>./minia</pre>
<p><span>for a quick explanation of the parameters.</span></p>
<p>For more information, refer to the&nbsp;<a href="http://minia.genouest.org/files/minia.pdf">manual</a>.</p>
<p><a href="http://kmergenie.bx.psu.edu/">KmerGenie</a>&nbsp;can be used to determine the best k-mer size, minimum abundance of correct k-mers, and genome size estimation for your dataset.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://minia.genouest.org/" rel="nofollow">http://minia.genouest.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>