<?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/42413?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/42413?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Mon, 17 Aug 2020 05:25:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p>SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol>
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43353/judi-just-do-it</guid>
	<pubDate>Mon, 06 Sep 2021 02:44:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43353/judi-just-do-it</link>
	<title><![CDATA[JUDI: Just Do It]]></title>
	<description><![CDATA[<p><em>judi</em><span>&nbsp;comes from the idea of bringing the power and efficiency of&nbsp;</span><em>doit</em><span>&nbsp;to execute any kind of task under many combinations of parameter settings.</span></p>
<p><span>https://github.com/ncbi/JUDI</span></p><p>Address of the bookmark: <a href="https://github.com/ncbi/JUDI" rel="nofollow">https://github.com/ncbi/JUDI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44375/phyloherb-a-high%E2%80%90throughput-phylogenomic-pipeline-for-processing-genome-skimming-data</guid>
	<pubDate>Wed, 06 Sep 2023 00:14:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44375/phyloherb-a-high%E2%80%90throughput-phylogenomic-pipeline-for-processing-genome-skimming-data</link>
	<title><![CDATA[PhyloHerb: A high‐throughput phylogenomic pipeline for processing genome skimming data]]></title>
	<description><![CDATA[<p dir="auto"><span>Phylo</span>genomic Analysis Pipeline for&nbsp;<span>Herb</span>arium Specimens</p>
<p dir="auto"><span>What is PhyloHerb</span>: PhyloHerb is a wrapper program to process&nbsp;<span>genome skimming</span>&nbsp;data collected from plant materials. The outcomes include the plastid genome (plastome) assemblies, mitochondrial genome assemblies, nuclear ribosomal DNAs (NTS+ETS+18S+ITS1+5.8S+ITS2+28S), alignments of gene and intergenic regions, and a species tree. It is designed to be a high throughput program dealing with lower quality data. Examples include&nbsp;<span>low-coverage (5x cpDNA) plastome phylogeny, recycling plastid genes from target enrichment data, retrieving low-copy nuclear genes from medium coverage (5x nucDNA) genome skimming</span>.</p>
<p dir="auto"><span>License</span>: GNU General Public License</p>
<p dir="auto"><span>Citation</span>:</p>
<ul dir="auto">
<li>Cai, Liming, Hongrui Zhang, and Charles C. Davis. 2022. PhyloHerb: A high‐throughput phylogenomic pipeline for processing genome‐skimming data. Applications in Plant Sciences 10(3): 1&ndash;9.&nbsp;<a href="https://doi.org/10.1002/aps3.11475">https://doi.org/10.1002/aps3.11475</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/lmcai/PhyloHerb/" rel="nofollow">https://github.com/lmcai/PhyloHerb/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44597/imagine-in-silico-metagenomics-pipeline</guid>
	<pubDate>Sat, 06 Jul 2024 04:32:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44597/imagine-in-silico-metagenomics-pipeline</link>
	<title><![CDATA[iMAGine - in silico MetAGenomics pipeline]]></title>
	<description><![CDATA[<p dir="auto"><span>iMAGine</span>&nbsp;is a metagenomic workflow which includes filtering, assembling, and binning.</p>
<p dir="auto">This workflow includes the following tools which are needed to be installed in the system.</p>
<ol dir="auto">
<li><a href="https://github.com/OpenGene/fastp">fastp</a></li>
<li><a href="https://github.com/ablab/spades">spades assembler</a></li>
<li><a href="https://github.com/ablab/quast">QUAST</a></li>
<li><a href="https://github.com/lh3/bwa">bwa</a></li>
<li><a href="https://github.com/samtools/samtools">samtools</a></li>
<li><a href="https://bitbucket.org/berkeleylab/metabat/src/master/">metabat2</a></li>
<li><a href="https://github.com/Ecogenomics/CheckM">CheckM</a></li>
</ol><p>Address of the bookmark: <a href="https://github.com/avishekdutta14/iMAGine" rel="nofollow">https://github.com/avishekdutta14/iMAGine</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36621/hapcut2-robust-and-accurate-haplotype-assembly-for-diverse-sequencing-technologies</guid>
	<pubDate>Tue, 15 May 2018 07:35:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36621/hapcut2-robust-and-accurate-haplotype-assembly-for-diverse-sequencing-technologies</link>
	<title><![CDATA[HapCUT2: robust and accurate haplotype assembly for diverse sequencing technologies]]></title>
	<description><![CDATA[HapCUT2 is a maximum-likelihood-based tool for assembling haplotypes from DNA sequence reads, designed to "just work" with excellent speed and accuracy. We found that previously described haplotype assembly methods are specialized for specific read technologies or protocols, with slow or inaccurate performance on others. With this in mind, HapCUT2 is designed for speed and accuracy across diverse sequencing technologies, including but not limited to:

NGS short reads (Illumina HiSeq)
clone-based sequencing (Fosmid or BAC clones)
SMRT reads (PacBio)
Oxford Nanopore reads
10X Genomics Linked-Reads
proximity-ligation (Hi-C) reads
high-coverage sequencing (&gt;40x coverage-per-SNP) using above technologies
combinations of the above technologies (e.g. scaffold long reads with Hi-C reads)
See below for specific examples of command line options and best practices for some of these technologies.

NOTE: At this time HapCUT2 is for diploid organisms only. VCF input should contain diploid variants.

If you use HapCUT2 in your research, please cite:

Edge, P., Bafna, V. &amp; Bansal, V. HapCUT2: robust and accurate haplotype assembly for diverse sequencing technologies. Genome Res. gr.213462.116 (2016). doi:10.1101/gr.213462.116<p>Address of the bookmark: <a href="https://github.com/vibansal/HapCUT2" rel="nofollow">https://github.com/vibansal/HapCUT2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37650/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</guid>
	<pubDate>Fri, 07 Sep 2018 05:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37650/p-rna-scaffolder-a-fast-and-accurate-genome-scaffolder-using-paired-end-rna-sequencing-reads</link>
	<title><![CDATA[P_RNA_scaffolder: a fast and accurate genome scaffolder using paired-end RNA-sequencing reads]]></title>
	<description><![CDATA[<p><span>P_RNA_scaffolder is a novel scaffolding tool using Pair-end RNA-seq to scaffold genome fragments. The method is suitable for most genomes. The program could utilize Illumina Paired-end RNA-sequencing reads from target speciesies. Our method provides another practical alternative to existing mate-pair_based approaches or other Protein-based approaches (for instance,&nbsp;</span><a href="http://www.fishbrowser.org/software/PEP_scaffolder/">PEP_scaffolder&nbsp;</a><span>) for scaffolding genome sequences. The most important feature of this method is to improve the completeness of gene regions and long-coding gene regions (for instance,&nbsp;</span><a href="http://circrna.org/">circRNA</a><span>).</span></p><p>Address of the bookmark: <a href="http://www.fishbrowser.org/software/P_RNA_scaffolder/#" rel="nofollow">http://www.fishbrowser.org/software/P_RNA_scaffolder/#</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40497/artificial-intelligence-is-more-accurate-than-doctors-in-diagnosing-breast-cancer</guid>
	<pubDate>Wed, 01 Jan 2020 22:12:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40497/artificial-intelligence-is-more-accurate-than-doctors-in-diagnosing-breast-cancer</link>
	<title><![CDATA[Artificial intelligence is more accurate than doctors in diagnosing breast cancer]]></title>
	<description><![CDATA[<p>Artificial intelligence is more accurate than doctors in diagnosing breast cancer from mammograms, a study in the journal Nature suggests.</p><p>An international team, including researchers from&nbsp;<a href="https://health.google/" target="_blank">Google Health</a>&nbsp;and&nbsp;<a href="https://www.imperial.ac.uk/news/183293/research-collaboration-aims-improve-breast-cancer/" target="_blank">Imperial College London</a>, designed and trained a computer model on X-ray images from nearly 29,000 women.</p><p>The algorithm&nbsp;<a href="https://nature.com/articles/s41586-019-1799-6" target="_blank">outperformed six radiologists</a>&nbsp;in reading mammograms.</p><p>AI was still as good as two doctors working together.</p><p>Unlike humans, AI is tireless. Experts say it could improve detection. Read More:&nbsp;<a href="https://www.bbc.com/news/health-50857759" target="_blank">https://www.bbc.com/news/health-50857759</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</guid>
	<pubDate>Fri, 27 Mar 2020 22:49:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41501/hicanu-accurate-assembly-of-segmental-duplications-satellites-and-allelic-variants-from-high-fidelity-long-reads</link>
	<title><![CDATA[HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads]]></title>
	<description><![CDATA[<p><span>HiCanu, a significant modification of the Canu assembler designed to leverage the full potential of HiFi reads via homopolymer compression, overlap-based error correction, and aggressive false overlap filtering.&nbsp;</span></p>
<p>More at&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3?fbclid=IwAR2PaN4GLjvAZpWmCE2q0EWk2dtwY7wiKxVlXn9PPG7OBSP06PP2gcCrv3A">https://www.biorxiv.org/content/10.1101/2020.03.14.992248v3</a></p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42826/ktrim-an-extra-fast-and-accurate-adapter-and-quality-trimmer-for-sequencing-data</guid>
	<pubDate>Thu, 11 Feb 2021 21:39:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42826/ktrim-an-extra-fast-and-accurate-adapter-and-quality-trimmer-for-sequencing-data</link>
	<title><![CDATA[Ktrim: an extra-fast and accurate adapter- and quality-trimmer for sequencing data]]></title>
	<description><![CDATA[<p>Ktrim&nbsp;is written in&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">C++</code>&nbsp;for GNU Linux/Unix platforms. After uncompressing the source package, you can find an executable file&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">ktrim</code>&nbsp;under&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">bin/</code>&nbsp;directory compiled using&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">g++ v4.8.5</code>&nbsp;and linked with&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libz v1.2.7</code>&nbsp;for Linux x86_64 system. If you could not run it (which is usually caused by low version of&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libc++</code>&nbsp;or&nbsp;<code style="font-size: 13.6px; padding: 0.2em 0.4em; margin: 0px; background-color: var(--color-markdown-code-bg);">libz</code>&nbsp;library) or you want to build a version optimized for your system, you can re-compile the programs:</p>
<p>user@linux$ make clean &amp;&amp; make</p><p>Address of the bookmark: <a href="https://github.com/hellosunking/Ktrim" rel="nofollow">https://github.com/hellosunking/Ktrim</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>