<?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/32948?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/32948?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</guid>
	<pubDate>Sun, 04 Nov 2018 16:44:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</link>
	<title><![CDATA[Referee: Genome assembly quality scores]]></title>
	<description><![CDATA[<p>Modern genome sequencing technologies provide a succint measure of quality at each position in every read, however all of this information is lost in the assembly process. Referee summarizes the quality information from the reads that map to a site in an assembled genome to calculate a quality score for each position in the genome assembly.</p>
<p>We accomplish this by first calculating genotype likelihoods for every site. For a given site in a diploid genome, there are 10 possible genotypes (AA, AC, AG, AT, CC, CG, CT, GG, GT, TT). Referee takes as input the genotype likelihoods calculated for all 10 genotypes given the called reference base at each position.</p>
<h3>Referee is a program to calculate a quality score for every position in a genome assembly. This allows for easy filtering of low quality sites for any downstream analysis.</h3>
<p>https://github.com/gwct/referee</p><p>Address of the bookmark: <a href="https://gwct.github.io/referee/#" rel="nofollow">https://gwct.github.io/referee/#</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</guid>
	<pubDate>Fri, 01 Feb 2019 11:55:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</link>
	<title><![CDATA[Evaluation of genome assembly software based on long reads]]></title>
	<description><![CDATA[<p>TGS technologies have been used to produce highly accurate de novo assemblies of hundreds of microbial genomes and highly contiguous reconstructions of many dozens of plant and animal genomes, enabling new insights into evolution and sequence diversity. They have also been applied to resequencing analyses, to create detailed maps of structural variations in many species. Also, these new technologies have been used to fill in many of the gaps in the human reference genome.</p><p>In this report, we compare and evaluate several genome assembly software based on TSG technology. The experimentation has been performed on 4 reference genomes and the results evaluated with the QUAST software. The 11 software that have been evaluated are: Celera Assembler , Falcon , Miniasm, Newbler , SGA Assembler, Smartdenovo, Abruijn, Ra, DBG2OLC, Spades and Cerulean. The first 8 software use only long reads, while the 3 last software can merge long and short reads</p>]]></description>
	<dc:creator>BioStar</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/38886" length="382699" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</guid>
	<pubDate>Sun, 14 Apr 2019 20:35:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</link>
	<title><![CDATA[GMASS: a novel measure for genomeassembly structural similarity]]></title>
	<description><![CDATA[<div id="Abstract">
<div id="ASec3">
<p id="Par3">The GMASS score is a novel measure for representing structural similarity between two assemblies. It will contribute to the understanding of assembly output and developing de novo assemblers.</p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z</a></p>
</div>
</div><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php" rel="nofollow">http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</guid>
	<pubDate>Fri, 01 May 2020 03:00:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</link>
	<title><![CDATA[RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes]]></title>
	<description><![CDATA[<p><span>RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/AppliedBioinformatics/RefKA" rel="nofollow">https://github.com/AppliedBioinformatics/RefKA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</guid>
	<pubDate>Tue, 25 Aug 2020 03:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</link>
	<title><![CDATA[VICUNA: a software tool that enables consensus assembly of ultra-deep sequence derived from diverse viral or other heterogeneous populations.]]></title>
	<description><![CDATA[<p><span>VICUNA</span><span>&nbsp;is a&nbsp;</span><em>de novo</em><span>&nbsp;assembly program targeting populations with high mutation rates. It creates a single linear representation of the mixed population on which intra-host variants can be mapped. For clinical samples rich in contamination (e.g., &gt;95%), VICUNA can leverage existing genomes, if available, to assemble only target-alike reads. After initial assembly, it can also use existing genomes to perform guided merging of contigs. For each data set (e.g., Illumina paired read, 454), VICUNA outputs consensus sequence(s) and the corresponding multiple sequence alignment of constituent reads. VICUNA efficiently handles ultra-deep sequence data with tens of thousands fold coverage.</span></p>
<p><a href="http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf">http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf</a></p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/viral-genomics/vicuna" rel="nofollow">https://www.broadinstitute.org/viral-genomics/vicuna</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data</guid>
	<pubDate>Wed, 23 Jun 2021 07:54:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43090/loretta-a-user-friendly-tool-for-assembling-viral-genomes-from-pacbio-sequence-data</link>
	<title><![CDATA[LoReTTA, a user-friendly tool for assembling viral genomes from PacBio sequence data]]></title>
	<description><![CDATA[<p>LoReTTA (Long Read Template-Targeted Assembler), a tool designed for performing <em>de novo</em> assembly of long reads generated from viral genomes on the PacBio platform. LoReTTA exploits a reference genome to guide the assembly process, an approach that has been successful with short reads.</p>
<p>https://academic.oup.com/ve/article/7/1/veab042/6248116</p><p>Address of the bookmark: <a href="https://academic.oup.com/ve/article/7/1/veab042/6248116" rel="nofollow">https://academic.oup.com/ve/article/7/1/veab042/6248116</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/13267/the-genome-10k-project</guid>
	<pubDate>Tue, 29 Jul 2014 09:11:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/13267/the-genome-10k-project</link>
	<title><![CDATA[The Genome 10K Project]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/B57xDIGtCT0" frameborder="0" allowfullscreen></iframe>https://genome10k.soe.ucsc.edu

The Genome 10K project aims to assemble a genomic zoo—a collection of DNA sequences representing the genomes of 10,000 vertebrate species, approximately one for every vertebrate genus. The trajectory of cost reduction in DNA sequencing suggests that this project will be feasible within a few years. Capturing the genetic diversity of vertebrate species would create an unprecedented resource for the life sciences and for worldwide conservation efforts.

The growing Genome 10K Community of Scientists (G10KCOS), made up of leading scientists representing major zoos, museums, research centers, and universities around the world, is dedicated to coordinating efforts in tissue specimen collection that will lay the groundwork for a large-scale sequencing and analysis project.]]></description>
	
</item>
<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/bookmarks/view/30090/standardized-velvet-assembly-report</guid>
	<pubDate>Fri, 09 Dec 2016 03:59:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30090/standardized-velvet-assembly-report</link>
	<title><![CDATA[Standardized velvet assembly report]]></title>
	<description><![CDATA[<p>Requirements:</p>
<ul>
<li>velvet (velveth velvetg should be in your PATH)</li>
<li>R (with Sweave)</li>
<li>pdflatex (usually part of TeTeX)</li>
<li>ggplot2 (from R prompt type install.packages("ggplot2","proto","xtable"))</li>
<li>Perl</li>
</ul>
<p>Optional:</p>
<ul>
<li>BLAT or BLAST (to generate alignments against a reference genome). If using BLAT, add faToTwoBit,gfClient,gfServer to your PATH. If using BLAST, add blastall and formatdb.</li>
</ul>
<p>Edit permute.sh to your liking, paying particular attention to the kmer, cvCut, expCov, and other flags</p>
<p>To Run:</p>
<ol>
<li><code>perl fastaAllSize mysequences.fa &gt; mysequences.stat or gunzip -c mysequences.fa.gz | fastaAllSize &gt; mysequences.stat</code>&nbsp;Substitute fastqAllSize for fastq files.</li>
<li><code>./permute.sh mysequences</code>&nbsp;(leave out the .fa)</li>
</ol>
<p>https://github.com/leipzig/standardized-velvet-assembly-report</p><p>Address of the bookmark: <a href="https://github.com/leipzig/standardized-velvet-assembly-report" rel="nofollow">https://github.com/leipzig/standardized-velvet-assembly-report</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</guid>
	<pubDate>Tue, 13 Dec 2016 10:23:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30130/scaffmatch</link>
	<title><![CDATA[ScaffMatch]]></title>
	<description><![CDATA[<p>caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one needs to first map reads to contigs (instead of providing .sam files).</p>
<p>The arguments accepted by ScaffMatch are:</p>
<p>&nbsp; -w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;</p>
<p>&nbsp; -c) Contig fasta file;</p>
<p>&nbsp; -m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;</p>
<p>&nbsp; -1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;</p>
<p>&nbsp; -2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;</p>
<p>&nbsp; -i) (Comma separated list of) insert size(s) of the library(-ies);</p>
<p>&nbsp; -s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);</p>
<p>&nbsp; -t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;</p>
<p>&nbsp; -g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;</p>
<p>&nbsp; -l) Log file - where to store the logs. Optional argument. By default, stdout is used.</p><p>Address of the bookmark: <a href="http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch" rel="nofollow">http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>