<?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/34922?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/34922?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/29004/r-chie</guid>
	<pubDate>Thu, 01 Sep 2016 11:47:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29004/r-chie</link>
	<title><![CDATA[R-chie]]></title>
	<description><![CDATA[<p><strong>R-chie</strong><span>&nbsp;allows you to make arc diagrams of RNA secondary structures, allowing for easy comparison and overlap of two structures, rank and display basepairs in colour and to also visualize corresponding multiple sequence alignments and co-variation information.</span><br><strong>R4RNA</strong><span>&nbsp;is the R package powering R-chie, available for&nbsp;</span><a href="http://www.e-rna.org/r-chie/download.cgi">download</a><span>&nbsp;and local use for more customized figures and scripting.</span></p>
<p>http://www.e-rna.org/r-chie/plot.cgi?eg=single</p><p>Address of the bookmark: <a href="http://www.e-rna.org/r-chie/plot.cgi?eg=single" rel="nofollow">http://www.e-rna.org/r-chie/plot.cgi?eg=single</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29110/structural-variants-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29110/structural-variants-ppt</link>
	<title><![CDATA[Structural variants PPT]]></title>
	<description><![CDATA[<p>1000 Genomes data tutorial at ASHG</p><p>Structural variants presentation by</p><p>Jan Korbel</p><p>European Molecular Biology Laboratory (EMBL) Heidelberg Genome Biology Research Unit</p><p>Reference:&nbsp;</p><p>https://www.genome.gov/pages/research/der/1000genomesprojecttutorials/structuralvariants-jankorbel.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29110" length="1090837" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29144/fermi</guid>
	<pubDate>Fri, 09 Sep 2016 05:37:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29144/fermi</link>
	<title><![CDATA[FERMI]]></title>
	<description><![CDATA[<p><span>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;</span><span>short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;</span><span>typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;</span><span>collapsed by other assemblers. Its ultimate goal is to find a minimal set of</span><br><span>unitigs to represent all the information in raw reads.</span><br><br><span>Fermi follows the overlap-layout-consensus paradigm and uses the FM-DNA-index&nbsp;</span><span>(FMD-index) as the key data structure. It is inspired by the string graph&nbsp;</span><span>assembler (Simpson and Durbin, 2010 and 2012) and has a similar workflow.</span><br><br><span>As a typical de novo assembler, fermi tends to produce contigs with slightly&nbsp;</span><span>longer N50. However, the major weakness of fermi is the high misassembly rate.&nbsp;</span><span>Although fermi provides a tool to fix misassemblies by using paired-end reads&nbsp;</span><span>to achieve an accuracy comparable to other assemblers, this is not a favorable&nbsp;</span><span>solution.</span><br><br><span>Fermi is designed to be used on a multi-core Linux machine with large shared&nbsp;</span><span>memory. The easiest way to run fermi is to use the run-fermi.pl script. It&nbsp;</span><span>generates a Makefile. The actual assembly is done by invoking make. Premature&nbsp;</span><span>assembly processes can be resumed. Here is an example:</span><br><br><span>run-fermi.pl -dAPe ./fermi -p NA12878 -t16 -f18 reads*.fq.gz &gt; NA12878.mak</span><br><span>make -f NA12878.mak -j16</span></p><p>Address of the bookmark: <a href="https://github.com/lh3/fermi" rel="nofollow">https://github.com/lh3/fermi</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29487/shinyheatmap</guid>
	<pubDate>Fri, 21 Oct 2016 05:12:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29487/shinyheatmap</link>
	<title><![CDATA[Shinyheatmap]]></title>
	<description><![CDATA[<p><span>Background: Transcriptomics, metabolomics, metagenomics, and other various next-generation sequencing (-omics) fields are known for their production of large datasets. Visualizing such big data has posed technical challenges in biology, both in terms of available computational resources as well as programming acumen. Since heatmaps are used to depict high-dimensional numerical data as a colored grid of cells, efficiency and speed have often proven to be critical considerations in the process of successfully converting data into graphics. For example, rendering interactive heatmaps from large input datasets (e.g., 100k+ rows) has been computationally infeasible on both desktop computers and web browsers. In addition to memory requirements, programming skills and knowledge have frequently been barriers-to-entry for creating highly customizable heatmaps. Results: We propose shinyheatmap: an advanced user-friendly heatmap software suite capable of efficiently creating highly customizable static and interactive biological heatmaps in a web browser. shinyheatmap is a low memory footprint program, making it particularly well-suited for the interactive visualization of extremely large datasets that cannot typically be computed in-memory due to size restrictions. Conclusions: shinyheatmap is hosted online as a freely available web server with an intuitive graphical user interface: http://shinyheatmap.com. The methods are implemented in R, and are available as part of the shinyheatmap project at: https://github.com/Bohdan-Khomtchouk/shinyheatmap.</span></p>
<p><span>More at&nbsp;http://biorxiv.org/content/early/2016/09/21/076463&nbsp;</span></p><p>Address of the bookmark: <a href="http://shinyheatmap.com/" rel="nofollow">http://shinyheatmap.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</guid>
	<pubDate>Fri, 04 Nov 2016 05:02:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</link>
	<title><![CDATA[HybPiper]]></title>
	<description><![CDATA[<p>HybPiper was designed for targeted sequence capture, in which DNA sequencing libraries are enriched for gene regions of interest, especially for phylogenetics. HybPiper is a suite of Python scripts that wrap and connect bioinformatics tools in order to extract target sequences from high-throughput DNA sequencing reads.</p>
<p>Targeted bait capture is a technique for sequencing many loci simultaneously based on bait sequences. HybPiper pipeline starts with high-throughput sequencing reads (for example from Illumina MiSeq), and assigns them to target genes using BLASTx or BWA. The reads are distributed to separate directories, where they are assembled separately using SPAdes. The main output is a FASTA file of the (in frame) CDS portion of the sample for each target region, and a separate file with the translated protein sequence.</p>
<p>HybPiper also includes post-processing scripts, run after the main pipeline, to also extract the intronic regions flanking each exon, investigate putative paralogs, and calculate sequencing depth. For more information,&nbsp;<a href="https://github.com/mossmatters/HybPiper/wiki/">please see our wiki</a>.</p>
<p>HybPiper is run separately for each sample (single or paired-end sequence reads). When HybPiper generates sequence files from the reads, it does so in a standardized directory hierarchy. Many of the post-processing scripts rely on this directory hierarchy, so do not modify it after running the initial pipeline. It is a good idea to run the pipeline for each sample from the same directory. You will end up with one directory per run of HybPiper, and some of the later scripts take advantage of this predictable directory structure.</p><p>Address of the bookmark: <a href="https://github.com/mossmatters/HybPiper" rel="nofollow">https://github.com/mossmatters/HybPiper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</guid>
	<pubDate>Tue, 08 Nov 2016 07:09:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</link>
	<title><![CDATA[Bioistats PPT]]></title>
	<description><![CDATA[<p>Basics concepts of&nbsp;Probability: The Study of Randomness</p><p>Biostatistics is the application of statistics to a wide range of topics in biology. The science of biostatistics encompasses the design of biological experiments, especially in medicine, pharmacy, agriculture and fishery; the collection, summarization, and analysis of data from those experiments; and the interpretation of, and inference from, the results. A major branch of this is medical biostatistics, which is exclusively concerned with medicine and health.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29652" length="1663809" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</guid>
	<pubDate>Wed, 09 Nov 2016 16:29:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</link>
	<title><![CDATA[Method in Comparative genomics !!]]></title>
	<description><![CDATA[<p>We present methods for the automatic determination of genome correspondence. The algorithms enabled the automatic identification of orthologs for more than 90% of genes and intergenic regions across the four species despite the large number of duplicated genes in the yeast genome. The remaining ambiguities in the gene correspondence revealed recent gene family expansions in regions of rapid genomic change.</p>
<p>We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.</p>
<p>Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.</p><p>Address of the bookmark: <a href="http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf" rel="nofollow">http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29992/spines</guid>
	<pubDate>Mon, 28 Nov 2016 05:33:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29992/spines</link>
	<title><![CDATA[Spines]]></title>
	<description><![CDATA[<p><a href="https://www.broadinstitute.org/ftp/distribution/software/spines/"><em>Spines</em></a>&nbsp;is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages:&nbsp;<em>Satsuma,</em>&nbsp;a highly parallelized program for high-sensitivity, genome-wide synteny;&nbsp;<em>Papaya,</em>&nbsp;an all-purpose alignment tool for less diverged sequences; and&nbsp;<em>SLAP,</em>&nbsp;a context-sensitive local aligner for diverged sequences with large gaps.</p>
<p>Access&nbsp;<em>Spines</em>&nbsp;<a href="https://www.broadinstitute.org/ftp/distribution/software/spines/">here</a>.</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/genome-sequencing-and-analysis/spines" rel="nofollow">https://www.broadinstitute.org/genome-sequencing-and-analysis/spines</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30076/sga-string-graph-assembler</guid>
	<pubDate>Thu, 08 Dec 2016 05:08:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30076/sga-string-graph-assembler</link>
	<title><![CDATA[SGA: String Graph Assembler]]></title>
	<description><![CDATA[<p><span>SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads.</span></p>
<p><span>More at</span></p>
<p><span>https://github.com/jts/sga</span></p>
<p>SGA dependencies:<br> -google sparse hash library (http://code.google.com/p/google-sparsehash/)<br> -the bamtools library (https://github.com/pezmaster31/bamtools)<br> -zlib (http://www.zlib.net/)<br> -(optional but suggested) the jemalloc memory allocator (http://www.canonware.com/jemalloc/download.html)</p><p>Address of the bookmark: <a href="https://github.com/jts/sga" rel="nofollow">https://github.com/jts/sga</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>