<?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/37502?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/37502?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31568/pacbio-long-reads-compatible-software-and-tools</guid>
	<pubDate>Wed, 15 Mar 2017 14:19:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31568/pacbio-long-reads-compatible-software-and-tools</link>
	<title><![CDATA[Pacbio Long Reads Compatible Software and Tools]]></title>
	<description><![CDATA[<p>The following software packages are known to be compatible with PacBio&reg; data, in addition to PacBio's own SMRT&reg; Analysis suite. All packages are believed to be open source or freely available for non-commercial use. See the individual project sites for up-to-date license information. A separate page lists&nbsp;<a href="http://pacb.com/community/partner_program/current_partners/">commercial software</a>.</p>
<p>Know of any other open source software for PacBio data?&nbsp;<a href="mailto:devnet@pacificbiosciences.com">Email us</a>.</p>
<p>Software categories:</p>
<ul>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#denovo">De novo assembly</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#svdetection">Structural Variations Detection</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#aligners">Reference-based alignment</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#variants">Consensus and variant calling</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#RNA">RNA analysis</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#basemods">Epigenetic base modifications and methylation</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#barcoding">Barcoding</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#browsers">Genome Browsers</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#qc">Run QC</a></li>
<li><a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software#frameworks">Frameworks and APIs</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software" rel="nofollow">https://github.com/PacificBiosciences/DevNet/wiki/Compatible-Software</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</guid>
	<pubDate>Thu, 24 May 2018 10:06:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</link>
	<title><![CDATA[pbalign: maps PacBio reads to reference sequences and saves alignments to a BAM file]]></title>
	<description><![CDATA[pbalign aligns PacBio reads to reference sequences, filters aligned reads according to user-specific filtering criteria, and converts the output to either the SAM format or PacBio Compare HDF5 (e.g., .cmp.h5) format. The output Compare HDF5 file will be compatible with Quiver if --forQuiver option is specified.<p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/pbalign" rel="nofollow">https://github.com/PacificBiosciences/pbalign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</guid>
	<pubDate>Fri, 19 Oct 2018 07:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37957/base-a-practical-de-novo-assembler-for-large-genomes-using-long-ngs-reads</link>
	<title><![CDATA[BASE: a practical de novo assembler for large genomes using long NGS reads]]></title>
	<description><![CDATA[<p><span>new&nbsp;</span><em>de novo</em><span>&nbsp;assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.</span></p><p>Address of the bookmark: <a href="https://github.com/dhlbh/BASE" rel="nofollow">https://github.com/dhlbh/BASE</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</guid>
	<pubDate>Thu, 09 Mar 2023 02:48:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44229/common-steps-for-reads-mapping</link>
	<title><![CDATA[Common steps for reads mapping !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Mapping reads to a reference genome is an essential step in many types of genomic analysis, such as variant calling and gene expression analysis. Here are some general steps to follow for mapping reads to a genome:</p><ol>
<li>
<p>Choose a read mapper: There are many read mappers available, such as BWA, Bowtie, and HISAT2. Choose a mapper that is appropriate for your type of data and research question.</p>
</li>
<li>
<p>Index the reference genome: Before mapping reads, the reference genome needs to be indexed. This involves creating an index of the genome sequence that allows the mapper to quickly find matches to the reads. Most mappers have their own indexing tools.</p>
</li>
<li>
<p>Prepare the read data: The reads should be in a format that is compatible with the mapper. Most mappers accept FASTQ or BAM files. Depending on the quality of the data, it may need to be filtered or trimmed before mapping.</p>
</li>
<li>
<p>Run the mapper: The mapper is run with the command-line interface or using a graphical user interface. The specific command depends on the mapper being used, but typically involves specifying the input data, reference genome, and output file format.</p>
</li>
<li>
<p>Evaluate the mapping results: After the mapping is complete, the results should be evaluated. This includes assessing the quality of the mapping, such as the mapping rate, the number of mapped reads, and the mapping quality score.</p>
</li>
<li>
<p>Post-processing: Depending on the analysis being performed, post-processing of the mapped reads may be necessary. This can include filtering reads based on quality, removing duplicate reads, and calling variants.</p>
</li>
</ol><p>Overall, mapping reads to a reference genome is a complex process that requires careful consideration of the type of data, the research question, and the specific mapper being used.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</guid>
	<pubDate>Wed, 13 May 2020 10:23:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</link>
	<title><![CDATA[Filtlong: quality filtering tool for long reads]]></title>
	<description><![CDATA[<p>Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the filter.</p>
<p>Filtlong builds into a stand-alone executable:</p>
<pre><code>git clone https://github.com/rrwick/Filtlong.git
cd Filtlong
make -j
bin/filtlong -h
</code></pre><p>Address of the bookmark: <a href="https://github.com/rrwick/Filtlong" rel="nofollow">https://github.com/rrwick/Filtlong</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42139/mixtures-a-novel-tool-for-bacterial-strain-reconstruction-from-reads</guid>
	<pubDate>Fri, 21 Aug 2020 08:23:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42139/mixtures-a-novel-tool-for-bacterial-strain-reconstruction-from-reads</link>
	<title><![CDATA[mixtureS: a novel tool for bacterial strain reconstruction from reads]]></title>
	<description><![CDATA[<div>
<p>mixtureS that can de novo identify bacterial strains from shotgun reads of a clonal or metagenomic sample, without prior knowledge about the strains and their variations. Tested on 243 simulated datasets and 195 experimental datasets, mixtureS reliably identified the strains, their numbers and their abundance. Compared with three tools, mixtureS showed better performance in almost all simulated datasets and the vast majority of experimental datasets.</p>
</div>
<div>
<div>Availability</div>
<p>The source code and tool mixtureS is available at&nbsp;<a href="http://www.cs.ucf.edu/~xiaoman/mixtureS/" target="_blank">http://www.cs.ucf.edu/&tilde;xiaoman/mixtureS/</a>.</p>
</div><p>Address of the bookmark: <a href="http://www.cs.ucf.edu/~xiaoman/mixtureS/" rel="nofollow">http://www.cs.ucf.edu/~xiaoman/mixtureS/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</guid>
	<pubDate>Wed, 15 Jun 2016 17:18:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27839/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads-such-those-produced-by-pacific-biosciences-sequencing-machines</link>
	<title><![CDATA[LoRMA: a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines]]></title>
	<description><![CDATA[<p>LoRMA is a tool for correcting sequencing errors in long reads such those produced by Pacific Biosciences sequencing machines.</p>
<p>Publication:</p>
<ul>
<li>L. Salmela, R. Walve, E. Rivals, and E. Ukkonen: Accurate selfcorrection of errors in long reads using de Bruijn graphs. Accepted to RECOMB-Seq 2016.</li>
</ul>
<p>Download:</p>
<ul>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/LoRMA-0.3.tar.gz">LoRMA 0.3 source files</a></li>
<li><a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/README.txt">README</a></li>
</ul><p>Address of the bookmark: <a href="https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/" rel="nofollow">https://www.cs.helsinki.fi/u/lmsalmel/LoRMA/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</guid>
	<pubDate>Fri, 13 May 2016 05:25:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</link>
	<title><![CDATA[SATSUMA : Highly sensitive whole-genome synteny alignments.]]></title>
	<description><![CDATA[<p>Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.<br> <br> Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs. <br> <br> You can find the manual <a href="http://satsuma.sourceforge.net/manual.html">here</a>.<br> Download the latest source code from <a href="https://sourceforge.net/projects/satsuma/">here.</a><br> Stable versions can also be downloaded from the <a href="https://www.broadinstitute.org/science/programs/genome-biology/spines">Broad Institute's</a> web site.<br> <br> An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is <a href="http://satsuma.sourceforge.net/faq.html">here</a>.<br> <br> If you use Satsuma in your research, please cite:<br> <a href="http://bioinformatics.oxfordjournals.org/content/26/9/1145.long">Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alf&ouml;ldi, J., Di Palma, F., &amp; Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51</a>.</p>
<p><strong>Tutorial at http://evomics.org/learning/genomics/satsuma/</strong></p><p>Address of the bookmark: <a href="http://satsuma.sourceforge.net/" rel="nofollow">http://satsuma.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</guid>
	<pubDate>Sun, 23 Sep 2018 05:12:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37776/rhat-a-seed-and-extension-based-noisy-long-read-alignment-tool</link>
	<title><![CDATA[rHAT: a seed-and-extension-based noisy long read alignment tool]]></title>
	<description><![CDATA[<p><span>rHAT is a seed-and-extension-based noisy long read alignment tool. It is suitable for aligning 3rd generation sequencing reads which are in large read length with relatively high error rate, especially Pacbio's Single Molecule Read-time (SMRT) sequencing reads.</span></p><p>Address of the bookmark: <a href="https://github.com/dfguan/rHAT" rel="nofollow">https://github.com/dfguan/rHAT</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>