<?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/38666?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/38666?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/43658/uniquekmer-generate-unique-kmers-for-every-contig-in-a-fasta-file</guid>
	<pubDate>Fri, 17 Dec 2021 00:08:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43658/uniquekmer-generate-unique-kmers-for-every-contig-in-a-fasta-file</link>
	<title><![CDATA[UniqueKmer: Generate unique KMERs for every contig in a FASTA file]]></title>
	<description><![CDATA[<p dir="auto">Generate unique k-mers for every contig in a FASTA file.</p>
<p dir="auto">Unique k-mer is consisted of k-mer keys (i.e. ATCGATCCTTAAGG) that are only presented in one contig, but not presented in any other contigs (for both forward and reverse strands).</p>
<p dir="auto">This tool accepts the input of a FASTA file consisting of many contigs, and extract unique k-mers for each contig.</p>
<p dir="auto">The output unique k-mer file and Genome file can be used for fastv:&nbsp;<a href="https://github.com/OpenGene/fastv">https://github.com/OpenGene/fastv</a>, which is an ultra-fast tool to identify and visualize microbial sequences from sequencing data.</p>
<p>https://github.com/OpenGene/UniqueKMER</p><p>Address of the bookmark: <a href="https://github.com/OpenGene/UniqueKMER" rel="nofollow">https://github.com/OpenGene/UniqueKMER</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/5307/clean-the-fasta-file</guid>
	<pubDate>Thu, 03 Oct 2013 14:19:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/5307/clean-the-fasta-file</link>
	<title><![CDATA[Clean the FASTA file]]></title>
	<description><![CDATA[<p>Mostly FASTA file contain NNN characters, which can be replace by random A T G C character with this perl script. It also print the FASTA sequence name, N's counts, nucleotide count and percentage details at command prompt/standard output.</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/5307" length="1408" type="text/x-perl" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/31502/perl-way-to-check-if-an-array-contains-values</guid>
	<pubDate>Thu, 09 Mar 2017 17:17:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/31502/perl-way-to-check-if-an-array-contains-values</link>
	<title><![CDATA[Perl way to check if an array contains values]]></title>
	<description><![CDATA[<p><span>Perl is always is known for their flexibility (<span>There is more than one way to do it</span>). </span></p><p><span>Followings are the quick way to check if a value exist in an array.</span></p><blockquote><p><span>do_something </span><span>if</span><span> </span><span>'flour'</span><span> </span><span>~~</span><span> </span><span>@ingredients</span><span> &nbsp; </span><span># ~~ operand. &nbsp; BEWARE: it is broken.</span><span><br /><br />do_something </span><span>if</span><span> grep </span><span>{</span><span>$_ eq </span><span>'flour'</span><span>}</span><span> </span><span>@ingredients</span><span> </span><span># grep (slower than 'any')</span><span><br /><br />do_something </span><span>if</span><span> any </span><span>{</span><span>$_ eq </span><span>'flour'</span><span>}</span><span> </span><span>@ingredients</span><span> </span><span># List::MoreUtils / Util::Any</span><span><br /><br />do_something </span><span>if</span><span> any</span><span>(</span><span>@ingredients</span><span>)</span><span> eq </span><span>'flour'</span><span> &nbsp; </span><span># use syntax 'junction';</span><span><br /><br />do_something </span><span>if</span><span> </span><span>@ingredients</span><span>-&gt;</span><span>contains</span><span>(</span><span>'flour'</span><span>)</span><span> &nbsp; </span><span># added with autobox</span></p></blockquote>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</guid>
	<pubDate>Sun, 13 Jan 2019 07:05:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38670/ltr-finder-an-efficient-program-for-finding-full-length-ltr-retrotranspsons-in-genome-sequences</link>
	<title><![CDATA[LTR_Finder: an efficient program for finding full-length LTR retrotranspsons in genome sequences.]]></title>
	<description><![CDATA[<p>LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.</p>
<p>The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE,&nbsp;<a href="http://www.expasy.org/prosite/">http://www.expasy.org/prosite/</a>) to locate cores of important enzymes if they occur.</p><p>Address of the bookmark: <a href="https://github.com/xzhub/LTR_Finder" rel="nofollow">https://github.com/xzhub/LTR_Finder</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3868/next-generation-sequencing-ngs-tutorials</guid>
	<pubDate>Sat, 24 Aug 2013 06:01:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3868/next-generation-sequencing-ngs-tutorials</link>
	<title><![CDATA[Next Generation Sequencing (NGS) Tutorials]]></title>
	<description><![CDATA[<p>Institute of computational biomedicine, Cornell University provide an NGS workshop tutorial at&nbsp;<a href="http://chagall.med.cornell.edu/NGScourse/">http://chagall.med.cornell.edu/NGScourse/</a>&nbsp;</p>
<p>You can also add your favourite NGS educational material, or workshop tutorial by commenting on this bookmarks for user benefit.&nbsp;</p>
<p>Understanding the basics of genome sequencing:</p>
<p>Tutorial by Luke Jostins.</p>
<p>http://www.genetic-inference.co.uk/blog/2009/04/basics-sequencing-dna-part-1/</p>
<p>http://www.genetic-inference.co.uk/blog/2009/08/basics-sequencing-dna-part-2/</p>
<p>A window into third-generation sequencing</p>
<p>http://hmg.oxfordjournals.org/content/19/R2/R227.full.pdf</p>
<p>==============================================</p>
<p>NGS data analysis pipelines</p>
<ul>
<li><strong>Detecting and annotating genetic variations using the HugeSeq pipeline</strong>&nbsp; DOI: <a href="http://dx.doi.org/10.1038/nbt.2134">10.1038/nbt.2134</a></li>
<li><strong> NARWHAL, a primary analysis pipeline for NGS data</strong> <a href="http://bioinformatics.oxfordjournals.org/cgi/content/abstract/28/2/284?etoc">http://bioinformatics.oxfordjournals.org/cgi/content/abstract/28/2/284?etoc</a></li>
<li><strong>RseqFlow: Workflows for RNA-Seq data analysis</strong>&nbsp; DOI: <a href="http://dx.doi.org/10.1093/bioinformatics/btr441">10.1093/bioinformatics/btr441</a></li>
<li><strong>ngs_backbone: a pipeline for read cleaning, mapping and SNP calling using Next Generation Sequence</strong>&nbsp;&nbsp;<a href="http://dx.doi.org/10.1186/1471-2164-12-285">10.1186/1471-2164-12-285</a></li>
<li><strong>A framework for variation discovery and genotyping using next-generation DNA sequencing data</strong>&nbsp; PubMed: <a href="http://www.ncbi.nlm.nih.gov/pubmed/21478889">21478889</a></li>
<li><strong>SNiPlay: a web-based tool for detection, management and analysis of SNPs. Application to grapevine diversity projects</strong>&nbsp; DOI: <a href="http://dx.doi.org/10.1186/1471-2105-12-134">10.1186/1471-2105-12-134</a> Abstract: <a href="http://www.biomedcentral.com/1471-2105/12/134/abstract">http://www.biomedcentral.com/1471-2105/12/134/abstract</a></li>
<li><strong>WEP: a high-performance analysis pipeline for whole-exome data&nbsp;</strong>http://www.biomedcentral.com/1471-2105/14/S7/S11</li>
<li><strong>DDBJ read annotation pipeline: a cloud computing-based pipeline for high-throughput analysis of next-generation sequencing data.&nbsp;</strong>http://www.ncbi.nlm.nih.gov/pubmed/23657089</li>
<li><strong>GATK: a Toolkit for Genome Analysis&nbsp;</strong>http://www.broadinstitute.org/gatk/</li>
<li><strong>Metagenomics</strong>:http://www.nbic.nl/education/nbic-phd-school/course-schedule/ngsmetagenomics/</li>
<li><strong>RNASeq</strong>:http://www.nbic.nl/education/nbic-phd-school/course-schedule/ngsrnaseq/</li>
<li><strong>Bioinformatics and Seq courses</strong>:&nbsp;http://www.isb-sib.ch/training/training-activities-schedule/archive-2013.html</li>
<li><strong>Variant Detection (Model organism) Advanced tutorial</strong> https://docs.google.com/document/pub?id=1CuKkKylVDb03tnN7RSWl5EUzleetn0ctjmvaidPKLxM</li>
<li><strong>Variant Detection Introductory tutorial</strong> https://docs.google.com/document/pub?id=1ZRzrjjOCvtAu3m-IKL-rbJ1f4On60dDL_IEwG7oejdI</li>
<li><strong>Microbial de novo Assembly for Illumina Data Introductory tutorial</strong> https://docs.google.com/document/pub?id=1N3AB9ptISUu4zULqe1kXpVF0BDyGb5f5yzxWSJd_WNM</li>
<li><strong>RNAseq Differential Gene Expression Introductory tutorial</strong> https://docs.google.com/document/pub?id=1KbTiBHtvHLfPRZ39AY3uriazrINA8TJzgjjwn1zPP7Y</li>
</ul>
<blockquote>
<p>" Please add your favourite NGS link below in comment section for the benefit of bioinformatics community ".&nbsp;</p>
</blockquote><p>Address of the bookmark: <a href="http://chagall.med.cornell.edu/NGScourse/" rel="nofollow">http://chagall.med.cornell.edu/NGScourse/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26306/busco</guid>
	<pubDate>Sun, 07 Feb 2016 16:02:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26306/busco</link>
	<title><![CDATA[BUSCO]]></title>
	<description><![CDATA[<p>Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs</p>
<p>More at http://busco.ezlab.org/</p><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28844/teannot</guid>
	<pubDate>Thu, 18 Aug 2016 10:02:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28844/teannot</link>
	<title><![CDATA[TEannot]]></title>
	<description><![CDATA[<p>We advise to run first the TEdenovo pipeline but it is not compulsory. We suppose you begin by running the TEannot pipeline on the example provided in the directory "db/" rather than directly on your own genomic sequences. Thus, from now on, the project name is "DmelChr4".</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto" rel="nofollow">https://urgi.versailles.inra.fr/Tools/REPET/TEannot-tuto</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</guid>
	<pubDate>Thu, 23 Nov 2017 09:30:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34394/tulip-the-uncorrected-long-read-itegration-pipeline</link>
	<title><![CDATA[TULIP - The Uncorrected Long read Itegration Pipeline]]></title>
	<description><![CDATA[<p>#Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel)</p>
<p>TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.&nbsp;<br>Tulipseed takes as input alignments files of long reads to sparse short seeds, and outputs a graph and scaffold structures. Tulipbulb adds long read sequencing data to these.</p>
<p>&nbsp;</p>
<p>https://github.com/Generade-nl/TULIP</p><p>Address of the bookmark: <a href="https://github.com/Generade-nl/TULIP" rel="nofollow">https://github.com/Generade-nl/TULIP</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>