<?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/37225?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/37225?offset=250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</guid>
	<pubDate>Tue, 14 Aug 2018 18:11:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37545/ncbi-magic-blast</link>
	<title><![CDATA[NCBI Magic-BLAST]]></title>
	<description><![CDATA[<p>Magic-BLAST is a tool for mapping large next-generation RNA or DNA sequencing runs against a whole genome or transcriptome. Each alignment optimizes a composite score, taking into account simultaneously the two reads of a pair, and in case of RNA-seq, locating the candidate introns and adding up the score of all exons. This is very different from other versions of BLAST, where each exon is scored as a separate hit and read-pairing is ignored.</p>
<p>Magic-BLAST incorporates within the NCBI BLAST code framework ideas developed in the NCBI Magic pipeline, in particular hit extensions by local walk and jump&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/26109056">(http://www.ncbi.nlm.nih.gov/pubmed/26109056)</a>, and recursive clipping of mismatches near the edges of the reads, which avoids accumulating artefactual mismatches near splice sites and is needed to distinguish short indels from substitutions near the edges.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://ncbi.github.io/magicblast/" rel="nofollow">https://ncbi.github.io/magicblast/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</guid>
	<pubDate>Fri, 17 Sep 2021 01:57:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43384/lncpipea-nextflow-based-pipeline-for-comprehensive-analyses-of-long-non-coding-rnas-from-rna-seq-datasets</link>
	<title><![CDATA[LncPipe:A Nextflow-based pipeline for comprehensive analyses of long non-coding RNAs from RNA-seq datasets]]></title>
	<description><![CDATA[<p><span>The pipeline was developed based on a popular workflow framework&nbsp;</span><a href="https://github.com/nextflow-io/nextflow">Nextflow</a><span>, composed of four core procedures including reads alignment, assembly, identification and quantification. It contains various unique features such as well-designed lncRNAs annotation strategy, optimized calculating efficiency, diversified classification and interactive analysis report.&nbsp;</span><a href="https://github.com/likelet/LncPipe">LncPipe</a><span>&nbsp;allows users additional control in interuppting the pipeline, resetting parameters from command line, modifying main script directly and resume analysis from previous checkpoint.</span></p>
<p>Ref&nbsp;https://www.lncrnablog.com/lncpipe-a-nextflow-based-pipeline-for-identification-and-analysis-of-long-non-coding-rnas-from-rna-seq-data/</p>
<p><img src="https://ars.els-cdn.com/content/image/1-s2.0-S1673852718301176-gr1.jpg" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/likelet/LncPipe" rel="nofollow">https://github.com/likelet/LncPipe</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/34197/strand-life-sciences-announces-the-release-of-strand-ngs-v31-at-ashg-2017</guid>
	<pubDate>Mon, 23 Oct 2017 02:39:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/34197/strand-life-sciences-announces-the-release-of-strand-ngs-v31-at-ashg-2017</link>
	<title><![CDATA[Strand Life Sciences announces the release of Strand NGS v3.1 at ASHG 2017]]></title>
	<description><![CDATA[<h1><a href="http://www.strand-ngs.com/strand-announce-strandngss-v31">Strand Life Sciences announces the release of Strand NGS v3.1 at ASHG 2017</a></h1><p><strong><em>ORLANDO, USA, Oct 17, 2017/ PRNewswire/</em></strong></p><p><em>Strand NGS now supports large scale RNA- and small-RNA-Seq and Unique Molecular Identifiers (UMIs) for DNA-, RNA-, and small-RNA-Seq.</em></p><p>Strand Life Sciences announced the latest version release of its bioinformatics flagship product, Strand NGS, at the Annual Meeting of the American Society of Human Genetics today. Two major themes in Strand NGS v3.1 address recent challenges in next generation sequencing (NGS).</p><p>The first theme is large-scale RNA-Seq data analysis. Current cross-cohort RNA- and small-RNA-Seq studies span tens of replicates and batches across hundreds of samples, sometimes conducted across several different institutions. For such studies, Strand NGS v3.1 includes confounding variable analysis to eliminate technical effects, including batch effects; the t-SNE plot; profile and heat-map plots of gene-body coverage; and several other notable visual enhancements.</p><p>The second new feature is support for Unique Molecular Identifiers, or UMIs, for DNA-, RNA- and small-RNA-Seq. UMI support in Strand NGS is end-to-end, spanning alignment to variant calling in DNA-Seq, and alignment to quantification in RNA- and small-RNA-Seq. The Bioo Scientific, Qiagen, and Rubicon UMI protocols are natively supported, and an intuitive interface allows the specification of custom UMI protocols.</p><p><em>&ldquo;For liquid biopsies and low-grade FFPE samples, UMI support in DNA-Seq enables the detection of somatic variants at low concentrations. In RNA-Seq, large-scale and UMI support can be used in single-cell-based studies that reveal tumor-cell heterogeneity, even at low concentrations&rdquo;, says<strong>&nbsp;Dr. Vamsi Veeramachaneni, Chief Scientific Officer, Strand Life Sciences.</strong></em></p><p><em>&ldquo;At Strand, we are continuously working towards improving the accuracy and efficiency of NGS data analysis. Customers can look forward to Strand NGS becoming available on the cloud in the near future&rdquo;, says&nbsp;<strong>Dr. Ramesh Hariharan, Chief Executive Officer, Strand Life Sciences.</strong></em></p><p>Visit Strand Life Sciences at ASHG booth #1017 to know more about Strand NGS v3.1 and other products and service offerings from Strand Life Sciences. Click here to access detailed agenda and v3.1&nbsp;<a href="http://www.strand-ngs.com/download/releasenotes">release notes</a>.</p><p><strong>About Strand Life Sciences</strong></p><p>Strand Life Sciences is a premier life science informatics innovation company. Founded in 2000, Strand is a leader in technology innovations for healthcare using genomics. By enhancing sequence-based diagnostics and clinical genomic data interpretation using a strong foundation of computational, scientific, and medical expertise, Strand is bringing individualized medicine to the world. To know more, visit&nbsp;<a href="http://www.strandls.com/" title="www.strandls.com">www.strandls.com</a></p>]]></description>
	<dc:creator>Yeshodari</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43308/rna-seq-differential-expression-work-flow-using-deseq2</guid>
	<pubDate>Mon, 23 Aug 2021 10:57:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43308/rna-seq-differential-expression-work-flow-using-deseq2</link>
	<title><![CDATA[RNA-Seq differential expression work flow using DESeq2]]></title>
	<description><![CDATA[<p><span>One of the aim of RNAseq data analysis is the detection of differentially expressed genes. The package&nbsp;</span><a href="http://www.bioconductor.org/packages/release/bioc/html/DESeq2.html">DESeq2</a><span>&nbsp;provides methods to test for differential expression analysis.</span></p><p>Address of the bookmark: <a href="http://www.sthda.com/english/wiki/rna-seq-differential-expression-work-flow-using-deseq2" rel="nofollow">http://www.sthda.com/english/wiki/rna-seq-differential-expression-work-flow-using-deseq2</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44789/kallisto-vs-salmon-choosing-the-right-tool-for-rna-seq-quantification</guid>
	<pubDate>Fri, 02 May 2025 06:28:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44789/kallisto-vs-salmon-choosing-the-right-tool-for-rna-seq-quantification</link>
	<title><![CDATA[Kallisto vs Salmon: Choosing the Right Tool for RNA-Seq Quantification]]></title>
	<description><![CDATA[<p>In the world of transcriptomics, quantifying gene and transcript expression accurately and efficiently is crucial. With the explosion of RNA-Seq data, researchers have turned to fast, alignment-free tools that streamline the quantification process without compromising accuracy. Two leading tools in this space are&nbsp;<span>Kallisto</span>&nbsp;and&nbsp;<span>Salmon</span>. Both tools are highly efficient and widely used in the bioinformatics community, but they differ in subtle yet important ways. If you're unsure which one to use for your next RNA-Seq project, this post is for you.</p><h2>What Are Kallisto and Salmon?</h2><p>At their core, both&nbsp;<span>Kallisto</span>&nbsp;and&nbsp;<span>Salmon</span>&nbsp;are tools for&nbsp;<span>quantifying transcript abundance</span>&nbsp;from RNA-Seq reads. They bypass traditional alignment-based methods, replacing them with&nbsp;<span>pseudoalignment</span>&nbsp;or&nbsp;<span>quasi-mapping</span>, which drastically speeds up the process.</p><ul>
<li><span>Kallisto</span>&nbsp;was developed by Lior Pachter&rsquo;s lab and introduced the concept of&nbsp;<em>pseudoalignment</em>&nbsp;using a de Bruijn graph.</li>
<li><span>Salmon</span>, developed by Rob Patro&rsquo;s group, builds on this idea with&nbsp;<em>quasi-mapping</em>&nbsp;and offers additional features like advanced bias correction.</li>
</ul><h2>Head-to-Head Comparison</h2><h3>1. Algorithm</h3><ul>
<li><span>Kallisto</span>&nbsp;uses&nbsp;<em>pseudoalignment</em>, focusing on matching k-mers from reads to a transcriptome index.</li>
<li><span>Salmon</span>&nbsp;uses&nbsp;<em>quasi-mapping</em>, which adds more flexibility and can also work with aligned reads (BAM files).</li>
</ul><h3>2. Input and Flexibility</h3><ul>
<li><span>Kallisto</span>&nbsp;works with raw FASTQ reads and requires a custom transcriptome index.</li>
<li><span>Salmon</span>&nbsp;accepts FASTQ or pre-aligned BAM files, giving you more workflow options.</li>
</ul><h3>3. Bias Correction</h3><p>One of Salmon&rsquo;s major advantages is its sophisticated bias correction system. It corrects for:</p><ul>
<li>Sequence-specific bias</li>
<li>Positional bias</li>
<li>GC-content bias</li>
</ul><p>Kallisto offers basic sequence bias correction but lacks the comprehensive models found in Salmon.</p><h3>4. Speed and Resources</h3><ul>
<li><span>Kallisto</span>&nbsp;is blazing fast and slightly more memory-efficient.</li>
<li><span>Salmon</span>&nbsp;is still very fast, but the added features can come at a small computational cost.</li>
</ul><h3>5. Output and Downstream Analysis</h3><ul>
<li>Both tools provide transcript-level quantifications and support bootstrapping for variance estimation.</li>
<li><span>Salmon</span>&nbsp;can also summarize counts at the gene level if provided with a mapping file (<code>--geneMap</code>).</li>
<li>Kallisto integrates seamlessly with&nbsp;<span>Sleuth</span>&nbsp;for differential expression analysis.</li>
<li>Salmon works well with&nbsp;<span>tximport</span>,&nbsp;<span>DESeq2</span>,&nbsp;<span>edgeR</span>, and other Bioconductor tools.</li>
</ul><h2>Choosing the Right Tool</h2><table>
<thead>
<tr><th>Goal</th><th>Recommended Tool</th></tr>
</thead>
<tbody>
<tr>
<td>Maximum speed</td>
<td>Kallisto</td>
</tr>
<tr>
<td>Advanced bias correction</td>
<td>Salmon</td>
</tr>
<tr>
<td>Use BAM files</td>
<td>Salmon</td>
</tr>
<tr>
<td>Transcript-level quantification with Sleuth</td>
<td>Kallisto</td>
</tr>
<tr>
<td>Integration with DESeq2/edgeR</td>
<td>Salmon</td>
</tr>
</tbody>
</table><h2>Example Command Lines</h2><p><span>Kallisto</span>&nbsp;(paired-end):</p><pre><code>kallisto quant -i transcriptome.idx -o output -b 100 sample_R1.fastq sample_R2.fastq
</code></pre><p><span>Salmon</span>&nbsp;(paired-end, bias correction):</p><pre><code>salmon quant -i salmon_index -l A -1 sample_R1.fastq -2 sample_R2.fastq \
  -p 8 --validateMappings --seqBias --gcBias -o output
</code></pre><h2>Conclusion</h2><p>Both Kallisto and Salmon are exceptional tools that have transformed RNA-Seq analysis. Your choice largely depends on your priorities&mdash;whether it's speed, accuracy, flexibility, or compatibility with downstream tools.</p><p>For many users,&nbsp;<span>Salmon</span>&nbsp;offers a more complete and flexible solution, especially when bias correction and gene-level outputs are essential. However,&nbsp;<span>Kallisto</span>&nbsp;remains a favorite for quick, accurate quantification, especially when paired with the&nbsp;<span>Sleuth</span>&nbsp;pipeline.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8287/post-doc-in-computational-genetics-and-genomics-at-ceinge-biotecnologie-avanzate-naples-italy</guid>
  <pubDate>Tue, 11 Feb 2014 08:06:47 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post doc in Computational Genetics and Genomics at CEINGE Biotecnologie Avanzate, Naples, Italy]]></title>
  <description><![CDATA[
<p>We are seeking one motivated scientist to analyze genomics and transcriptomics data of a large collection of neuroblastoma tumors. The successful candidate will be part of a team of researchers with extensive expertise in genome cancer study. He/she will be involved in the analysis of DNA-seq, RNA-seq, ChIP-seq data using available methods running in R and UNIX environment.</p>

<p>Qualifications</p>

<p>PhD or Post-Graduated Master degree is required. Successful candidates will have some expertise in data analysis of NGS data by using methods running in R and UNIX environment. Familiarity with genome databases and browsers is required.</p>

<p>Application</p>

<p>Candidates should send a CV and a brief personal statement focusing on their skills and interests related to the research project.</p>

<p>Contacts</p>

<p>Start date: 1° April 2014<br />Salary on grant: 25,000 euros per year.<br />Contact Person (Referent): Mario Capasso<br />Ref. Email: mario.capasso@unina.it and achille.iolascon@unina.it<br />Tel: +39 081 3737889</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22891/17-marie-curie-phd-position-available-immediately</guid>
  <pubDate>Tue, 23 Jun 2015 06:52:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[17 Marie Curie PhD position available immediately]]></title>
  <description><![CDATA[
<p>Kindly look into following webpage:<br />http://medhealth.leeds.ac.uk/info/1450/scholarships/1795/marie_curie_phd_training_network</p>

<p>The closing date for application will be 26 June 2015.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</guid>
	<pubDate>Mon, 27 Nov 2017 07:58:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</link>
	<title><![CDATA[miniasm: very fast OLC-based de novo assembler for noisy long reads]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p>
<p>So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-Bacterial-Assembly">PacBio E. coli sample</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS473430">ERS473430</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS544009">ERS544009</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS554120">ERS554120</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS605484">ERS605484</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS617393">ERS617393</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS646601">ERS646601</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS659581">ERS659581</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS670327">ERS670327</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS685285">ERS685285</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS743109">ERS743109</a>&nbsp;and a&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-20kb-Size-Selected-Library-with-P6-C4/ce0533c1d2a957488594f0b29da61ffa3e4627e8">deprecated PacBio E. coli data set</a>. ONT data are acquired from the&nbsp;<a href="http://lab.loman.net/2015/09/24/first-sqk-map-006-experiment/">Loman Lab</a>.</p>
<p>For a&nbsp;<em>C. elegans</em>&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/C.-elegans-data-set">PacBio data set</a>&nbsp;(only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the&nbsp;<a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/HGAP">HGAP3</a>produces a 104Mb assembly with N50 1.61Mb.&nbsp;<a href="http://lh3lh3.users.sourceforge.net/download/ce-miniasm.png">This dotter plot</a>&nbsp;gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.</p>
<p>Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>&nbsp;can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as&nbsp;<a href="https://github.com/marbl/MHAP">MHAP</a>&nbsp;and&nbsp;<a href="https://github.com/thegenemyers/DALIGNER">DALIGNER</a>. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.</p>
<p>Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)</p>
<p>We start with an all against all comparison:</p>
<div>
<pre><code>minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 &gt; reads.paf.gz
</code></pre>
</div>
<p>Then we can assemble</p>
<div>
<pre><code>miniasm -f reads.fq reads.paf.gz &gt; reads.gfa
</code></pre>
</div>
<p>Convert GFA to FASTA:</p>
<div>
<pre><code>awk <span>'/^S/{print "&gt;"$2"\n"$3}'</span> reads.gfa | fold &gt; reads.fa
</code></pre>
</div>
<p>And then count how many contigs:</p>
<div>
<pre><code>grep <span>"&gt;"</span> reads.fa | wc -l</code></pre>
</div>
<p>&nbsp;</p>
<pre><span><span>#</span> Download sample PacBio from the PBcR website</span>
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz <span>|</span> tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
<span><span>#</span> Install minimap and miniasm (requiring gcc and zlib)</span>
git clone https://github.com/lh3/minimap <span>&amp;&amp;</span> (cd minimap <span>&amp;&amp;</span> make)
git clone https://github.com/lh3/miniasm <span>&amp;&amp;</span> (cd miniasm <span>&amp;&amp;</span> make)
<span><span>#</span> Overlap</span>
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq <span>|</span> gzip -1 <span>&gt;</span> reads.paf.gz
<span><span>#</span> Layout</span>
miniasm/miniasm -f reads.fq reads.paf.gz <span>&gt;</span> reads.gfa</pre><p>Address of the bookmark: <a href="https://github.com/lh3/miniasm" rel="nofollow">https://github.com/lh3/miniasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</guid>
	<pubDate>Tue, 12 Dec 2017 17:23:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</link>
	<title><![CDATA[MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)]]></title>
	<description><![CDATA[<p><span>MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a&nbsp;</span><em>k</em><span>-mer based&nbsp;</span><a href="https://en.wikipedia.org/wiki/Jaccard_index">Jaccard similarity</a><span>&nbsp;using a combination of&nbsp;</span><a href="http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p76-schleimer.pdf">Winnowing</a><span>&nbsp;and&nbsp;</span><a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a><span>. This is then converted to an estimate of sequence identity using the&nbsp;</span><a href="http://mash.readthedocs.org/">Mash</a><span>&nbsp;distance. An appropriate&nbsp;</span><em>k</em><span>-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.</span></p><p>Address of the bookmark: <a href="https://github.com/marbl/MashMap" rel="nofollow">https://github.com/marbl/MashMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>