<?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/27438?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/27438?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29343/accnet</guid>
	<pubDate>Fri, 07 Oct 2016 05:22:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29343/accnet</link>
	<title><![CDATA[AccNET]]></title>
	<description><![CDATA[<p><span>AccNET is a Perl application that presents a new way to study the accessory genome of a given set of organisms. Using the proteomes of these organisms, AccNET create a bipartite network compatible with common network analysis platforms. AccNET collects phylogenetic and functional information in a network improving the analysis capability. Networks offer a new perspective of organism organization through elements acquired by horizontal gene transfers and not constricted by hierarchical structures.</span></p>
<p><span>More at&nbsp;https://www.youtube.com/watch?v=vdGuy1GAJrQ</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/accnet/" rel="nofollow">https://sourceforge.net/projects/accnet/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29235/valet</guid>
	<pubDate>Thu, 22 Sep 2016 04:27:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29235/valet</link>
	<title><![CDATA[valet]]></title>
	<description><![CDATA[<div>
<div>
<div>VALET is a pipeline for performing&nbsp;<em>de novo</em>&nbsp;validation of metagenomic assemblies. VALET checks a number of properties that should hold true for a correct assembly (e.g., mate-pairs are aligned at the correct distance from each other in the assembly, the depth of coverage is fairly uniform along contigs, etc.). The violations of these invariants are reported allowing one to pinpoint areas that were potentially mis-assembled, or to compare the quality of different assemblies. For comparing multiple assemblies of the same data-sets, VALET also reports an overall estimate of the likelihood a particular assembly is correct.</div>
</div>
</div>
<div>
<div>Home Page:&nbsp;</div>
<div>
<div><a href="https://github.com/jgluck/VALET">VALET code repository</a></div>
</div>
</div><p>Address of the bookmark: <a href="https://www.cbcb.umd.edu/software/valet" rel="nofollow">https://www.cbcb.umd.edu/software/valet</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</guid>
	<pubDate>Thu, 18 Aug 2016 09:57:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</link>
	<title><![CDATA[RepeatModeler]]></title>
	<description><![CDATA[<p><span>RepeatModeler is a de-novo repeat family identification and modeling package. At the heart of RepeatModeler are two de-novo repeat finding programs ( RECON and RepeatScout ) which employ complementary computational methods for identifying repeat element boundaries and family relationships from sequence data. RepeatModeler assists in automating the runs of RECON and RepeatScout given a genomic database and uses the output to build, refine and classify consensus models of putative interspersed repeats.</span></p><p>Address of the bookmark: <a href="http://www.repeatmasker.org/RepeatModeler.html" rel="nofollow">http://www.repeatmasker.org/RepeatModeler.html</a></p>]]></description>
	<dc:creator>Jit</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/28997/braker-pipeline-for-fully-automated-prediction-of-protein-coding-genes-with-genemark-eset-and-augustus-in-novel-eukaryotic-genomes</guid>
	<pubDate>Thu, 01 Sep 2016 08:02:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28997/braker-pipeline-for-fully-automated-prediction-of-protein-coding-genes-with-genemark-eset-and-augustus-in-novel-eukaryotic-genomes</link>
	<title><![CDATA[BRAKER: pipeline for fully automated prediction of protein coding genes with GeneMark-ES/ET and AUGUSTUS in novel eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Gene finding in eukaryotic genomes is notoriously difficult to automate. The task is to design a work flow with a minimal set of tools that would reach state-of-the-art performance across a wide range of species. GeneMark-ET is a gene prediction tool that incorporates RNA-Seq data into unsupervised training and subsequently generates ab initio gene predictions. AUGUSTUS is a gene finder that usually requires supervised training and uses information from RNA-Seq reads in the prediction step. Complementary strengths of GeneMark-ET and AUGUSTUS provided motivation for designing a new combined tool for automatic gene prediction.</span></p>
<p>http://www.ncbi.nlm.nih.gov/pubmed/26559507</p><p>Address of the bookmark: <a href="http://bioinf.uni-greifswald.de/bioinf/braker/" rel="nofollow">http://bioinf.uni-greifswald.de/bioinf/braker/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</guid>
	<pubDate>Thu, 26 Jul 2018 04:51:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</link>
	<title><![CDATA[Nanopolis: polish a genome assembly]]></title>
	<description><![CDATA[<p><span>Software package for signal-level analysis of Oxford Nanopore sequencing data. Nanopolish can calculate an improved consensus sequence for a draft genome assembly, detect base modifications, call SNPs and indels with respect to a reference genome and more (see Nanopolish modules, below).</span></p>
<p>Quickstart</p>
<p>http://nanopolish.readthedocs.io/en/latest/quickstart_consensus.html</p>
<p>Algorithms</p>
<p>http://simpsonlab.github.io/2017/06/30/nanopolish-v0.7.0/</p><p>Address of the bookmark: <a href="https://github.com/jts/nanopolish" rel="nofollow">https://github.com/jts/nanopolish</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</guid>
	<pubDate>Mon, 05 Sep 2016 09:50:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</link>
	<title><![CDATA[NGS Tutorial]]></title>
	<description><![CDATA[<p><span>These tutorials are written for hundreds of bioinformaticians trying to cope with large volume of next-generation sequencing (NGS) data. NGS technologies brought a dramatic shift in the world of sequencing. Merely five years back, genome sequencing of higher eukaryotes used to be very expensive endeavor. To get a genome of interest sequenced, hundreds of scientists had to raise funds together by writing a joint white-paper and petitioning to various government agencies. The tasks of sequencing and assembly were handled by dedicated sequencing facilities, of which only a few existed around the globe. Naturally, the capacities at those sequencing facilities were significantly constrained from high volume of requests</span></p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/index.php" rel="nofollow">http://www.homolog.us/Tutorials/index.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/blog/view/38618/canu-genome-assembly-parameters</guid>
	<pubDate>Mon, 07 Jan 2019 08:40:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38618/canu-genome-assembly-parameters</link>
	<title><![CDATA[CANU genome assembly parameters !]]></title>
	<description><![CDATA[<p>Choose the appropriate parameters to run Canu and run it. The assembly will take about an hour. You can use two cores (parameter&nbsp;<code>-maxThreads=2</code>) and you would like to disable cluster option, since we compute on a single Amazon server set off the option to compute on cluster&nbsp;<code>useGrid=false</code>. This specifications should be for your project discussed with a local computing guru. The parameters that are in square brackets&nbsp;<code>[]</code>&nbsp;are optional, symbol&nbsp;<code>|</code>&nbsp;stands for "or".</p><pre><code>usage:   canu [-correct | -trim | -assemble | -trim-assemble] \
              [-s ] \
               -p  \
               -d  \
               genomeSize=[g|m|k] \
               -maxThreads=2 \
               useGrid=false \
              [other-options] \
               read_file.fastq.gz
</code></pre><p>A default&nbsp;<code>Canu</code>&nbsp;run produces usually high quality assembly, example of a command that was used for testing can be found below. However, there are still a lot of parameters that are possible to tweak. For example if we desire to assemble haplotypes separately of if we want to smash them together, we can alternate the error correction process.</p><pre><code>canu -p test_asmbl \
     -d asm_test3 \
     genomeSize=2m \
     -maxThreads=2 useGrid=false \
     -pacbio-raw \ ~/pacbio/dna/sample_reads.fastq.gz</code></pre><p>There is a brilliant&nbsp;<a href="http://canu.readthedocs.io/en/latest/faq.html#what-parameters-can-i-tweak">section in documentation</a>&nbsp;about parameter tweaking.</p><p>The output directory contains will contain many files. The most interesting ones are:</p><ul>
<li><code>*.correctedReads.fasta.gz</code>&nbsp;: file containing the input sequences after correction, trim and split based on consensus evidence.</li>
<li><code>*.trimmedReads.fastq</code>&nbsp;: file containing the sequences after correction and final trimming</li>
<li><code>*.layout</code>&nbsp;: file containing informations about read inclusion in the final assembly</li>
<li><code>*.gfa</code>&nbsp;: file containing the assembly graph by Canu</li>
<li><code>*.contigs.fasta</code>&nbsp;: file containing everything that could be assembled and is part of the primary assembly</li>
</ul><p>The basic stats of assembly can be read from reports generated by the assembler, or calculated using standard UNIX command line tools.</p><p>More at&nbsp;https://canu.readthedocs.io/en/latest/faq.html</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29284/genebreak-a-tool-to-systematically-identify-genes-recurrently-affected-by-the-genomic-location-of-chromosomal-cna-associated-breaks-by-a-genome-wide-approach</guid>
	<pubDate>Sat, 01 Oct 2016 15:15:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29284/genebreak-a-tool-to-systematically-identify-genes-recurrently-affected-by-the-genomic-location-of-chromosomal-cna-associated-breaks-by-a-genome-wide-approach</link>
	<title><![CDATA[GeneBreak: a tool to systematically identify genes recurrently affected by the genomic location of chromosomal CNA-associated breaks by a genome-wide approach]]></title>
	<description><![CDATA[<p>Development of cancer is driven by somatic alterations, including numerical and structural chromosomal aberrations. Currently, several computational methods are available and are widely applied to detect numerical copy number aberrations (CNAs) of chromosomal segments in tumor genomes. However, there is lack of computational methods that systematically detect structural chromosomal aberrations by virtue of the genomic location of CNA-associated chromosomal breaks and identify genes that appear non-randomly affected by chromosomal breakpoints across (large) series of tumor samples. ‘GeneBreak’ is developed to systematically identify genes recurrently affected by the genomic location of chromosomal CNA-associated breaks by a genome-wide approach, which can be applied to DNA copy number data obtained by array-Comparative Genomic Hybridization (CGH) or by (low-pass) whole genome sequencing (WGS). First, ‘GeneBreak’ collects the genomic locations of chromosomal CNA-associated breaks that were previously pinpointed by the segmentation algorithm that was applied to obtain CNA profiles. Next, a tailored annotation approach for breakpoint-to-gene mapping is implemented. Finally, dedicated cohort-based statistics is incorporated with correction for covariates that influence the probability to be a breakpoint gene. In addition, multiple testing correction is integrated to reveal recurrent breakpoint events. This easy-to-use algorithm, ‘GeneBreak’, is implemented in R (www.cran.r-project.org) and is available from Bioconductor (www.bioconductor.org/packages/release/bioc/html/GeneBreak.html).</p>
<p> </p><p>Address of the bookmark: <a href="http://www.bioconductor.org/packages/release/bioc/html/GeneBreak.html" rel="nofollow">http://www.bioconductor.org/packages/release/bioc/html/GeneBreak.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>