<?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/34528?offset=420</link>
	<atom:link href="https://bioinformaticsonline.com/related/34528?offset=420" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</guid>
	<pubDate>Tue, 28 Jan 2020 03:27:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40701/fastgt-an-alignment-free-method-for-calling-common-snvs-directly-from-raw-sequencing-reads</link>
	<title><![CDATA[FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads]]></title>
	<description><![CDATA[<p>FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.</p>
<p><a href="http://bioinfo.ut.ee/FastGT/">http://bioinfo.ut.ee/FastGT/</a></p>
<p><strong><a href="https://github.com/bioinfo-ut/GenomeTester4/">https://github.com/bioinfo-ut/GenomeTester4/</a></strong></p><p>Address of the bookmark: <a href="http://bioinfo.ut.ee/FastGT/" rel="nofollow">http://bioinfo.ut.ee/FastGT/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</guid>
	<pubDate>Mon, 17 Aug 2020 05:21:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42130/shaman-a-user-friendly-website-for-metataxonomic-analysis-from-raw-reads-to-statistical-analysis</link>
	<title><![CDATA[SHAMAN: a user-friendly website for metataxonomic analysis from raw reads to statistical analysis]]></title>
	<description><![CDATA[<p><span>SHAMAN is a shiny application for differential analysis of metagenomic data (16S, 18S, 23S, 28S, ITS and WGS) including bioinformatics treatment of raw reads for targeted metagenomics, statistical analysis and results visualization with a large variety of plots (barplot, boxplot, heatmap, &hellip;).</span><br><span>The bioinformatics treatment is based on Vsearch [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/27781170">Rognes 2016</a><span>] which showed to be both accurate and fast [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/26664811">Wescott 2015</a><span>].The statistical analysis is based on DESeq2 R package [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/20979621">Anders and Huber 2010</a><span>] which robustly identifies the differential abundant features as suggested in [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3974642/">McMurdie and Holmes 2014</a><span>] and [</span><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4727335/">Jonsson2016</a><span>]. SHAMAN robustly identifies the differential abundant genera with the Generalized Linear Model implemented in DESeq2 [</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/25516281">Love 2014</a><span>].</span><br><span>SHAMAN is compatible with standard formats for metagenomic analysis (.csv, .tsv, .biom) and figures can be downloaded in several formats. A presentation about SHAMAN is available&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_presentation.pdf">here</a><span>&nbsp;and a poster&nbsp;</span><a href="https://github.com/aghozlane/shaman/blob/master/www/shaman_poster.pdf">here</a><span>.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4</a></span></p><p>Address of the bookmark: <a href="https://github.com/aghozlane/shaman" rel="nofollow">https://github.com/aghozlane/shaman</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</guid>
	<pubDate>Sun, 14 Mar 2021 09:42:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</link>
	<title><![CDATA[AlignGraph2: similar genome-assisted reassembly pipeline for PacBio long reads]]></title>
	<description><![CDATA[<p><span>AlignGraph2 is the second version of&nbsp;</span><a href="https://github.com/baoe/AlignGraph">AlignGraph</a><span>&nbsp;for PacBio long reads. It extends and refines contigs assembled from the long reads with a published genome similar to the sequencing genome.</span></p>
<p><span>More at&nbsp;https://academic.oup.com/bib/advance-article-abstract/doi/10.1093/bib/bbab022/6146772</span></p><p>Address of the bookmark: <a href="https://github.com/huangs001/AlignGraph2" rel="nofollow">https://github.com/huangs001/AlignGraph2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</guid>
	<pubDate>Thu, 09 Mar 2023 02:56:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</link>
	<title><![CDATA[Steps to find palindrome in genomes !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Palindromes are sequences of nucleotides that read the same backward as forward. They can be present in genomes and have various biological functions. Here are some methods for discovering palindromes in genomes:</p><ol>
<li>
<p>Direct sequence search: One of the simplest ways to discover palindromes is to search the genome sequence directly for palindromic sequences using pattern matching tools, such as regular expressions or string algorithms. This approach can be useful for discovering simple palindromes, but may miss more complex palindromic structures.</p>
</li>
<li>
<p>Dot plot analysis: Dot plot analysis is a graphical method that can be used to identify palindromic regions in a genome. It involves plotting the genome sequence against itself and examining the diagonal patterns that emerge. Palindromic regions will appear as symmetrical patterns along the diagonal.</p>
</li>
<li>
<p>Restriction enzyme analysis: Some restriction enzymes, such as EcoRI and HindIII, recognize palindromic sequences and cleave DNA at these sites. By digesting the genome with these enzymes and examining the resulting fragments, palindromic regions can be identified.</p>
</li>
<li>
<p>Next-generation sequencing: High-throughput sequencing technologies, such as PacBio and Oxford Nanopore, can generate long reads that can span entire palindromic regions. By mapping these reads to the genome, palindromic regions can be identified and characterized.</p>
</li>
<li>
<p>Comparative genomics: Comparing the genomes of related species can also reveal palindromic regions that are conserved across evolutionarily divergent lineages. This approach can help identify functional palindromes that are under selective pressure.</p>
</li>
</ol><p>Overall, the discovery of palindromic sequences in genomes can be accomplished using a variety of methods, each with their own advantages and limitations. A combination of these methods can provide a comprehensive understanding of the palindromic landscape of a genome.</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/27080/mrfast-micro-read-fast-alignment-search-tool</guid>
	<pubDate>Tue, 26 Apr 2016 03:50:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27080/mrfast-micro-read-fast-alignment-search-tool</link>
	<title><![CDATA[mrFAST:  Micro Read Fast Alignment Search Tool]]></title>
	<description><![CDATA[<p><span>mrFAST is a read mapper that is designed to map short reads to reference genome with a special emphasis on the discovery of structural variation and segmental duplications. mrFAST maps short reads with respect to user defined error threshold, including indels up to 4+4 bp. This manual, describes how to choose the parameters and tune mrFAST with respect to the library settings. mrFAST is designed to find&nbsp;</span><strong><span style="text-decoration: underline;">'all'</span></strong><span>&nbsp; mappings for a given set of reads, however it can return one "best" map location if the relevant parameter is invoked.</span></p>
<p><span>More at&nbsp;http://mrfast.sourceforge.net/manual.html</span></p><p>Address of the bookmark: <a href="http://mrfast.sourceforge.net/manual.html" rel="nofollow">http://mrfast.sourceforge.net/manual.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30555/yaha</guid>
	<pubDate>Fri, 20 Jan 2017 05:38:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30555/yaha</link>
	<title><![CDATA[YAHA]]></title>
	<description><![CDATA[<p>YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.</p>
<p><strong>Availability:</strong> YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from <a href="http://faculty.virginia.edu/irahall/YAHA" target="pmc_ext">http://faculty.virginia.edu/irahall/YAHA</a>.</p>
<p><strong>Contact:</strong></p>
<p>http://genome.wustl.edu/people/groups/detail/hall-lab/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Wed, 08 Nov 2017 11:40:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span><span>Illumina Sequencing data can provide high coverage of a genome by relatively short (most often 100 bp to 150 bp) reads at a low cost. Even with low (advertised 1%) error rate, 100 &times; coverage Illumina data on average has an error in some read at every base in the genome. These errors make handling the data more complicated because they result in a large number of low-count erroneous&nbsp;</span><em>k</em><span>-mers in the reads. However, there is enough information in the reads to correct most of the sequencing errors, thus making subsequent use of the data (e.g. for mapping or assembly) easier. Here we use the term &ldquo;error correction&rdquo; to denote the reduction in errors due to both changes in individual bases and trimming of unusable sequence. We developed an error correction software called QuorUM. QuorUM is mainly aimed at error correcting Illumina reads for subsequent assembly. It is designed around the novel idea of minimizing the number of distinct erroneous&nbsp;</span><em>k</em><span>-mers in the output reads and preserving the most true&nbsp;</span><em>k</em><span>-mers, and we introduce a composite statistic &pi; that measures how successful we are at achieving this dual goal. We evaluate the performance of QuorUM by correcting actual Illumina reads from genomes for which a reference assembly is available.</span></span></p>
<p><span>QuorUM is distributed as an independent software package and as a module of the MaSuRCA assembly software. Both are available under the GPL open source license at&nbsp;</span><a href="http://www.genome.umd.edu/">http://www.genome.umd.edu</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span>We produce trimmed and error-corrected reads that result in assemblies with longer contigs and fewer errors. We compared QuorUM against several published error correctors and found that it is the best performer in most metrics we use. QuorUM is efficiently implemented making use of current multi-core computing architectures and it is suitable for large data sets (1 billion bases checked and corrected per day per core)</span></p><p>Address of the bookmark: <a href="http://www.genome.umd.edu/" rel="nofollow">http://www.genome.umd.edu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44758/the-ifs-and-buts-of-ngs-quality-control-and-trimming</guid>
	<pubDate>Thu, 02 Jan 2025 20:11:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44758/the-ifs-and-buts-of-ngs-quality-control-and-trimming</link>
	<title><![CDATA[The &quot;Ifs&quot; and &quot;Buts&quot; of NGS Quality Control and Trimming]]></title>
	<description><![CDATA[<p>Next-Generation Sequencing (NGS) has revolutionized biological research, providing vast amounts of data for a wide range of applications. However, the reliability of NGS analyses heavily depends on the quality of raw sequencing data. Quality control (QC) and trimming are critical preprocessing steps that can make or break your downstream analyses. In this blog, we explore the "ifs" (why you should perform QC and trimming) and the "buts" (challenges or considerations) of this vital step in NGS workflows.</p><h3><strong>The "Ifs" of NGS QC and Trimming</strong></h3><ol>
<li>
<p><strong>Ensures Data Integrity</strong><br />If you want to minimize errors in downstream analyses, QC and trimming remove low-quality reads and bases, ensuring high-confidence data. This step is essential for reliable variant calling, assembly, and other applications.</p>
</li>
<li>
<p><strong>Removes Contaminants</strong><br />If adapter sequences or contaminants are present in the raw reads, trimming can eliminate them. This prevents issues like misalignment or incorrect biological interpretations, ensuring cleaner data for analysis.</p>
</li>
<li>
<p><strong>Improves Mapping and Assembly</strong><br />If your goal is better alignment to a reference genome or improved de novo assembly, trimming low-quality bases and adapters is critical. High-quality reads map more efficiently and generate more accurate assemblies.</p>
</li>
<li>
<p><strong>Reduces Computational Load</strong><br />If you want to save computational resources, trimming reduces the dataset size, which speeds up processing and analysis. Clean datasets mean less computational time spent on processing low-quality data.</p>
</li>
<li>
<p><strong>Prepares for Standardized Analyses</strong><br />If your project involves multiple datasets, QC and trimming ensure uniformity across them. This standardization makes comparisons valid and reproducible, particularly in large collaborative studies.</p>
</li>
</ol><h3><strong>The "Buts" of NGS QC and Trimming</strong></h3><ol>
<li>
<p><strong>Risk of Over-Trimming</strong><br />But excessive trimming can lead to the loss of informative sequences, reducing read depth and potentially discarding biologically relevant data. This is especially critical in studies with limited sequencing depth.</p>
</li>
<li>
<p><strong>Bias Introduction</strong><br />But trimming algorithms might introduce biases, especially if they inadvertently remove sequences with specific biological patterns. This can skew results and compromise biological insights.</p>
</li>
<li>
<p><strong>Loss of Context in Paired-End Reads</strong><br />But trimming one read in a pair more than the other can lead to loss of pairing information. This complicates downstream analyses that rely on paired-end data, such as structural variant detection.</p>
</li>
<li>
<p><strong>Time and Resource Intensive</strong><br />But running QC and trimming for large datasets can be computationally expensive and time-consuming. As sequencing depth increases, preprocessing becomes a bottleneck in the analysis pipeline.</p>
</li>
<li>
<p><strong>Variable Standards</strong><br />But the criteria for trimming (e.g., quality threshold, minimum read length) can vary between tools and datasets. This variability may affect reproducibility and comparability of results across studies.</p>
</li>
</ol><h3><strong>Balancing the "Ifs" and "Buts"</strong></h3><p>To maximize the benefits of QC and trimming while mitigating the challenges, consider the following best practices:</p><ul>
<li>
<p><strong>Use QC Tools Wisely:</strong> Start with tools like <strong>FastQC</strong> to identify quality issues in your raw data. Visualizing quality metrics helps tailor your trimming parameters.</p>
</li>
<li>
<p><strong>Choose Reliable Trimming Tools:</strong> Tools like <strong>Trimmomatic</strong>, <strong>Cutadapt</strong>, and <strong>BBduk</strong> offer adaptive and customizable trimming options. Select one that aligns with your dataset and project goals.</p>
</li>
<li>
<p><strong>Set Reasonable Parameters:</strong> Avoid over-trimming by setting quality thresholds and minimum read lengths that balance data retention and quality improvement.</p>
</li>
<li>
<p><strong>Test Downstream Effects:</strong> Validate the impact of QC and trimming on downstream analyses, such as alignment efficiency, variant calling accuracy, or assembly quality.</p>
</li>
<li>
<p><strong>Document Your Workflow:</strong> Maintain detailed records of the parameters and tools used for QC and trimming. This ensures reproducibility and enables better troubleshooting.</p>
</li>
</ul><h3><strong>Conclusion</strong></h3><p>NGS quality control and trimming are essential steps to ensure reliable and accurate data for analysis. While the "ifs" highlight the clear benefits of these steps, the "buts" remind us of the potential pitfalls. By adopting best practices and carefully balancing these considerations, you can optimize your preprocessing workflow and unlock the full potential of your sequencing data.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</guid>
	<pubDate>Tue, 02 Feb 2016 10:11:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26252/recombination-detection-tool</link>
	<title><![CDATA[Recombination detection tool]]></title>
	<description><![CDATA[<p>A program to detect recombination hotspots using population genetic data.</p>
<p>More at https://github.com/auton1/LDhot</p><p>Address of the bookmark: <a href="https://github.com/auton1/LDhot" rel="nofollow">https://github.com/auton1/LDhot</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>