<?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/29583?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/29583?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/29108/assembly-tutorial-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:12:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</link>
	<title><![CDATA[Assembly tutorial PPT]]></title>
	<description><![CDATA[<p>Saved Cornell University assembly workshop PPT.</p><p>Reference:&nbsp;</p><p>http://cbsu.tc.cornell.edu/lab/doc/assembly_workshop_20150420_lecture1.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29108" length="1617402" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</guid>
	<pubDate>Fri, 09 Sep 2016 05:28:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29142/opera-optimal-paired-end-read-assembler</link>
	<title><![CDATA[OPERA : Optimal Paired-End Read Assembler]]></title>
	<description><![CDATA[<p>OPERA (Optimal Paired-End Read Assembler) is a sequence assembly program (<a href="http://en.wikipedia.org/wiki/Sequence_assembly">http://en.wikipedia.org/wiki/Sequence_assembly</a>). It uses information from paired-end/mate-pair/long reads to order and orient the intermediate contigs/scaffolds assembled in a genome assembly project, in a process known as Scaffolding. OPERA is based on an exact algorithm that is guaranteed to minimize the discordance of scaffolds with the information provided by the paired-end/mate-pair/long reads (for further details see Gao et al, 2011).</p>
<p>Note that since the original publication, we have made significant changes to OPERA (v1.0 onwards) including refinements to its basic algorithm (to reduce local errors, improve efficiency etc.) and incorporated features that are important for scaffolding large genomes (multi-library support, better repeat-handling etc.), in addition to other scalability and usability improvements (bam and gzip support, smaller memory footprint). We therefore encourage you to download and use our latest version: OPERA-LG. In our benchmarks, it has significantly improved corrected N50 and reduced the number of scaffolding errors. Furthermore, our latest release contains the wrapper script OPERA-long-read that enables scaffolding with long-reads from third-generation sequencing technologies (PacBio or Oxford Nanopore). The manuscript describing the new features and algorithms is available at&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y">Genome Biology</a>. We look forward to getting your feedback to improve it further.</p><p>Address of the bookmark: <a href="https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/" rel="nofollow">https://sourceforge.net/p/operasf/wiki/The%20OPERA%20wiki/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29485/ribbon</guid>
	<pubDate>Fri, 21 Oct 2016 04:54:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29485/ribbon</link>
	<title><![CDATA[Ribbon !!]]></title>
	<description><![CDATA[<p><span>Visualization has played an extremely important role in the current genomic revolution to inspect and understand variants, expression patterns, evolutionary changes, and a number of other relationships. However, most of the information in read-to-reference or genome-genome alignments is lost for structural variations in the one-dimensional views of most genome browsers showing only reference coordinates. Instead, structural variations captured by long reads or assembled contigs often need more context to understand, including alignments and other genomic information from multiple chromosomes. We have addressed this problem by creating Ribbon (genomeribbon.com) an interactive online visualization tool that displays alignments along both reference and query sequences, along with any associated variant calls in the sample. This way Ribbon shows patterns in alignments of many reads across multiple chromosomes, while allowing detailed inspection of individual reads (Supplementary Note 1). For example, here we show a gene fusion in the SK-BR-3 breast cancer cell line linking the genes CYTH1 and EIF3H. While it has been found in the transcriptome previously, genome sequencing did not identify a direct chromosomal fusion between these two genes. After SMRT sequencing, Ribbon shows that there are indeed long reads that span from one gene to the other, going through not one but two variants, for the first time showing the genomic link between these two genes (Figure 1a). More gene fusions of this cancer cell line are investigated in Supplementary Note 2. Figure 1b shows another complex event in this sample made simple in Ribbon: the translocation of a 4.4 kb sequence deleted from chr19 and inserted into chr16 (Figure 1b). Thus, Ribbon enables understanding of complex variants, and it may also help in the detection of sequencing and sample preparation issues, testing of aligners and variant-callers, and rapid curation of structural variant candidates (Supplementary Note 3). In addition to SAM and BAM files with long, short, or paired-end reads, Ribbon can also load coordinate files from whole genome aligners such as MUMmer. Therefore, Ribbon can be used to test assembly algorithms or inspect the similarity between species. Supplementary Note 4 shows a comparison of gorilla and human genomes using Ribbon, highlighting major structural differences. In conclusion, Ribbon is a powerful interactive web tool for viewing complex genomic alignments.</span></p>
<p>Script at&nbsp;https://github.com/MariaNattestad/ribbon</p><p>Address of the bookmark: <a href="http://genomeribbon.com/" rel="nofollow">http://genomeribbon.com/</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</guid>
	<pubDate>Wed, 14 Dec 2016 09:59:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</link>
	<title><![CDATA[Cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite&nbsp;<a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a>&nbsp;.</p>
<p>More at&nbsp;https://github.com/marcelm/cutadapt</p><p>Address of the bookmark: <a href="http://cutadapt.readthedocs.io/en/stable/guide.html" rel="nofollow">http://cutadapt.readthedocs.io/en/stable/guide.html</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30214/megamerge-a-tool-to-merge-assembled-contigs-long-reads-from-metagenomic-sequencing-runs</guid>
	<pubDate>Mon, 19 Dec 2016 09:42:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30214/megamerge-a-tool-to-merge-assembled-contigs-long-reads-from-metagenomic-sequencing-runs</link>
	<title><![CDATA[MeGAMerge: A tool to merge assembled contigs, long reads from metagenomic sequencing runs]]></title>
	<description><![CDATA[<p>MeGAMerge</p>
<p>MeGAMerge (A tool to merge assembled contigs, long reads from metagenomic sequencing runs)</p>
<p>Description</p>
<p>MeGAMerge is a perl based wrapper/tool that can accept any number of sequence (FASTA) files containing assembled contigs of any length in Multi-FASTA format to produce an improved contig set based on OLC based assembly. All overlap parameters (Minimum Overlap Length, Identity, etc) are user-declarable at runtime. It is written to run on Linux.</p>
<p>Requirements:</p>
<p>You will need to have the following tools installed and in $PATH, or added to $binpath in the tool:</p>
<p>Newbler (specifically runAssembly)<br>Minimus2 (part of AMOS, also requires MUMmer)</p><p>Address of the bookmark: <a href="https://github.com/LANL-Bioinformatics/MeGAMerge" rel="nofollow">https://github.com/LANL-Bioinformatics/MeGAMerge</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</guid>
	<pubDate>Mon, 09 Jul 2018 05:20:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</link>
	<title><![CDATA[ASAR: Advanced metagenomic Sequence Analysis in R]]></title>
	<description><![CDATA[<p><span>An interactive data analysis tool for selection, aggregation and visualization of metagenomic data is presented. Functional analysis with a SEED hierarchy and pathway diagram based on KEGG orthology based upon MG-RAST annotation results is available.</span></p>
<p><span><span>To read the manual, please click the link&nbsp;</span><a href="https://askarbek-orakov.github.io/ASAR/">https://askarbek-orakov.github.io/ASAR/</a></span></p><p>Address of the bookmark: <a href="https://github.com/Askarbek-orakov/ASAR" rel="nofollow">https://github.com/Askarbek-orakov/ASAR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/40228/bioinformatics-services-cro-services</guid>
	<pubDate>Wed, 06 Nov 2019 00:33:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/40228/bioinformatics-services-cro-services</link>
	<title><![CDATA[Bioinformatics Services / CRO Services]]></title>
	<description><![CDATA[<p>RASA is set to provide premium technical and scientific services in a form of solutions, product development and training. .We are also very proficient in providing the high quality Research &amp; Development services in life science informatics field like Next Generation Sequencing (NGS) Data Analysis,Computational Drug Discovery, Bioinformatics, Chemo-informatics and BIO-IT.</p><p>RASA offers faster, better and cost effective cutting edge technology solutions to chemical and life science research and industry. We provide our customers with A seamless model of wide expertise and comprehensive platforms. Our Value is to take our customers</p>]]></description>
	<dc:creator>RASA Life Sciences</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39441/snakepipes-a-toolkit-based-on-snakemake-and-python-for-analysis-of-ngs-data</guid>
	<pubDate>Thu, 30 May 2019 04:06:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39441/snakepipes-a-toolkit-based-on-snakemake-and-python-for-analysis-of-ngs-data</link>
	<title><![CDATA[snakepipes: A toolkit based on snakemake and python for analysis of NGS data]]></title>
	<description><![CDATA[<p><span><span>snakePipes are flexible and powerful workflows built using&nbsp;</span><a href="https://github.com/maxplanck-ie/snakepipes/blob/master/snakemake.readthedocs.io">snakemake</a><span>&nbsp;that simplify the analysis of NGS data.</span></span></p>
<ul>
<li>DNA-mapping*</li>
<li>ChIP-seq*</li>
<li>RNA-seq*</li>
<li>ATAC-seq*</li>
<li>scRNA-seq</li>
<li>Hi-C</li>
<li>Whole Genome Bisulfite Seq/WGBS</li>
</ul>
<p><span>(*Also available in "allele-specific" mode)</span></p>
<p><span>snakePipes can be installed via conda : </span></p>
<p><span>'conda install -c mpi-ie -c bioconda -c conda-forge snakePipes'. </span></p>
<p><span>Source code (</span><a href="https://github.com/maxplanck-ie/snakepipes" target="">https://github.com/maxplanck-ie/snakepipes</a><span>) and documentation (</span><a href="https://snakepipes.readthedocs.io/en/latest/" target="">https://snakepipes.readthedocs.io/en/latest/</a><span>) are available online.</span></p><p>Address of the bookmark: <a href="https://github.com/maxplanck-ie/snakepipes" rel="nofollow">https://github.com/maxplanck-ie/snakepipes</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>