<?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/30701?offset=550</link>
	<atom:link href="https://bioinformaticsonline.com/related/30701?offset=550" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</guid>
	<pubDate>Fri, 10 Nov 2017 03:58:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</link>
	<title><![CDATA[Unicycler: Hybrid assembly pipeline for bacterial genomes]]></title>
	<description><![CDATA[<p><span>Unicycler is an assembly pipeline for bacterial genomes. It can assemble&nbsp;</span><a href="http://www.illumina.com/">Illumina</a><span>-only read sets where it functions as a&nbsp;</span><a href="http://cab.spbu.ru/software/spades/">SPAdes</a><span>-optimiser. It can also assembly long-read-only sets (</span><a href="http://www.pacb.com/">PacBio</a><span>&nbsp;or&nbsp;</span><a href="https://nanoporetech.com/">Nanopore</a><span>) where it runs a&nbsp;</span><a href="https://github.com/lh3/miniasm">miniasm</a><span>+</span><a href="https://github.com/isovic/racon">Racon</a><span>&nbsp;pipeline. For the best possible assemblies, give it both Illumina reads&nbsp;</span><em>and</em><span>&nbsp;long reads, and it will conduct a hybrid assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/rrwick/Unicycler" rel="nofollow">https://github.com/rrwick/Unicycler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</guid>
	<pubDate>Mon, 13 Feb 2017 08:40:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</link>
	<title><![CDATA[fineSTRUCTURE v2 &amp; GLOBETROTTER]]></title>
	<description><![CDATA[<p>Software available at this site</p>
<div>
<ul>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure_info.html">FineSTRUCTURE version 2</a>, a pipeline for running ChromoPainter and FineSTRUCTURE for population inference. A GUI is available for interpretation. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructureR.html">FineSTRUCTURE R scripts</a>, a facility for exploring the results when the GUI is unavailable.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/globetrotter.html">GLOBETROTTER</a>, the admixture dating method based on ChromoPainter. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/admixture.html">AdmixturePainting</a>, A set of R tools to inmterpret the results of ADMIXTURE and STRUCTURE-like mixture models.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/radpainter.html">RADpainter</a>, finestructure and ChromoPainter for RAD tag data used for non-model organisms.</li>
<li>Scripts to perform many types of conversion. Included in the main software download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
</ul>
What this page is This page provides information about and downloads for <strong>methodology for Chromosome Painting</strong>. It is not a facility to analyse your genome. Sorry if you were misled by the punchy name!<br> About Chromosome Painting Painting is an efficient way of identifying important haplotype information from dense genotype data. It describes ancestry in an efficient way suitable for a range of further analyses, including population identification and admixture dating.</div><p>Address of the bookmark: <a href="http://paintmychromosomes.com/" rel="nofollow">http://paintmychromosomes.com/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31123/biodownloader</guid>
	<pubDate>Sat, 25 Feb 2017 17:52:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31123/biodownloader</link>
	<title><![CDATA[BioDownloader]]></title>
	<description><![CDATA[<p><strong><em>BioDownloader</em></strong> is a program for downloading and/or updating files from ftp/http servers. The program has unique features that are specifically designed to deal with bioinformatics data files and servers:</p>
<ul>
<li>optimized to work with vast amount of data and very large file sets (~ 10,000 - 100,000).</li>
<li>allows the selective retrieval of only the required files (file masks, ls-lR parsing, recursive search, updates)</li>
<li>has a built-in repository containing the settings for the most common bioinformatics download needs</li>
<li>built-in wizard for batch post-processing of downloaded files (archive extraction, file conversion, etc.)</li>
<li>capable of performing multiple download or update tasks simultaneously</li>
</ul>
<p>BioDownloader has a built-in repository containing the settings for common bioinformatics file-synchronization needs, including the Protein Data Bank (PDB) and National Center for Biotechnology Information (NCBI) databases. It can post-process downloaded files, including archive extraction and file conversions.</p>
<p>http://dunbrack.fccc.edu/BioDownloader/</p><p>Address of the bookmark: <a href="http://dunbrack.fccc.edu/BioDownloader/" rel="nofollow">http://dunbrack.fccc.edu/BioDownloader/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31205/yasra-reference-based-assembler</guid>
	<pubDate>Wed, 01 Mar 2017 08:32:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31205/yasra-reference-based-assembler</link>
	<title><![CDATA[YASRA: Reference based assembler]]></title>
	<description><![CDATA[<p>YASRA (Yet Another Short Read Assembler) performs comparative assembly of short reads using a reference genome, which can differ substantially from the genome being sequenced. Mapping reads to reference genomes makes use of LASTZ (Harris et al), a pairwise sequence aligner compatible with BLASTZ. Special scoring sets were derived to improve the performance, both in runtime and quality for 454 and Illumina sequence reads.</p>
<p>YASRA uses LASTZ (<a href="http://bx.psu.edu/miller_lab">http://bx.psu.edu/miller_lab</a> for released version and <a href="http://www.bx.psu.edu/%7Ersharris/lastz/newer">http://www.bx.psu.edu/~rsharris/lastz/newer</a> for newer version) for aligning the sequences to the reference genome. Please install LASTZ (the newest version on <a href="http://www.bx.psu.edu/%7Ersharris/lastz/newer">http://www.bx.psu.edu/~rsharris/lastz/newer</a>) and add the LASTZ binary in your executable/binary search path before installing YASRA.</p><p>Address of the bookmark: <a href="https://github.com/aakrosh/YASRA" rel="nofollow">https://github.com/aakrosh/YASRA</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31564/htslib</guid>
	<pubDate>Wed, 15 Mar 2017 11:38:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31564/htslib</link>
	<title><![CDATA[HTSlib]]></title>
	<description><![CDATA[<p>Samtools is a suite of programs for interacting with high-throughput sequencing data. It consists of three separate repositories:</p>
<dl><dt>Samtools</dt><dd>Reading/writing/editing/indexing/viewing SAM/BAM/CRAM format</dd><dt>BCFtools</dt><dd>Reading/writing BCF2/VCF/gVCF files and calling/filtering/summarising SNP and short indel sequence variants</dd><dt>HTSlib</dt><dd>A C library for reading/writing high-throughput sequencing data</dd></dl>
<p>Samtools and BCFtools both use HTSlib internally, but these source packages contain their own copies of htslib so they can be built independently.</p><p>Address of the bookmark: <a href="http://www.htslib.org/" rel="nofollow">http://www.htslib.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36621/hapcut2-robust-and-accurate-haplotype-assembly-for-diverse-sequencing-technologies</guid>
	<pubDate>Tue, 15 May 2018 07:35:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36621/hapcut2-robust-and-accurate-haplotype-assembly-for-diverse-sequencing-technologies</link>
	<title><![CDATA[HapCUT2: robust and accurate haplotype assembly for diverse sequencing technologies]]></title>
	<description><![CDATA[HapCUT2 is a maximum-likelihood-based tool for assembling haplotypes from DNA sequence reads, designed to "just work" with excellent speed and accuracy. We found that previously described haplotype assembly methods are specialized for specific read technologies or protocols, with slow or inaccurate performance on others. With this in mind, HapCUT2 is designed for speed and accuracy across diverse sequencing technologies, including but not limited to:

NGS short reads (Illumina HiSeq)
clone-based sequencing (Fosmid or BAC clones)
SMRT reads (PacBio)
Oxford Nanopore reads
10X Genomics Linked-Reads
proximity-ligation (Hi-C) reads
high-coverage sequencing (&gt;40x coverage-per-SNP) using above technologies
combinations of the above technologies (e.g. scaffold long reads with Hi-C reads)
See below for specific examples of command line options and best practices for some of these technologies.

NOTE: At this time HapCUT2 is for diploid organisms only. VCF input should contain diploid variants.

If you use HapCUT2 in your research, please cite:

Edge, P., Bafna, V. &amp; Bansal, V. HapCUT2: robust and accurate haplotype assembly for diverse sequencing technologies. Genome Res. gr.213462.116 (2016). doi:10.1101/gr.213462.116<p>Address of the bookmark: <a href="https://github.com/vibansal/HapCUT2" rel="nofollow">https://github.com/vibansal/HapCUT2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</guid>
	<pubDate>Wed, 20 Jun 2018 02:45:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36985/swalo-scaffolding-with-assembly-likelihood-optimization</link>
	<title><![CDATA[SWALO: Scaffolding with assembly likelihood optimization]]></title>
	<description><![CDATA[SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.

Please email your questions, comments, suggestions, and bug reports to atif.bd@gmail.com.<p>Address of the bookmark: <a href="https://atifrahman.github.io/SWALO/" rel="nofollow">https://atifrahman.github.io/SWALO/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32184/metagenomics-assembly-workshop</guid>
	<pubDate>Tue, 18 Apr 2017 04:28:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32184/metagenomics-assembly-workshop</link>
	<title><![CDATA[Metagenomics assembly workshop !!]]></title>
	<description><![CDATA[<div>
<div>
<div id="welcome-to-metagenomics-workshop">
<p>Welcome to the one-day metagenomics assembly workshop. This tutorial will guide you through the typical steps of metagenome assembly and binning.</p>
<div>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html">The Tutorial Data Set</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/qc/index.html">FastQC Quality Control</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/index.html">Assembly</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/velvet.html">Velvet Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/megahit.html">MEGAHIT Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/idba_ud.html">IDBA-UD Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/ray.html">Ray Assembly</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/geneprediction/index.html">Gene Prediction</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/index.html">Assembly Evaluation</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/mapping.html">Read Mapping</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/metaquast.html">MetaQUAST</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/index.html">Binning</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/maxbin.html">MaxBin Binning</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/metabat.html">MetaBAT Binning</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/index.html">Classification</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/kraken.html">Kraken Taxonomic Sequence Classification System</a></li>
</ul>
</li>
</ul>
</div>
</div>
</div>
</div>
<div><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html" title="The Tutorial Data Set">Next&nbsp;<span></span></a>
<p>&nbsp;</p>
</div><p>Address of the bookmark: <a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html" rel="nofollow">http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32420/fastq-format</guid>
	<pubDate>Wed, 03 May 2017 04:23:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32420/fastq-format</link>
	<title><![CDATA[Fastq format]]></title>
	<description><![CDATA[<p><strong>FASTQ format</strong>&nbsp;is a text-based&nbsp;<a href="https://en.wikipedia.org/wiki/File_format" title="File format">format</a>&nbsp;for storing both a biological sequence (usually&nbsp;<a href="https://en.wikipedia.org/wiki/Nucleotide_sequence" title="Nucleotide sequence">nucleotide sequence</a>) and its corresponding quality scores. Both the sequence letter and quality score are each encoded with a single&nbsp;<a href="https://en.wikipedia.org/wiki/ASCII" title="ASCII">ASCII</a>&nbsp;character for brevity.</p>
<p>It was originally developed at the&nbsp;<a href="https://en.wikipedia.org/wiki/Wellcome_Trust_Sanger_Institute" title="Wellcome Trust Sanger Institute">Wellcome Trust Sanger Institute</a>&nbsp;to bundle a&nbsp;<a href="https://en.wikipedia.org/wiki/FASTA_format" title="FASTA format">FASTA</a>&nbsp;sequence and its quality data, but has recently become the&nbsp;<em>de facto</em>&nbsp;standard for storing the output of high-throughput sequencing instruments such as the&nbsp;<a href="https://en.wikipedia.org/wiki/Illumina_(company)" title="Illumina (company)">Illumina</a>&nbsp;Genome Analyzer.<sup id="cite_ref-Cock2009_1-0"><a href="https://en.wikipedia.org/wiki/FASTQ_format#cite_note-Cock2009-1">[1]</a></sup></p><p>Address of the bookmark: <a href="https://en.wikipedia.org/wiki/FASTQ_format" rel="nofollow">https://en.wikipedia.org/wiki/FASTQ_format</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>