<?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/40889?offset=170</link>
	<atom:link href="https://bioinformaticsonline.com/related/40889?offset=170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42310/dada2-fast-and-accurate-sample-inference-from-amplicon-data-with-single-nucleotide-resolution</guid>
	<pubDate>Tue, 10 Nov 2020 20:26:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42310/dada2-fast-and-accurate-sample-inference-from-amplicon-data-with-single-nucleotide-resolution</link>
	<title><![CDATA[DADA2: Fast and accurate sample inference from amplicon data with single-nucleotide resolution]]></title>
	<description><![CDATA[<p>The&nbsp;<a href="https://benjjneb.github.io/dada2/tutorial.html">DADA2 tutorial</a>&nbsp;goes through a typical workflow for paired end Illumina Miseq data: raw amplicon sequencing data is processed into the table of exact&nbsp;<strong>amplicon sequence variants (ASVs)</strong>&nbsp;present in each sample.</p>
<p>The&nbsp;<a href="https://benjjneb.github.io/dada2/bigdata.html">DADA2 Workflow on Big Data</a>&nbsp;goes through workflow optimized to run on large datasets (10s of millions to billions of reads).</p>
<p>An&nbsp;<a href="https://benjjneb.github.io/dada2/ITS_workflow.html">ITS-specific version of the DADA2 workflow</a>&nbsp;identifies and verifiably removes primers on both ends of each ITS read, a key step due to the variable length of the ITS region.</p>
<p>Short demonstrations of&nbsp;<a href="https://benjjneb.github.io/dada2/assign.html">assigning taxonomy</a>&nbsp;and&nbsp;<a href="https://benjjneb.github.io/dada2/assign.html">assigning species</a>&nbsp;to sequences.</p><p>Address of the bookmark: <a href="https://benjjneb.github.io/dada2/index.html" rel="nofollow">https://benjjneb.github.io/dada2/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42415/sneakysnake-a-fast-and-accurate-universal-genome-pre-alignment-filter-for-cpus-gpus-and-fpgas</guid>
	<pubDate>Sun, 20 Dec 2020 01:39:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42415/sneakysnake-a-fast-and-accurate-universal-genome-pre-alignment-filter-for-cpus-gpus-and-fpgas</link>
	<title><![CDATA[SneakySnake: A Fast and Accurate Universal Genome Pre-Alignment Filter for CPUs, GPUs, and FPGAs]]></title>
	<description><![CDATA[<p><span>The first and the only pre-alignment filtering algorithm that works efficiently and fast on modern CPU, FPGA, and GPU architectures. SneakySnake greatly (by more than two orders of magnitude) expedites sequence alignment calculation for both short (Illumina) and long (ONT and PacBio) reads. Described by Alser et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/abs/1910.09020">https://arxiv.org/abs/1910.09020</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/SneakySnake" rel="nofollow">https://github.com/CMU-SAFARI/SneakySnake</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</guid>
	<pubDate>Fri, 05 Jan 2018 04:04:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35059/lrcstats-long-read-correction-statistics</link>
	<title><![CDATA[LRCstats: Long Read Correction Statistics]]></title>
	<description><![CDATA[<p>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</p>
<p>Of course, some long read correction algorithms are better than others, and developers of long read correction algorithms will wish to compare their algorithm with others currently available. LRCstats benchmarks long read correction algorithms using long reads produced by simulators (such as SimLoRD or PBSim) where the two-way alignments between the uncorrected long reads (uLR) and the corresponding sequences in the reference genome (Ref) are given in some sort of alignment file and then aligning the corrected long reads (cLR) to the Ref-uLR two-way alignments to create three-way alignments using a dynamic programming algorithm. Statistics on these three-way alignments are then collected, such as the overall error rates of the corrected long reads.</p>
<p>https://www.healthcare.uiowa.edu/labs/au/LSC/</p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</guid>
	<pubDate>Fri, 05 Jan 2018 04:12:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</link>
	<title><![CDATA[proovread : large-scale high-accuracy PacBio correction through iterative short read consensus]]></title>
	<description><![CDATA[<p>proovread : large-scale high-accuracy PacBio correction through iterative short read consensus</p>
<ul>
<li>outperforms PacBioToCA/LSC in terms of accuracy and contiguity/sensitivity (<a href="http://dx.doi.org/10.1093/bioinformatics/btu392">http://dx.doi.org/10.1093/bioinformatics/btu392</a>)</li>
<li>is easy to install/run/configure</li>
<li>supports various types of dat
<ul>
<li><strong>HiSeq/MiSeq&nbsp;</strong>(100-500bp)</li>
<li><strong>Unitigs</strong></li>
<li>454, ...</li>
</ul>
</li>
</ul>
<p>proovread maps high coverage data to pacbio reads (bwa mem, blasr, daligner) in multiple iterations.</p><p>Address of the bookmark: <a href="https://github.com/BioInf-Wuerzburg/proovread" rel="nofollow">https://github.com/BioInf-Wuerzburg/proovread</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</guid>
	<pubDate>Mon, 18 May 2020 16:28:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</link>
	<title><![CDATA[medaka: Sequence correction provided by ONT Research]]></title>
	<description><![CDATA[<p><code>medaka</code><span>&nbsp;is a tool to create a consensus sequence from nanopore sequencing data. This task is performed using neural networks applied from a pileup of individual sequencing reads against a draft assembly. It outperforms graph-based methods operating on basecalled data, and can be competitive with state-of-the-art signal-based methods, whilst being much faster.</span></p><p>Address of the bookmark: <a href="https://github.com/nanoporetech/medaka" rel="nofollow">https://github.com/nanoporetech/medaka</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</guid>
	<pubDate>Mon, 04 Nov 2019 07:09:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40217/shouji-a-fast-and-efficient-pre-alignment-filter-for-sequence-alignment</link>
	<title><![CDATA[Shouji: a fast and efficient pre-alignment filter for sequence alignment]]></title>
	<description><![CDATA[<p>The ability to generate massive amounts of sequencing data continues to overwhelm the processing capacity of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes.</p>
<p>&nbsp;<img src="https://github.com/BilkentCompGen/Shoji/raw/master/Figure1-GitHub.png" alt="image" style="border: 0px;"></p>
<p>We introduce Shouji, a highly parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator design that adopts modern FPGA (field-programmable gate array) architectures to further boost the performance of our algorithm.</p>
<p>More at <a href="https://github.com/CMU-SAFARI/Shouji">https://github.com/CMU-SAFARI/Shouji</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Shouji" rel="nofollow">https://github.com/CMU-SAFARI/Shouji</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</guid>
	<pubDate>Mon, 13 Nov 2017 05:10:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34292/automatic-filtering-trimming-error-removing-and-quality-control-for-fastq-data</link>
	<title><![CDATA[Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data]]></title>
	<description><![CDATA[<p><span>Automatic Filtering, Trimming, Error Removing and Quality Control for fastq data</span><br><code>AfterQC</code><span>&nbsp;can simply go through all fastq files in a folder and then output three folders:&nbsp;</span><span>good</span><span>,&nbsp;</span><span>bad</span><span>&nbsp;and&nbsp;</span><span>QC</span><span>&nbsp;folders, which contains good reads, bad reads and the QC results of each fastq file/pair.</span><br><span>Currently it supports processing data from HiSeq 2000/2500/3000/4000, Nextseq 500/550, MiniSeq...and other&nbsp;</span><a href="http://support.illumina.com/help/SequencingAnalysisWorkflow/Content/Vault/Informatics/Sequencing_Analysis/CASAVA/swSEQ_mCA_FASTQFiles.htm">Illumina 1.8 or newer formats</a></p><p>Address of the bookmark: <a href="https://github.com/OpenGene/AfterQC" rel="nofollow">https://github.com/OpenGene/AfterQC</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43587/fix-rewritable-error-of-elgg</guid>
	<pubDate>Mon, 15 Nov 2021 06:23:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43587/fix-rewritable-error-of-elgg</link>
	<title><![CDATA[Fix rewritable error of ELGG !]]></title>
	<description><![CDATA[<p>The&nbsp;<code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;module uses a rule-based rewriting engine, based on a PCRE regular-expression parser, to rewrite requested URLs on the fly. By default,&nbsp;<code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;maps a URL to a filesystem path. However, it can also be used to redirect one URL to another URL, or to invoke an internal proxy fetch.</p>
<p><code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;provides a flexible and powerful way to manipulate URLs using an unlimited number of rules. Each rule can have an unlimited number of attached rule conditions, to allow you to rewrite URL based on server variables, environment variables, HTTP headers, or time stamps.</p>
<p><code><a href="https://httpd.apache.org/docs/2.4/mod/mod_rewrite.html">mod_rewrite</a></code>&nbsp;operates on the full URL path, including the path-info section. A rewrite rule can be invoked in&nbsp;<code>httpd.conf</code>&nbsp;or in&nbsp;<code>.htaccess</code>. The path generated by a rewrite rule can include a query string, or can lead to internal sub-processing, external request redirection, or internal proxy throughput.</p>
<p>Further details, discussion, and examples, are provided in the&nbsp;<a href="https://httpd.apache.org/docs/2.4/rewrite/">detailed mod_rewrite documentation</a>.</p>
<p>&nbsp;</p>
<ul>
<li>sudo a2enmod rewrite</li>
</ul>
<ul>
<li>sudo systemctl restart apache2</li>
</ul>
<ul>
<li>sudo nano /etc/apache2/sites-available/000-default.conf</li>
</ul>
<p>Write this</p>
<div title="/etc/apache2/sites-available/000-default.conf">/etc/apache2/sites-available/000-default.conf</div>
<div>
<div>
<pre><code><span>&lt;</span>VirtualHost *:8<span><span>0</span>&gt;</span>
    <span></span><span><span>&lt;</span>Directory /var/www/html<span>&gt;</span></span><span></span>
        <span>Options Indexes FollowSymLinks MultiViews</span>
        <span>AllowOverride All</span>
        <span>Require all granted</span>
    <span></span><span><span>&lt;</span>/Directory<span>&gt;</span></span><span></span>

    <span>.</span> <span>.</span> <span>.</span>
<span>&lt;</span>/VirtualHost<span>&gt;</span></code></pre>
</div>
</div><p>Address of the bookmark: <a href="https://www.digitalocean.com/community/tutorials/how-to-rewrite-urls-with-mod_rewrite-for-apache-on-ubuntu-18-04" rel="nofollow">https://www.digitalocean.com/community/tutorials/how-to-rewrite-urls-with-mod_rewrite-for-apache-on-ubuntu-18-04</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/2991/illumina-reveals-first-dataset-of-long-reads</guid>
	<pubDate>Fri, 23 Aug 2013 06:29:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/2991/illumina-reveals-first-dataset-of-long-reads</link>
	<title><![CDATA[Illumina reveals first dataset of long reads]]></title>
	<description><![CDATA[<p>With the help of Moleculo technology , acquired by Illumina releases new service for long reads sequencing i.e., &nbsp;<a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">FastTrack Long Reads</a>.</p><p>Average read length is around<span>&nbsp;8,500 base pairs in release dataset.</span>&nbsp;Best thing about this, there is not much effect on cost and quality of data.</p><p>You can also check following pages for publications on long reads and more:</p><p><a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">http://www.illumina.com/services/long-read-sequencing-service.ilmn</a></p><p><a href="http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/">http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/</a></p><p>&nbsp;</p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>