<?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/29029?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/29029?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</guid>
	<pubDate>Mon, 15 May 2017 05:04:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</link>
	<title><![CDATA[CABOG: Celera Assembler with Best Overlap Graph]]></title>
	<description><![CDATA[<p>CABOG (Celera Assembler with Best Overlap Graph) is scientific software for&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/24/24/2818.abstract">DNA research</a>. CABOG has been a critical component of many genome sequencing projects. CABOG operates on small genomes such as bacterial as well as large genomes such as mammalian. CABOG is an extension of the Celera Assembler software that was originally developed at&nbsp;<a href="http://www.celera.com/">Celera</a>&nbsp;for the 2001 publication of the first draft human genome sequence. The software was released to the public domain in 2004. Its open source&nbsp;<a href="http://wgs-assembler.sf.net/">repository</a>&nbsp;on Source Forge is an internet resource for scientists around the world.&nbsp;</p>
<p>CABOG is one of many software programs called genome assemblers. These programs exist to overcome the fundamental limitation of all sequencing machines, namely, that they read out very few DNA letters at a time. These programs reconstruct genomes that are billions of letters long from the hundreds of letters per read that modern sequencers provide. What these programs do is often described as a scaled up version of a family solving a jigsaw puzzle.</p>
<p>The CABOG software was the first to accomplish many scientific goals. It was the first to assemble the genome of a multicellular organism (<em>Drosophila melanogaster</em>, 2000). It was the first to assemble both parental haplotypes of one human genome (J. Craig Venter, 2007). It was the first to assemble environmental sequence from the oceans (Sargasso Sea in 2004 and Global Ocean Sampling in 2007). It was first to combine reads from first-generation Sanger sequencing machines and second-generation pyrosequencing machines (Marine microbes, 2006). Today, CABOG is one of the leading assembly programs for data sets that include paired end data from the Roche 454 line of sequencing machines.</p><p>Address of the bookmark: <a href="http://www.jcvi.org/cms/research/projects/cabog/overview/" rel="nofollow">http://www.jcvi.org/cms/research/projects/cabog/overview/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29018/crossmap</guid>
	<pubDate>Mon, 05 Sep 2016 04:07:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29018/crossmap</link>
	<title><![CDATA[CrossMap]]></title>
	<description><![CDATA[<ul>
<li>CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between&nbsp;<em>different assemblies</em>&nbsp;(such as Human&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/2928/">hg18 (NCBI36)</a>&nbsp;&lt;&gt;&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/2758/">hg19 (GRCh37)</a>, Mouse&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/165668/">mm9 (MGSCv37)</a>&nbsp;&lt;&gt;&nbsp;<a href="http://www.ncbi.nlm.nih.gov/assembly/327618/">mm10 (GRCm38)</a>).</li>
<li>It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.</li>
<li>CrossMap is designed to liftover genome coordinates between assemblies. It&rsquo;s&nbsp;<em>not</em>&nbsp;a program for aligning sequences to reference genome.</li>
<li>We&nbsp;<em>do not</em>&nbsp;recommend using CrossMap to convert genome coordinates between species.</li>
</ul><p>Address of the bookmark: <a href="http://crossmap.sourceforge.net/" rel="nofollow">http://crossmap.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28844/teannot</guid>
	<pubDate>Thu, 18 Aug 2016 10:02:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28844/teannot</link>
	<title><![CDATA[TEannot]]></title>
	<description><![CDATA[<p>We advise to run first the TEdenovo pipeline but it is not compulsory. We suppose you begin by running the TEannot pipeline on the example provided in the directory "db/" rather than directly on your own genomic sequences. Thus, from now on, the project name is "DmelChr4".</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto" rel="nofollow">https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28891/lumpy</guid>
	<pubDate>Thu, 25 Aug 2016 08:05:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28891/lumpy</link>
	<title><![CDATA[LUMPY]]></title>
	<description><![CDATA[<p>A probabilistic framework for structural variant discovery.</p>
<p>Ryan M Layer, Colby Chiang, Aaron R Quinlan, and Ira M Hall. 2014. "LUMPY: a Probabilistic Framework for Structural Variant Discovery." Genome Biology 15 (6): R84.&nbsp;<a href="http://dx.doi.org/10.1186/gb-2014-15-6-r84">doi:10.1186/gb-2014-15-6-r84</a>.</p>
<p>More at&nbsp;https://github.com/arq5x/lumpy-sv</p><p>Address of the bookmark: <a href="https://github.com/arq5x/lumpy-sv" rel="nofollow">https://github.com/arq5x/lumpy-sv</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28922/ka-ks-and-kaks-calculations</guid>
	<pubDate>Mon, 29 Aug 2016 11:44:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28922/ka-ks-and-kaks-calculations</link>
	<title><![CDATA[Ka, Ks and Ka/Ks calculations]]></title>
	<description><![CDATA[<p>gKaKs is a codon-based genome-level Ka/Ks computation pipeline developed and based on programs from four widely used packages: BLAT, BLASTALL (including bl2seq, formatdb and fastacmd), PAML (including codeml and yn00) and KaKs_Calculator (including 10 substitution rate estimation methods). gKaKs can automatically detect and eliminate frameshift mutations and premature stop codons to compute the substitution rates (Ka, Ks and Ka/Ks) between a well-annotated genome and a non-annotated genome or even a poorly assembled scaffold dataset. It is especially useful for newly sequenced genomes that have not been well annotated.&nbsp;</p>
<p>Look for KaKs calculation:</p>
<p>https://github.com/fumba/kaks-calculator</p>
<p>http://longlab.uchicago.edu/?q=gKaKs</p>
<p>http://www.ncbi.nlm.nih.gov/pubmed/23314322</p><p>Address of the bookmark: <a href="http://longlab.uchicago.edu/?q=gKaKs" rel="nofollow">http://longlab.uchicago.edu/?q=gKaKs</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28999/redundans</guid>
	<pubDate>Thu, 01 Sep 2016 08:28:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28999/redundans</link>
	<title><![CDATA[Redundans]]></title>
	<description><![CDATA[<p>Redundans pipeline assists&nbsp;<span>an assembly of heterozygous genomes</span>.<br>Program takes as input&nbsp;<span>assembled contigs</span>,&nbsp;<span>paired-end and/or mate pairs sequencing libraries</span>&nbsp;and returns&nbsp;<span>scaffolded homozygous genome assembly</span>, that should be&nbsp;<span>less fragmented</span>&nbsp;and with total&nbsp;<span>size smaller</span>&nbsp;than the input contigs. In addition, Redundans will automatically&nbsp;<span>close the gaps</span>&nbsp;resulting from genome assembly or scaffolding&nbsp;<a href="https://github.com/Gabaldonlab/redundans/blob/master/test#redundans-pipeline">more details</a>.</p>
<p>The pipeline consists of three steps/modules:</p>
<ul>
<li><span>redundancy reduction</span>: detection and selectively removal of redundant contigs from an initial&nbsp;<em>de novo</em>&nbsp;assembly</li>
<li><span>scaffolding</span>: joining of genome fragments using paired-end and/or mate-pairs reads</li>
<li><span>gap closing</span></li>
</ul>
<p>Redundans is:</p>
<ul>
<li><span>fast</span>&nbsp;&amp;&nbsp;<span>lightweight</span>, multi-core support and memory-optimised, so it can be run even on the laptop for small-to-medium size genomes</li>
<li><span>flexible</span>&nbsp;toward many sequencing technologies (Illumina, 454 or Sanger) and library types (paired-end, mate pairs, fosmids)</li>
<li><span>modular</span>: every step can be ommited or replaced by another tools</li>
</ul><p>Address of the bookmark: <a href="https://github.com/Gabaldonlab/redundans" rel="nofollow">https://github.com/Gabaldonlab/redundans</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/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>

</channel>
</rss>