<?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/41592?offset=520</link>
	<atom:link href="https://bioinformaticsonline.com/related/41592?offset=520" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43025/modular-efficient-and-constant-memory-single-cell-rna-seq-preprocessing</guid>
	<pubDate>Mon, 05 Apr 2021 11:19:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43025/modular-efficient-and-constant-memory-single-cell-rna-seq-preprocessing</link>
	<title><![CDATA[Modular, efficient and constant-memory single-cell RNA-seq preprocessing]]></title>
	<description><![CDATA[<p>With&nbsp;<strong>kallisto | bustools</strong>&nbsp;you can</p>
<ul>
<li>Generate a&nbsp;<em>cell x gene</em>&nbsp;or&nbsp;<em>cell x transcript equivalence class</em>&nbsp;count matrix</li>
<li>Perform RNA velocity and single-nuclei RNA-seq analsis</li>
<li>Quantify data from numerous technologies such as 10x, inDrops, and Dropseq.</li>
<li>Customize workflows for new technologies and protocols.</li>
<li>Process feature barcoding data such as CITE-seq, REAP-seq, MULTI-seq, Clicktags, and Perturb-seq.</li>
<li>Obtain QC reports from single-cell RNA-seq data</li>
</ul>
<p>The&nbsp;<strong>kallisto | bustools</strong>&nbsp;workflow is described in:</p>
<p>P&aacute;ll Melsted*, A. Sina Booeshaghi*, Lauren Liu, Fan Gao, Lambda Lu, Kyung Hoi (Joseph) Min, Eduardo da Veiga Beltrame, Kristj&aacute;n Eldj&aacute;rn Hj&ouml;rleifsson, Jase Gehring &amp; Lior Pachter&dagger;&nbsp;<a href="https://doi.org/10.1038/s41587-021-00870-2" target="_blank">Modular and efficient pre-processing of single-cell RNA-seq</a>, Nature Biotechnology (2021).</p>
<p>&nbsp;</p>
<p><span>Documentation and tutorials for the kallisto bustools workflow are available at&nbsp;</span><a href="http://pachterlab.github.io/kallistobustools">http://pachterlab.github.io/kallistobustools</a><span>.&nbsp;</span></p>
<p>https://www.nature.com/articles/s41587-021-00870-2</p><p>Address of the bookmark: <a href="https://pachterlab.github.io/kallistobustools/" rel="nofollow">https://pachterlab.github.io/kallistobustools/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</guid>
	<pubDate>Fri, 08 Dec 2017 14:41:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34565/fogsaa-fast-optimal-global-sequence-alignment-algorithm</link>
	<title><![CDATA[FOGSAA: Fast Optimal Global Sequence Alignment Algorithm]]></title>
	<description><![CDATA[<p>Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.</p><p>Address of the bookmark: <a href="http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm" rel="nofollow">http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</guid>
	<pubDate>Thu, 24 May 2018 08:33:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</link>
	<title><![CDATA[minialign: fast and accurate alignment tool for PacBio and Nanopore long reads]]></title>
	<description><![CDATA[Minialign is a little bit fast and moderately accurate nucleotide sequence alignment tool designed for PacBio and Nanopore long reads. It is built on three key algorithms, minimizer-based index of the minimap overlapper, array-based seed chaining, and SIMD-parallel Smith-Waterman-Gotoh extension.<p>Address of the bookmark: <a href="https://github.com/ocxtal/minialign" rel="nofollow">https://github.com/ocxtal/minialign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37937/frodock-20-fast-protein%E2%80%93protein-docking-server</guid>
	<pubDate>Wed, 17 Oct 2018 04:31:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37937/frodock-20-fast-protein%E2%80%93protein-docking-server</link>
	<title><![CDATA[FRODOCK 2.0: fast protein–protein docking server]]></title>
	<description><![CDATA[<p><span>frodock: a&nbsp;user-friendly protein&ndash;protein docking server based on an improved version of FRODOCK that includes a complementary knowledge-based potential. The web interface provides a very effective tool to explore and select protein&ndash;protein models and interactively screen them against experimental distance constraints. The competitive success rates and efficiency achieved allow the retrieval of reliable potential protein&ndash;protein binding conformations that can be further refined with more computationally demanding strategies.</span></p><p>Address of the bookmark: <a href="http://frodock.chaconlab.org/" rel="nofollow">http://frodock.chaconlab.org/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</guid>
	<pubDate>Wed, 13 Nov 2019 22:20:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40251/mosdepth-fast-bamcram-depth-calculation-for-wgs-exome-or-targeted-sequencing</link>
	<title><![CDATA[mosdepth: fast BAM/CRAM depth calculation for WGS, exome, or targeted sequencing]]></title>
	<description><![CDATA[<p>mosdepth can output:</p>
<p>per-base depth about 2x as fast samtools depth--about 25 minutes of CPU time for a 30X genome.<br>mean per-window depth given a window size--as would be used for CNV calling.<br>the mean per-region given a BED file of regions.<br>a distribution of proportion of bases covered at or above a given threshold for each chromosome and genome-wide.<br>quantized output that merges adjacent bases as long as they fall in the same coverage bins e.g. (10-20)<br>threshold output to indicate how many bases in each region are covered at the given thresholds.<br>A summary of mean depths per chromosome and within specified regions per chromosome.</p><p>Address of the bookmark: <a href="https://github.com/brentp/mosdepth" rel="nofollow">https://github.com/brentp/mosdepth</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</guid>
	<pubDate>Mon, 18 Jan 2021 10:47:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42645/mmseqs2-ultra-fast-and-sensitive-sequence-search-and-clustering-suite</link>
	<title><![CDATA[MMseqs2: ultra fast and sensitive sequence search and clustering suite]]></title>
	<description><![CDATA[<p><span>MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/MMseqs2" rel="nofollow">https://github.com/soedinglab/MMseqs2</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</guid>
	<pubDate>Tue, 13 Aug 2024 07:16:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44641/heliano-a-fast-and-accurate-tool-for-detection-of-helitron-like-elements</link>
	<title><![CDATA[HELIANO: A fast and accurate tool for detection of Helitron-like elements]]></title>
	<description><![CDATA[<p><span>Helitron-like elements (HLE1 and HLE2) are DNA transposons. They have been found in diverse species and seem to play significant roles in the evolution of host genomes. Although known for over twenty years, Helitron sequences are still challenging to identify. Here, we propose HELIANO (Helitron-like elements annotator) as an efficient solution for detecting Helitron-like elements.</span></p>
<p>https://academic.oup.com/nar/advance-article/doi/10.1093/nar/gkae679/7730539?login=true</p><p>Address of the bookmark: <a href="https://github.com/Zhenlisme/heliano/" rel="nofollow">https://github.com/Zhenlisme/heliano/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</guid>
	<pubDate>Tue, 17 Sep 2013 16:48:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4590/tigers-genome-sequenced</link>
	<title><![CDATA[Tigers genome sequenced]]></title>
	<description><![CDATA[<p>Fifteen scientists led by Dr Jong Bhak of Genome Research Foundation, South Korea, decoded as many as 3 billion nucleotides (organic molecules that form the basic building blocks of nucleic acids, such as DNA). They identified 20,000 genes related to various functions of the tiger.&nbsp;</p><p>The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.</p><p>The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.</p><p>Reference:</p><p><a href="http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690">http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690</a></p><p><a href="http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms">http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms</a></p><p>Paper:</p><p><a href="http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html">http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>