<?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/40208?offset=590</link>
	<atom:link href="https://bioinformaticsonline.com/related/40208?offset=590" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/30867/perl-special-vars-quick-reference</guid>
	<pubDate>Tue, 07 Feb 2017 05:08:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/30867/perl-special-vars-quick-reference</link>
	<title><![CDATA[Perl Special Vars Quick Reference]]></title>
	<description><![CDATA[<table>
<tbody>
<tr>
<td><tt>$_</tt></td>
<td>The default or implicit variable.</td>
</tr>
<tr>
<td><tt>@_</tt></td>
<td>Subroutine parameters.</td>
</tr>
<tr>
<td><tt>$a</tt><br /><tt>$b</tt></td>
<td><a href="http://perldoc.perl.org/functions/sort.html">sort</a>&nbsp;comparison routine variables.</td>
</tr>
<tr>
<td><tt>@ARGV</tt></td>
<td>The command-line args.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Regular Expressions</span></td>
</tr>
<tr>
<td><tt>$&lt;digit&gt;</tt></td>
<td>Regexp parenthetical capture holders.</td>
</tr>
<tr>
<td><tt>$&amp;</tt></td>
<td>Last successful match (degrades performance).</td>
</tr>
<tr>
<td><tt>${^MATCH}</tt></td>
<td>Similar to&nbsp;<tt>$&amp;</tt>&nbsp;without performance penalty. Requires /p modifier.</td>
</tr>
<tr>
<td><tt>$`</tt></td>
<td>Prematch for last successful match string (degrades performance).</td>
</tr>
<tr>
<td><tt>${^PREMATCH}</tt></td>
<td>Similar to&nbsp;<tt>$`</tt>&nbsp;without performance penalty. Requires&nbsp;<tt>/p</tt>&nbsp;modifier.</td>
</tr>
<tr>
<td><tt>$'</tt></td>
<td>Postmatch for last successful match string (degrades performance).</td>
</tr>
<tr>
<td><tt>${^POSTMATCH}</tt></td>
<td>Similar to&nbsp;<tt>$'</tt>&nbsp;without performance penalty. Requires&nbsp;<tt>/p</tt>&nbsp;modifier.</td>
</tr>
<tr>
<td><tt>$+</tt></td>
<td>Last paren match.</td>
</tr>
<tr>
<td><tt>$^N</tt></td>
<td>Last closed paren match (last submatch).</td>
</tr>
<tr>
<td><tt>@+</tt></td>
<td>Offsets of ends of successful submatches in scope.</td>
</tr>
<tr>
<td><tt>@-</tt></td>
<td>Offsets of starts of successful submatches in scope.</td>
</tr>
<tr>
<td><tt>%+</tt></td>
<td>Like&nbsp;<tt>@+</tt>, but for named submatches.</td>
</tr>
<tr>
<td><tt>%-</tt></td>
<td>Like&nbsp;<tt>@-</tt>, but for named submatches.</td>
</tr>
<tr>
<td><tt>$^R</tt></td>
<td>Last regexp (?{code}) result.</td>
</tr>
<tr>
<td><tt>${^RE_DEBUG_FLAGS}</tt></td>
<td>Current value of regexp debugging flags. See&nbsp;<tt>use re 'debug';</tt></td>
</tr>
<tr>
<td><tt>${^RE_TRIE_MAXBUF}</tt></td>
<td>Control memory allocations for RE optimizations for large alternations.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Encoding</span></td>
</tr>
<tr>
<td><tt>${^ENCODING}</tt></td>
<td>The object reference to the Encode object, used to convert the source code to Unicode.</td>
</tr>
<tr>
<td><tt>${^OPEN}</tt></td>
<td>Internal use: \0 separated Input / Output layer information.</td>
</tr>
<tr>
<td><tt>${^UNICODE}</tt></td>
<td>Read-only Unicode settings.</td>
</tr>
<tr>
<td><tt>${^UTF8CACHE}</tt></td>
<td>State of the internal UTF-8 offset caching code.</td>
</tr>
<tr>
<td><tt>${^UTF8LOCALE}</tt></td>
<td>Indicates whether UTF8 locale was detected at startup.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">IO and Separators</span></td>
</tr>
<tr>
<td><tt>$.</tt></td>
<td>Current line number (or record number) of most recent filehandle.</td>
</tr>
<tr>
<td><tt>$/</tt></td>
<td>Input record separator.</td>
</tr>
<tr>
<td><tt>$|</tt></td>
<td>Output autoflush. 1=autoflush, 0=default. Applies to currently selected handle.</td>
</tr>
<tr>
<td><tt>$,</tt></td>
<td>Output field separator (lists)</td>
</tr>
<tr>
<td><tt>$\</tt></td>
<td>Output record separator.</td>
</tr>
<tr>
<td><tt>$"</tt></td>
<td>Output list separator. (interpolated lists)</td>
</tr>
<tr>
<td><tt>$;</tt></td>
<td>Subscript separator. (Use a real multidimensional array instead.)</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Formats</span></td>
</tr>
<tr>
<td><tt>$%</tt></td>
<td>Page number for currently selected output channel.</td>
</tr>
<tr>
<td><tt>$=</tt></td>
<td>Current page length.</td>
</tr>
<tr>
<td><tt>$-</tt></td>
<td>Number of lines left on page.</td>
</tr>
<tr>
<td><tt>$~</tt></td>
<td>Format name.</td>
</tr>
<tr>
<td><tt>$^</tt></td>
<td>Name of top-of-page format.</td>
</tr>
<tr>
<td><tt>$:</tt></td>
<td>Format line break characters</td>
</tr>
<tr>
<td><tt>$^L</tt></td>
<td>Form feed (default "\f").</td>
</tr>
<tr>
<td><tt>$^A</tt></td>
<td>Format Accumulator</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Status Reporting</span></td>
</tr>
<tr>
<td><tt>$?</tt></td>
<td>Child error. Status code of most recent system call or pipe.</td>
</tr>
<tr>
<td><tt>$!</tt></td>
<td>Operating System Error. (What just went 'bang'?)</td>
</tr>
<tr>
<td><tt>%!</tt></td>
<td>Error number hash</td>
</tr>
<tr>
<td><tt>$^E</tt></td>
<td>Extended Operating System Error (Extra error explanation).</td>
</tr>
<tr>
<td><tt>$@</tt></td>
<td>Eval error.</td>
</tr>
<tr>
<td><tt>${^CHILD_ERROR_NATIVE}</tt></td>
<td>Native status returned by the last pipe close, backtick (`` ) command, successful call to wait() or waitpid(), or from the system() operator.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">ID's and Process Information</span></td>
</tr>
<tr>
<td><tt>$$</tt></td>
<td>Process ID</td>
</tr>
<tr>
<td><tt>$&lt;</tt></td>
<td>Real user id of process.</td>
</tr>
<tr>
<td><tt>$&gt;</tt></td>
<td>Effective user id of process.</td>
</tr>
<tr>
<td><tt>$(</tt></td>
<td>Real group id of process.</td>
</tr>
<tr>
<td><tt>$)</tt></td>
<td>Effective group id of process.</td>
</tr>
<tr>
<td><tt>$0</tt></td>
<td>Program name.</td>
</tr>
<tr>
<td><tt>$^O</tt></td>
<td>Operating System name.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Perl Status Info</span></td>
</tr>
<tr>
<td><tt>$]</tt></td>
<td>Old: Version and patch number of perl interpreter. Deprecated.</td>
</tr>
<tr>
<td><tt>$^C</tt></td>
<td>Current value of flag associated with&nbsp;<strong>-c</strong>&nbsp;switch.</td>
</tr>
<tr>
<td><tt>$^D</tt></td>
<td>Current value of debugging flags</td>
</tr>
<tr>
<td><tt>$^F</tt></td>
<td>Maximum system file descriptor.</td>
</tr>
<tr>
<td><tt>$^I</tt></td>
<td>Value of the&nbsp;<strong>-i</strong>&nbsp;(inplace edit) switch.</td>
</tr>
<tr>
<td><tt>$^M</tt></td>
<td>Emergency Memory pool.</td>
</tr>
<tr>
<td><tt>$^P</tt></td>
<td>Internal variable for debugging support.</td>
</tr>
<tr>
<td><tt>$^R</tt></td>
<td>Last regexp (?{code}) result.</td>
</tr>
<tr>
<td><tt>$^S</tt></td>
<td>Exceptions being caught. (eval)</td>
</tr>
<tr>
<td><tt>$^T</tt></td>
<td>Base time of program start.</td>
</tr>
<tr>
<td><tt>$^V</tt></td>
<td>Perl version.</td>
</tr>
<tr>
<td><tt>$^W</tt></td>
<td>Status of -w switch</td>
</tr>
<tr>
<td><tt>${^WARNING_BITS}</tt></td>
<td>Current set of warning checks enabled by&nbsp;<tt>use warnings;</tt></td>
</tr>
<tr>
<td><tt>$^X</tt></td>
<td>Perl executable name.</td>
</tr>
<tr>
<td><tt>${^GLOBAL_PHASE}</tt></td>
<td>Current phase of the Perl interpreter.</td>
</tr>
<tr>
<td><tt>$^H</tt></td>
<td>Internal use only: Hook into Lexical Scoping.</td>
</tr>
<tr>
<td><tt>%^H</tt></td>
<td>Internaluse only: Useful to implement scoped pragmas.</td>
</tr>
<tr>
<td><tt>${^TAINT}</tt></td>
<td>Taint mode read-only flag.</td>
</tr>
<tr>
<td><tt>${^WIN32_SLOPPY_STAT}</tt></td>
<td>If true on Windows&nbsp;<tt>stat()</tt>&nbsp;won't try to open the file.</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Command Line Args</span></td>
</tr>
<tr>
<td><tt>ARGV</tt></td>
<td>Filehandle iterates over files from command line (see also&nbsp;<tt>&lt;&gt;</tt>).</td>
</tr>
<tr>
<td><tt>$ARGV</tt></td>
<td>Name of current file when reading &lt;&gt;</td>
</tr>
<tr>
<td><tt>@ARGV</tt></td>
<td>List of command line args.</td>
</tr>
<tr>
<td><tt>ARGVOUT</tt></td>
<td>Output filehandle for -i switch</td>
</tr>
<tr>
<td colspan="2" align="center"><span style="font-size: xx-small;">Miscellaneous</span></td>
</tr>
<tr>
<td><tt>@F</tt></td>
<td>Autosplit (-a mode) recipient.</td>
</tr>
<tr>
<td><tt>@INC</tt></td>
<td>List of library paths.</td>
</tr>
<tr>
<td><tt>%INC</tt></td>
<td>Keys are filenames, values are paths to modules included via&nbsp;<tt>use, require,&nbsp;</tt>or&nbsp;<tt>do</tt>.</td>
</tr>
<tr>
<td><tt>%ENV</tt></td>
<td>Hash containing current environment variables</td>
</tr>
<tr>
<td><tt>%SIG</tt></td>
<td>Signal handlers.</td>
</tr>
<tr>
<td><tt>$[</tt></td>
<td>Array and substr first element (Deprecated!).</td>
</tr>
</tbody>
</table><p>&nbsp;</p><p>See&nbsp;<a href="http://perldoc.perl.org/perlvar.html">perlvar</a>&nbsp;for detailed descriptions of each of these (and a few more) special variables.</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</guid>
	<pubDate>Fri, 05 May 2017 05:58:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32483/cla-contig-layout-authenticator</link>
	<title><![CDATA[CLA: Contig-Layout-Authenticator]]></title>
	<description><![CDATA[<p><span>To improve upon the shortcomings associated with the construction of draft genomes with Illumina paired-end sequencing, we developed Contig-Layout-Authenticator (CLA). The CLA pipeline can scaffold reference-sorted contigs based on paired reads, resulting in better assembled genomes. Moreover, CLA also hints at probable misassemblies and contaminations, for the users to cross-check before constructing the consensus draft. The CLA pipeline was designed and trained extensively on various bacterial genome datasets for the ordering and scaffolding of large repetitive contigs. The tool has been validated and compared favorably with other widely-used scaffolding and ordering tools using both simulated and real sequence datasets. CLA is a user friendly tool that requires a single command line input to generate ordered scaffolds.</span></p>
<p><span>Script&nbsp;https://sourceforge.net/projects/c-l-authenticator/files/</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0155459</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</guid>
	<pubDate>Sat, 04 Jan 2020 01:08:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</link>
	<title><![CDATA[RePS: Repeat-masked Phrap with scaffolding, a WGS sequence assembler]]></title>
	<description><![CDATA[<p>RePS (Repeat-masked Phrap with scaffolding), a WGS sequence assembler, that explicitly identifies exact kmer repeats from the shotgun data and removes them prior to the assembly. The established software Phrap is used to compute meaningful error probabilities for each base. Clone-end-pairing information is used to construct scaffolds that order and orient the contigs. The updated version of RePS incorporates some of the ideas introduced by Phusion on clustering</p>
<p><img src="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/bin/45793-17f1_F4TT.jpg" alt="image" style="border: 0px;"></p>
<p>More at</p>
<p><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/</a></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz" rel="nofollow">ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/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/37291/transrate-understanding-your-transcriptome-assembly</guid>
	<pubDate>Fri, 13 Jul 2018 07:49:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37291/transrate-understanding-your-transcriptome-assembly</link>
	<title><![CDATA[transrate: Understanding your transcriptome assembly]]></title>
	<description><![CDATA[<p><span>Transrate is software for&nbsp;</span><em>de-novo</em><span>&nbsp;transcriptome assembly quality analysis. It examines your assembly in detail and compares it to experimental evidence such as the sequencing reads, reporting quality scores for contigs and assemblies. This allows you to choose between assemblers and parameters, filter out the bad contigs from an assembly, and help decide when to stop trying to improve the assembly.</span></p><p>Address of the bookmark: <a href="http://hibberdlab.com/transrate/index.html" rel="nofollow">http://hibberdlab.com/transrate/index.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</guid>
	<pubDate>Mon, 21 Jan 2019 17:58:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38755/svaba-genome-wide-detection-of-structural-variants-and-indels-by-local-assembly</link>
	<title><![CDATA[SvABA: Genome-wide detection of structural variants and indels by local assembly]]></title>
	<description><![CDATA[<p><span>SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of&nbsp;</span><a href="https://github.com/jts/sga">SGA</a><span>&nbsp;(String Graph Assembler) by Jared Simpson, and&nbsp;</span><a href="https://github.com/lh3/bwa">BWA-MEM</a><span>&nbsp;by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using&nbsp;</span><a href="https://github.com/walaj/VariantBam">VariantBam</a><span>&nbsp;rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.</span></p><p>Address of the bookmark: <a href="https://github.com/walaj/svaba" rel="nofollow">https://github.com/walaj/svaba</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads</guid>
	<pubDate>Sun, 05 Jan 2020 04:08:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40516/nextdenovo-string-graph-based-de-novo-assembler-for-tgs-long-reads</link>
	<title><![CDATA[NextDenovo: string graph-based de novo assembler for TGS long reads]]></title>
	<description><![CDATA[<p>NextDenovo is a string graph-based<span>&nbsp;</span><em>de novo</em><span>&nbsp;</span>assembler for TGS long reads. It uses a "correct-then-assemble" strategy similar to canu, but requires significantly less computing resources and storages. After assembly, the per-base error rate is about 97-98%, to further improve single base accuracy, please use<span>&nbsp;</span><a href="https://github.com/Nextomics/NextPolish">NextPolish</a>.</p>
<p>NextDenovo contains two core modules: NextCorrect and NextGraph. NextCorrect can be used to correct TGS long reads with approximately 15% sequencing errors, and NextGraph can be used to construct a string graph with corrected reads. It also contains a modified version of<span>&nbsp;</span><a href="https://github.com/lh3/minimap2">minimap2</a><span>&nbsp;</span>for adapting input and output and producing more sensitive and accurate dovetail overlaps, and some useful utilities (see<span>&nbsp;</span><a href="https://github.com/Nextomics/NextDenovo/blob/master/doc/UTILITY.md">here</a><span>&nbsp;</span>for more details).</p><p>Address of the bookmark: <a href="https://github.com/Nextomics/NextDenovo" rel="nofollow">https://github.com/Nextomics/NextDenovo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40897/mec-contig-misassembly-correction</guid>
	<pubDate>Tue, 04 Feb 2020 23:40:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40897/mec-contig-misassembly-correction</link>
	<title><![CDATA[MEC: Contig Misassembly Correction]]></title>
	<description><![CDATA[<p><span>MEC, to identify and correct misassemblies in contigs. Firstly, MEC takes fragment coverage as the feature to detect the candidate misassemblies. Then, it can distinguish a large number of false positives from the candidate misassemblies based on the distribution of paired-end reads and the statistical analysis of GC-contents. We apply MEC to four real contig datasets, and carry out experiments to analyze the influence of MEC on scaffolding results, which shows that MEC can reduce misassemblies effectively and result in quantitative improvements in scaffolding quality. MEC is publicly available for download at https://github.com/bioinfomaticsCSU/MEC.</span></p><p>Address of the bookmark: <a href="https://github.com/bioinfomaticsCSU/MEC" rel="nofollow">https://github.com/bioinfomaticsCSU/MEC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>