<?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: Rahul Nayak's bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/owner/rahul?offset=80</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/owner/rahul?offset=80" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35294/httdb-horizontally-transferred-transposable-elements-database</guid>
	<pubDate>Tue, 23 Jan 2018 12:07:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35294/httdb-horizontally-transferred-transposable-elements-database</link>
	<title><![CDATA[HTTDB - Horizontally transferred transposable elements database]]></title>
	<description><![CDATA[<p><span>Transposons or Transposable elements (TEs) are "mobile genes" capable of mobilization from one genomic location to another through non-homologous recombination. As this movement is mediated by its own proteins and does not contribute to the survival of the host that it inhabits, they are known as selfish genomic parasites. Despite their capacity for transposition inside genomes, they can frequently transpose the species boundaries and consequently migrate from one species to another. Such phenomenon is called Horizontal Transposons Transfer. HTT was first discovered by Daniels et al. (1984) when analysing a&nbsp;</span><em>P</em><span>&nbsp;element that was transferred from&nbsp;</span><em>Drosophila willistoni</em><span>&nbsp;to&nbsp;</span><em>D. melanogaster</em><span>. Since then, many more cases have been documented in the literature. Moreover, in the last years, such discoveries have been boosted by the unprecedented amount of new genomes available. Despite the recognition of HTT as a common phenomenon in recent years, it is still difficult to draw major conclusions about HTT patterns, such as where in the tree of life these cases are more frequently found. This is mainly due to the historical bias and lack of studies in many taxa. To date, there has been no easy way to visualise each TE or host species, and should be further analysed in order to provide a more comprehensive view of such phenomena. Based on these concerns, we developed the HTT database to keep an updated repository of HTT events in all eukaryotes, allowing not only TE specialists to add new events and search the database, but also non-specialists. Moreover, we expanded the database to include Horizontal-Virus Transfer also known as endogenization events which is characterized by the stable integration a viral genomic fragment into the host genome.</span></p>
<p><span>https://www.ncbi.nlm.nih.gov/pubmed/29315358</span></p><p>Address of the bookmark: <a href="http://lpa.saogabriel.unipampa.edu.br:8080/httdatabase/" rel="nofollow">http://lpa.saogabriel.unipampa.edu.br:8080/httdatabase/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35292/pgap-x-extension-on-pan-genome-analysis-pipeline</guid>
	<pubDate>Tue, 23 Jan 2018 11:41:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35292/pgap-x-extension-on-pan-genome-analysis-pipeline</link>
	<title><![CDATA[PGAP-X: Extension on pan-genome analysis pipeline]]></title>
	<description><![CDATA[<p>PGAP-X is a microbial comparative genomic analysis platform with graphic interface. Serials of algorithms and methodologies have been developed and integrated to analyze and visualize genomics structure variation, gene distribution with different conservative levels, and genetic variation from pan-genome sight. At the same time, analytical result data from many other programs, including genome alignment result and orthologs clusters, are also supported to be further analyzed or visualized in PGAP-X. The workflow and feature snapshot in PGAP-X were shown as Fig.1 and Fig.2.</p>
<div><img src="https://pgapx.ybzhao.com/image/f1.jpg" alt="image" style="border: 0px; border: 0px;"></div>
<div>&nbsp;</div>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://pgapx.ybzhao.com/" rel="nofollow">https://pgapx.ybzhao.com/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34925/rectangle-graph-for-repeat-resolution-in-genome-assembly</guid>
	<pubDate>Thu, 28 Dec 2017 09:43:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34925/rectangle-graph-for-repeat-resolution-in-genome-assembly</link>
	<title><![CDATA[Rectangle Graph for Repeat Resolution in Genome Assembly]]></title>
	<description><![CDATA[<p>Ultimate tool for resolving repeats in genome assemblies.</p>
<p>Though the specific implementation of the idea of the rectangle graph approach is already included into the&nbsp;<a href="http://bioinf.spbau.ru/spades">current SPAdes distribution</a>, we're also releasing the Rectangle Graph Module (RGM) as the separate code which can be run independently of SPAdes. Although RGM differs from the current implementation of the rectangle graph approach in SPAdes, in the future we plan to integrate RGM in SPAdes. RGM can be run with other genome assemblers if they use the graph format as SPAdes files.</p>
<p>For more details see: Nikolay Vyahhi, Son K. Pham, Pavel Pevzner.&nbsp;<a href="http://www.springerlink.com/content/e617788h25u36440/">From de Bruijn Graphs to Rectangle Graphs for Genome Assembly</a>,&nbsp;<em>Lecture Notes in Bioinformatics</em>&nbsp;7534 (2012), pp. 249-261.</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/en/rectangles" rel="nofollow">http://bioinf.spbau.ru/en/rectangles</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</guid>
	<pubDate>Thu, 28 Dec 2017 09:10:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</link>
	<title><![CDATA[CAMSA :: a tool for Comparative Analysis and Merging of Scaffold Assemblies]]></title>
	<description><![CDATA[<p>CAMSA &ndash; is a tool for&nbsp;<span>C</span>omparative&nbsp;<span>A</span>nalysis and&nbsp;<span>M</span>erging of&nbsp;<span>S</span>caffold&nbsp;<span>A</span>ssemblies, distributed both as a standalone software package and as Python library under the MIT license.</p>
<p>Main features:</p>
<ol>
<li>works with any number of scaffold assemblies in de-novo non-progressive fashion</li>
<li>allows to simultaneously work with scaffold assemblies obtained from any&nbsp;<em>in silico</em>&nbsp;and&nbsp;<em>in vitro</em>&nbsp;techniques, supporting multiple existing formats via built-in converters</li>
<li>creates an extensive report with several comparative quality metrics (both on assembly level and on the level of individual assembly points)</li>
<li>constructs a merged combined scaffold assembly</li>
<li>provides an interactive framework for a visual comparative analysis of the given assemblies</li>
</ol><p>Address of the bookmark: <a href="https://cblab.org/camsa/" rel="nofollow">https://cblab.org/camsa/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34920/xmatchview-smith-waterman-alignment-visualization</guid>
	<pubDate>Thu, 28 Dec 2017 09:00:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34920/xmatchview-smith-waterman-alignment-visualization</link>
	<title><![CDATA[xmatchview: smith-waterman alignment visualization]]></title>
	<description><![CDATA[<p><span>xmatchview and xmatchview-conifer are imaging tools for comparing the synteny between DNA sequences. It allows users to align 2 DNA sequences in fasta format using cross_match and displays the alignment in a variety of image formats. xmatchview and xmatchview-conifer are written in python and run on linux and windows. They serve as visual tools for analyzing cross_match alignments. Cross_match (Green, P. (1994)&nbsp;</span><a href="http://www.phrap.org/">http://www.phrap.org</a><span>) uses an implementation of the Smith-Waterman algorithm for comparing DNA sequences that is sensitive.</span></p>
<p><span>http://www.bcgsc.ca/platform/bioinfo/software/xmatchview</span></p><p>Address of the bookmark: <a href="https://github.com/warrenlr/xmatchview" rel="nofollow">https://github.com/warrenlr/xmatchview</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34585/r-googlevis-examples</guid>
	<pubDate>Sun, 10 Dec 2017 06:13:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34585/r-googlevis-examples</link>
	<title><![CDATA[R googleVis examples]]></title>
	<description><![CDATA[<p>It may take a little while to load all charts. Please be patient. All charts require an Internet connection.</p>
<p>These examples are taken from the googleVis demo. You can execute the demo via</p>
<pre><code><span>library</span><span>(</span><span>googleVis</span><span>)</span>
<span>demo</span><span>(</span><span>googleVis</span><span>)</span>
</code></pre>
<p>For more details about the charts and further examples see the helpfiles of the individual googleVis function and review the&nbsp;<a href="https://developers.google.com/chart/interactive/docs/gallery">Google Charts API documentation</a>&nbsp;and&nbsp;<a href="https://developers.google.com/terms">Terms of Service</a>.</p><p>Address of the bookmark: <a href="https://cran.r-project.org/web/packages/googleVis/vignettes/googleVis_examples.html" rel="nofollow">https://cran.r-project.org/web/packages/googleVis/vignettes/googleVis_examples.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</guid>
	<pubDate>Sat, 02 Dec 2017 18:25:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34501/dnapipete-de-novo-assembly-annotation-pipeline-for-transposable-elements</link>
	<title><![CDATA[dnaPipeTE: de-novo assembly &amp; annotation Pipeline for Transposable Elements]]></title>
	<description><![CDATA[<p>dnaPipeTE (for de-novo assembly &amp; annotation Pipeline for Transposable Elements), is a pipeline designed to find, annotate and quantify Transposable Elements in small samples of NGS datasets. It is very useful to quantify the proportion of TEs in newly sequenced genomes since it does not require genome assembly and works on small datasets (&lt; 1X).</p>
<ul>
<li>
<p>dnaPipeTE is developped by Cl&eacute;ment Goubert, Laurent Modolo and the TREEP team of the LBBE:&nbsp;<a href="http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en">http://lbbe.univ-lyon1.fr/-Equipe-Elements-transposables-.html?lang=en</a></p>
</li>
<li>
<p>You can find the original publication in GBE here:&nbsp;<a href="https://academic.oup.com/gbe/article/7/4/1192/533768">https://academic.oup.com/gbe/article/7/4/1192/533768</a></p>
</li>
</ul>
<p><a href="https://github.com/clemgoub/dnaPipeTE/blob/dev/dnaPipefront.png" target="_blank"><img src="https://github.com/clemgoub/dnaPipeTE/raw/dev/dnaPipefront.png" alt="Front" style="border: 0px;"></a><em>output examples of quantification and TE landscape (relative age) produced by dnaPipeTE</em></p>
<p><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://github.com/clemgoub/dnaPipeTE" rel="nofollow">https://github.com/clemgoub/dnaPipeTE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Mon, 13 Nov 2017 05:10:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[<p><span>Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data</span><br><code>AfterQC</code><span>&nbsp;can simply go through all fastq files in a folder and then output three folders:&nbsp;</span><span>good</span><span>,&nbsp;</span><span>bad</span><span>&nbsp;and&nbsp;</span><span>QC</span><span>&nbsp;folders, which contains good reads, bad reads and the QC results of each fastq file/pair.</span><br><span>Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other&nbsp;</span><a href="http://support.illumina.com/help/SequencingAnalysisWorkflow/Content/Vault/Informatics/Sequencing_Analysis/CASAVA/swSEQ_mCA_FASTQFiles.htm">Illumina 1.8 or newer formats</a></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34041/r-tuorial</guid>
	<pubDate>Mon, 31 Jul 2017 08:41:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34041/r-tuorial</link>
	<title><![CDATA[R tuorial]]></title>
	<description><![CDATA[<p>R learning resources</p>
<p>https://flowingdata.com/</p><p>Address of the bookmark: <a href="https://flowingdata.com/" rel="nofollow">https://flowingdata.com/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>