<?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: All site bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/all?offset=870</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=870" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 10:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34398/ont-assembly-and-illumina-polishing-pipeline</link>
	<title><![CDATA[ONT assembly and Illumina polishing pipeline]]></title>
	<description><![CDATA[<p>This pipeline performs the following steps:</p>
<ul>
<li>Assembly of nanopore reads using&nbsp;<a href="http://canu.readthedocs.io/">Canu</a>.</li>
<li>Polish canu contigs using&nbsp;<a href="https://github.com/isovic/racon">racon</a>&nbsp;(<em>optional</em>).</li>
<li>Map a paired-end Illumina dataset onto the contigs obtained in the previous steps using&nbsp;<a href="http://bio-bwa.sourceforge.net/">BWA</a>&nbsp;mem.</li>
<li>Perform correction of contigs using&nbsp;<a href="https://github.com/broadinstitute/pilon/wiki">pilon</a>&nbsp;and the Illumina dataset.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/nanoporetech/ont-assembly-polish" rel="nofollow">https://github.com/nanoporetech/ont-assembly-polish</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</guid>
	<pubDate>Thu, 23 Nov 2017 09:55:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</link>
	<title><![CDATA[poRe: an R package for the visualization and analysis of nanopore sequencing data]]></title>
	<description><![CDATA[<p><strong>Motivation:</strong>&nbsp;The Oxford Nanopore MinION device represents a unique sequencing technology. As a mobile sequencing device powered by the USB port of a laptop, the MinION has huge potential applications. To enable these applications, the bioinformatics community will need to design and build a suite of tools specifically for MinION data.</p>
<p><strong>Results:</strong>&nbsp;Here we present poRe, a package for R that enables users to manipulate, organize, summarize and visualize MinION nanopore sequencing data. As a package for R, poRe has been tested on Windows, Linux and MacOSX. Crucially, the Windows version allows users to analyse MinION data on the Windows laptop attached to the device.</p>
<p><strong>Availability and implementation:</strong>&nbsp;poRe is released as a package for R at&nbsp;<a href="http://sourceforge.net/projects/rpore/" target="">http://sourceforge.net/projects/rpore/</a>&nbsp;. A tutorial and further information are available at&nbsp;<a href="https://sourceforge.net/p/rpore/wiki/Home/" target="">https://sourceforge.net/p/rpore/wiki/Home/</a></p>
<p><strong>Contact:</strong><a href="mailto:mick.watson@roslin.ed.ac.uk" target="">mick.watson@roslin.ed.ac.uk</a></p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/1/114/2365693" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/1/114/2365693</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 09:30:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</link>
	<title><![CDATA[TULIP - The Uncorrected Long read Itegration Pipeline]]></title>
	<description><![CDATA[<p>#Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel)</p>
<p>TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.&nbsp;<br>Tulipseed takes as input alignments files of long reads to sparse short seeds, and outputs a graph and scaffold structures. Tulipbulb adds long read sequencing data to these.</p>
<p>&nbsp;</p>
<p>https://github.com/Generade-nl/TULIP</p><p>Address of the bookmark: <a href="https://github.com/Generade-nl/TULIP" rel="nofollow">https://github.com/Generade-nl/TULIP</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</guid>
	<pubDate>Thu, 23 Nov 2017 08:37:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</link>
	<title><![CDATA[Taxoblast : Taxoblast is a pipeline to identify contamination in genomic sequence]]></title>
	<description><![CDATA[<p><span>Modern genome sequencing strategies are highly sensitive to contamination making the detection of foreign DNA sequences an important part of analysis pipelines. Here we use Taxoblast, a simple pipeline with a graphical user interface, for the post-assembly detection of contaminating sequences in the published genome of the kelp&nbsp;</span><em>Saccharina japonica</em><span>. Analyses were based on multiple blastn searches with short sequence fragments. They revealed a number of probable bacterial contaminations as well as hybrid scaffolds that contain both bacterial and algal sequences. This or similar types of analysis, in combination with manual curation, may thus constitute a useful complement to standard bioinformatics analyses prior to submission of genomic data to public repositories. Our analysis pipeline is open-source and freely available at&nbsp;</span><a href="http://sdittami.altervista.org/taxoblast" title="">http://sdittami.altervista.org/taxoblast</a><span>&nbsp;and via SourceForge (</span><a href="https://sourceforge.net/projects/taxoblast" title="">https://sourceforge.net/projects/taxoblast</a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/taxoblast/files/" rel="nofollow">https://sourceforge.net/projects/taxoblast/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34386/slidesort-bpr</guid>
	<pubDate>Mon, 20 Nov 2017 09:19:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34386/slidesort-bpr</link>
	<title><![CDATA[SLIDESORT-BPR]]></title>
	<description><![CDATA[<p>Chromosomal rearrangement events are caused by abnormal breaking and rejoining of DNA molecules. They are responsible for many of the cancer related diseases. Detecting the DNA breaking and repairing mechanism, therefore, may offer vital clues about the pathologic causes and diagnostic/therapeutic target of these diseases. But this effort also poses considerable challenges, because the structural variations and the genomes are different from one person to another. Intermediate comparison via reference genome could lead to the loss information. Unlike the current methods which make use the reference genome, we developed a method to detect the breakpoint reads directly from observing the differences between two (or more) NGS short reads samples. Slidesort-BPR is a command line tool implemented in C++.</p><p>Address of the bookmark: <a href="https://github.com/ewijaya/slidesort-bpr" rel="nofollow">https://github.com/ewijaya/slidesort-bpr</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34383/discosnp</guid>
	<pubDate>Mon, 20 Nov 2017 06:39:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34383/discosnp</link>
	<title><![CDATA[DiscoSnp]]></title>
	<description><![CDATA[<p><span>DiscoSnp is designed for discovering all kinds of SNPs (not only isolated ones), as well as insertions and deletions, from raw set(s) of reads. The number of input read sets is not constrained, it can be one, two, or more. No reference genome is needed.</span></p><p>Address of the bookmark: <a href="https://github.com/GATB/DiscoSnp" rel="nofollow">https://github.com/GATB/DiscoSnp</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</guid>
	<pubDate>Sat, 18 Nov 2017 16:55:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</link>
	<title><![CDATA[CHSMiner: a GUI tool to identify chromosomal homologous segments]]></title>
	<description><![CDATA[<div id="ASec1">
<h3>Background</h3>
<p>The identification of chromosomal homologous segments (CHS) within and between genomes is essential for comparative genomics. Various processes including insertion/deletion and inversion could cause the degeneration of CHSs.</p>
</div>
<div id="ASec2">
<h3>Results</h3>
<p>Here we present a Java software CHSMiner that detects CHSs based on shared gene content alone. It implements fast greedy search algorithm and rigorous statistical validation, and its friendly graphical interface allows interactive visualization of the results. We tested the software on both simulated and biological realistic data and compared its performance with similar existing software and data source.</p>
</div>
<div id="ASec3">
<h3>Conclusion</h3>
<p>CHSMiner is characterized by its integrated workflow, fast speed and convenient usage. It will be useful for both experimentalists and bioinformaticians interested in the structure and evolution of genomes.</p>
<p>&nbsp;</p>
<p>https://github.com/zhenwang100/CHSMiner</p>
</div><p>Address of the bookmark: <a href="https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2" rel="nofollow">https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p><p>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</guid>
	<pubDate>Tue, 14 Nov 2017 10:26:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</link>
	<title><![CDATA[DFAST: a flexible prokaryotic genome annotation pipeline for faster genome publication]]></title>
	<description><![CDATA[<p>We developed a prokaryotic genome annotation pipeline, DFAST, that also supports genome submission to public sequence databases. DFAST was originally started as an on-line annotation server, and to date, over 7,000 jobs have been processed since its first launch in 2016. Here, we present a newly implemented background annotation engine for DFAST, which is also available as a standalone command-line program. The new engine can annotate a typical-sized bacterial genome within 10 minutes, with rich information such as pseudogenes, translation exceptions, and orthologous gene assignment between given reference genomes. In addition, the modular framework of DFAST allows users to customize the annotation workflow easily and will also facilitate extensions for new functions and incorporation of new tools in the future.</p>
<div>Availability and Implementation</div>
<p>The software is implemented in Python 3 and runs in both Python 2.7 and 3.4&ndash; on Macintosh and Linux systems. It is freely available at&nbsp;<a href="https://github.com/nigyta/dfast_core/" target="">https://github.com/nigyta/dfast_core/</a>&nbsp;under the GPLv3 license with external binaries bundled in the software distribution. An on-line version is also available at&nbsp;<a href="https://dfast.nig.ac.jp/" target="">https://dfast.nig.ac.jp/</a>.</p><p>Address of the bookmark: <a href="https://dfast.nig.ac.jp/" rel="nofollow">https://dfast.nig.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</guid>
	<pubDate>Tue, 14 Nov 2017 09:30:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34324/orthognc-a-software-for-accurate-identification-of-orthologs-based-on-gene-neighborhood-conservation</link>
	<title><![CDATA[OrthoGNC: A Software for Accurate Identification of Orthologs Based on Gene Neighborhood Conservation]]></title>
	<description><![CDATA[<div>
<p id="sp0005">Orthology relations can be used to transfer annotations from one gene (or protein) to another. Hence, detecting orthology relations has become an important task in the post-genomic era. Various genomic events, such as duplication and horizontal gene transfer, can cause erroneous assignment of orthology relations. In closely-related species, gene neighborhood information can be used to resolve many ambiguities in orthology inference. Here we present OrthoGNC, a software for accurately predicting pairwise orthology relations based on gene neighborhood conservation. Analyses on simulated and real data reveal the high accuracy of OrthoGNC. In addition to orthology detection, OrthoGNC can be employed to investigate the conservation of genomic context among potential orthologs detected by other methods. OrthoGNC is freely available online at http://bs.ipm.ir/softwares/orthognc and http://tinyurl.com/orthoGNC.</p>
<p>http://www.comp.nus.edu.sg/~wongls/projects/orthoGNC/</p>
</div><p>Address of the bookmark: <a href="http://www.sciencedirect.com/science/article/pii/S1672022917301663" rel="nofollow">http://www.sciencedirect.com/science/article/pii/S1672022917301663</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>