<?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/28922?offset=230</link>
	<atom:link href="https://bioinformaticsonline.com/related/28922?offset=230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29210/cgview-circular-genome-viewer</guid>
	<pubDate>Mon, 19 Sep 2016 07:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29210/cgview-circular-genome-viewer</link>
	<title><![CDATA[CGView - Circular Genome Viewer]]></title>
	<description><![CDATA[<p>GView is a Java package used to display and navigate bacterial genomes. GView is useful for producing high-quality genome maps for use in publications and websites, or as a visualization tool in a sequence annotation pipeline. Users can interact with the genome using a powerful pan-and-zoom interface, or GView can write static images of a genome to a file. GView can draw a genome using either circular or linear layouts. For examples of some of the images GView can produce, see the <a href="https://www.gview.ca/bin/view/GView/ImageGallery">Image Gallery</a>. GView is a re-write of <a href="http://wishart.biology.ualberta.ca/cgview/" target="_top">CGView</a>, a circular genome viewer written by Paul Stothard. The goal of GView is to provide greater user interaction, and more flexibility in how the genome map is rendered. To aid with easily configuring the display of a genome, a style editor has been included to provide an intuitive, user-friendly graphical user interface for customizing genome maps. Styling attributes such as colours or fonts for the various map elements can be adjusted in real time. Customized styles can be saved for later use or for application to other genome maps using GView's <a href="https://www.gview.ca/bin/view/GViewDocumentation/GViewGSS">custom file format</a>.</p><p>Address of the bookmark: <a href="http://wishart.biology.ualberta.ca/cgview/" rel="nofollow">http://wishart.biology.ualberta.ca/cgview/</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/17176/arvados</guid>
	<pubDate>Sat, 20 Sep 2014 16:54:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17176/arvados</link>
	<title><![CDATA[Arvados]]></title>
	<description><![CDATA[<p>Arvados is a free and open&nbsp;source bioinformatics&nbsp;platform for genomic and&nbsp;biomedical data. User can&nbsp;Store | Organize | Compute | Share the data for free.&nbsp;</p>
<p><img src="https://arvados.org/images/dax.png" width="400" height="535" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://arvados.org/" rel="nofollow">https://arvados.org/</a></p>]]></description>
	<dc:creator>Martin Jones</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29379/bbmap-help</guid>
	<pubDate>Mon, 10 Oct 2016 06:29:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29379/bbmap-help</link>
	<title><![CDATA[BBMap help]]></title>
	<description><![CDATA[<div>
<div>BBMAP <span> &bull; <span>a solution for everything</span></span><a href="https://www.biostarhandbook.com/"><span></span></a></div>
<div>That content has been reformatted and it is being expanded to include more information.<span><span></span></span></div>
</div>
<hr>
<p>There are common options for most BBMap suite programs and depending on the file extension the input/output format is automatically chosen/set.</p>
<hr>
<h3>Using BBMap</h3>
<h4>Mapping Nanopore reads</h4>
<p>BBMap.sh has a length cap of 6kbp. Reads longer than this will be broken into 6kbp pieces and mapped independently.</p>
<p>More at https://www.biostarhandbook.com/tools/bbmap/bbmap-help.html</p><p>Address of the bookmark: <a href="https://www.biostarhandbook.com/tools/bbmap/bbmap-help.html" rel="nofollow">https://www.biostarhandbook.com/tools/bbmap/bbmap-help.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</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/file/view/29601/statistics-using-r-with-biological-examples</guid>
	<pubDate>Thu, 03 Nov 2016 04:55:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29601/statistics-using-r-with-biological-examples</link>
	<title><![CDATA[Statistics Using R   with Biological Examples]]></title>
	<description><![CDATA[<p>This book is a manifestation of my desire to teach researchers in biology a bit more about statistics than an ordinary introductory course covers and to introduce the utilization of R as a tool for analyzing their data. My goal is to reach those with little or no training in higher level statistics so that they can do more of their own data analysis, communicate more with statisticians, and appreciate the great potential statistics has to offer as a tool to answer biological questions. </p><p>This is necessary in light of the increasing use of higher level statistics in biomedical research. I hope it accomplishes this mission and encourage its free distribution and use as a course text or supplement.</p><p>K Seefeld, May 2007</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29601" length="4581031" type="application/pdf" />
</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/30149/mypro-a-seamless-pipeline-for-automated-prokaryotic-genome-assembly-and-annotation</guid>
	<pubDate>Thu, 15 Dec 2016 05:47:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30149/mypro-a-seamless-pipeline-for-automated-prokaryotic-genome-assembly-and-annotation</link>
	<title><![CDATA[MyPro: A seamless pipeline for automated prokaryotic genome assembly and annotation]]></title>
	<description><![CDATA[<p>MyPro is an improved genomics software pipeline for prokaryotic genomes. MyPro is user-friendly and requires minimal programming skills. High-quality prokaryotic genome assembly and annotation can be obtained with ease. It performed better than de novo assemblers and contig integration software. Produces more contiguous assemblies, higher N50 values and lower number of contigs.</p>
<p>More at https://sourceforge.net/projects/sb2nhri/files/MyPro/</p><p>Address of the bookmark: <a href="http://www.sciencedirect.com/science/article/pii/S0167701215001207" rel="nofollow">http://www.sciencedirect.com/science/article/pii/S0167701215001207</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30555/yaha</guid>
	<pubDate>Fri, 20 Jan 2017 05:38:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30555/yaha</link>
	<title><![CDATA[YAHA]]></title>
	<description><![CDATA[<p>YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.</p>
<p><strong>Availability:</strong> YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from <a href="http://faculty.virginia.edu/irahall/YAHA" target="pmc_ext">http://faculty.virginia.edu/irahall/YAHA</a>.</p>
<p><strong>Contact:</strong></p>
<p>http://genome.wustl.edu/people/groups/detail/hall-lab/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29656/statistics-and-probability</guid>
	<pubDate>Tue, 08 Nov 2016 07:34:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29656/statistics-and-probability</link>
	<title><![CDATA[Statistics and probability]]></title>
	<description><![CDATA[<h3><span>Topics</span></h3>
<div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/displaying-describing-data">Displaying and describing data</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/modeling-distributions-of-data">Modeling distributions of data</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/describing-relationships-quantitative-data">Describing relationships in quantitative data</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/designing-studies">Designing studies</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/probability-library">Probability</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/random-variables-stats-library">Random variables</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/sampling-distributions-library">Sampling distributions</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/confidence-intervals-one-sample">Confidence intervals (one sample)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/significance-tests-one-sample">Significance tests (one sample)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/significance-tests-confidence-intervals-two-samples">Significance tests and confidence intervals (two samples)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/inference-categorical-data-chi-square-tests">Inference for categorical data (chi-square tests)</a></div>
<div><a href="https://www.khanacademy.org/math/statistics-probability/advanced-regression-inference-transforming">Advanced regression (inference and tran</a></div>
</div><p>Address of the bookmark: <a href="https://www.khanacademy.org/math/statistics-probability" rel="nofollow">https://www.khanacademy.org/math/statistics-probability</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>