<?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/34501?offset=90</link>
	<atom:link href="https://bioinformaticsonline.com/related/34501?offset=90" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44489/proksee</guid>
	<pubDate>Wed, 27 Mar 2024 11:11:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44489/proksee</link>
	<title><![CDATA[Proksee]]></title>
	<description><![CDATA[<p><span>Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.</span></p>
<fieldset><legend>Please Cite the Following</legend>
<div>Grant JR, Enns E, Marinier E, Mandal A, Herman EK, Chen C, Graham M, Van Domselaar G, and Stothard P</div>
<div><a href="https://pubmed.ncbi.nlm.nih.gov/37140037/">Proksee: in-depth characterization and visualization of bacterial genomes</a></div>
<div>Nucleic Acids Research, 2023, gkad326, https://doi.org/10.1093/nar/gkad326</div>
</fieldset><p>Address of the bookmark: <a href="https://proksee.ca/" rel="nofollow">https://proksee.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41957/majiq-2-is-released</guid>
	<pubDate>Thu, 09 Jul 2020 03:06:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41957/majiq-2-is-released</link>
	<title><![CDATA[MAJIQ 2 is released !]]></title>
	<description><![CDATA[<p>&nbsp;</p>
<p>Ability to detect, quantify, and visualize complex and de-novo splicing variations from RNASeq.</p>
<p>MAJIQ&rsquo;s accuracy compares favorably to other algorithms.</p>
<p>MAJIQ 2 is *way* faster, more memory and I/O efficient</p>
<p>New visualization (VOILA 2.0) Ability to analyze hundreds and thousands of samples Why so negative? (Support for a confident negative set)</p>
<p><span>Finally, a major reason we are excited about MAJIQ 2.0 is that it sets the code base for many new exciting algorithmic and visualization improvements, with application to new research questions so stay tuned!</span></p>
<p><span>More at <a href="https://biociphers.wordpress.com/2019/04/01/majiq-2-is-out/">https://biociphers.wordpress.com/2019/04/01/majiq-2-is-out/</a></span></p><p>Address of the bookmark: <a href="https://majiq.biociphers.org/" rel="nofollow">https://majiq.biociphers.org/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44898/genomad-identification-of-mobile-genetic-elements</guid>
	<pubDate>Sun, 31 Aug 2025 06:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44898/genomad-identification-of-mobile-genetic-elements</link>
	<title><![CDATA[geNomad: Identification of mobile genetic elements]]></title>
	<description><![CDATA[<p><span>geNomad is a tool that identifies virus and plasmid genomes from nucleotide sequences. It provides state-of-the-art classification performance and can be used to quickly find mobile genetic elements from genomes, metagenomes, or metatranscriptomes.</span></p><p>Address of the bookmark: <a href="https://portal.nersc.gov/genomad" rel="nofollow">https://portal.nersc.gov/genomad</a></p>]]></description>
	<dc:creator>LEGE</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/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</guid>
	<pubDate>Mon, 17 Dec 2018 03:17:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38475/purge-haplotigs-pipeline-to-help-with-curating-heterozygous-diploid-genome-assemblies</link>
	<title><![CDATA[Purge Haplotigs: Pipeline to help with curating heterozygous diploid genome assemblies]]></title>
	<description><![CDATA[<p>Some parts of a genome may have a very high degree of heterozygosity. This causes contigs for both haplotypes of that part of the genome to be assembled as separate primary contigs, rather than as a contig and an associated haplotig. This can be an issue for downstream analysis whether you're working on the haploid or phased-diploid assembly.</p>
<p><span>Identify pairs of contigs that are syntenic and move one of them to the haplotig 'pool'. The pipeline uses mapped read coverage and Minimap2 alignments to determine which contigs to keep for the haploid assembly. Dotplots are optionally produced for all flagged contig matches, juxtaposed with read-coverage, to help the user determine the proper assignment of any remaining ambiguous contigs. The pipeline will run on either a haploid assembly (i.e. Canu, FALCON or FALCON-Unzip primary contigs) or on a phased-diploid assembly (i.e. FALCON-Unzip primary contigs + haplotigs). Here are&nbsp;</span><a href="https://bitbucket.org/mroachawri/purge_haplotigs/wiki/Examples">two examples</a><span>&nbsp;of how Purge Haplotigs can improve a haploid and diploid assembly.</span></p><p>Address of the bookmark: <a href="https://bitbucket.org/mroachawri/purge_haplotigs" rel="nofollow">https://bitbucket.org/mroachawri/purge_haplotigs</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44168/environmental-genomics-group-scilifelabkth-stockholm</guid>
	<pubDate>Thu, 01 Dec 2022 01:12:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44168/environmental-genomics-group-scilifelabkth-stockholm</link>
	<title><![CDATA[Environmental Genomics Group SciLifeLab/KTH Stockholm]]></title>
	<description><![CDATA[<p>Useful Metagenomics resources</p><p>Address of the bookmark: <a href="https://github.com/envgen" rel="nofollow">https://github.com/envgen</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44675/variant-calling-pipeline</guid>
	<pubDate>Sat, 19 Oct 2024 12:23:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44675/variant-calling-pipeline</link>
	<title><![CDATA[Variant Calling Pipeline]]></title>
	<description><![CDATA[<p dir="auto">The&nbsp;<a href="https://github.com/Tom-Jenkins/maerl-wgs-pipelines/blob/main/src/variantcalling.nf"><code>variantcalling.nf</code></a>&nbsp;nextflow script will take any number of samples with paired-end reads in FASTQ format, map reads using Bowtie2, process BAM files, and finally call variants using BCFtools v1.21 and/or Freebayes v1.3.6. If part of the pipeline is unsuccessful for a sample then these errors are ignored.</p>
<p dir="auto">Pipeline flowchart:</p>
<div dir="auto">
<div dir="auto">
<div>&nbsp;</div>
<div></div>
</div>
<div>&nbsp;</div>
<div dir="auto">
<h2 dir="auto">Dependencies (version tested)</h2>
<a href="https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md#dependencies-version-tested"></a></div>
<ul dir="auto">
<li>Nextflow (24.04.4)</li>
<li>Java (18.0.2.1)</li>
<li>Python (3.10)</li>
<li>Perl (5.32.1)</li>
<li>Bowtie2 (2.5.3)</li>
<li>SAMtools (1.19.2)</li>
<li>GATK4 (4.5)</li>
<li>BCFtools (1.21)</li>
<li>Freebayes (1.3.6)</li>
</ul>
</div><p>Address of the bookmark: <a href="https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md" rel="nofollow">https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34525/hic-pro-an-optimized-and-flexible-pipeline-for-hi-c-data-processing</guid>
	<pubDate>Wed, 06 Dec 2017 01:05:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34525/hic-pro-an-optimized-and-flexible-pipeline-for-hi-c-data-processing</link>
	<title><![CDATA[HiC-Pro: an optimized and flexible pipeline for Hi-C data processing]]></title>
	<description><![CDATA[<p><span>HiC-Pro was designed to process Hi-C data, from raw fastq files (paired-end Illumina data) to the normalized contact maps. Since version 2.7.0, HiC-Pro supports the main Hi-C protocols, including digestion protocols as well as protocols that do not require restriction enzyme such as DNase Hi-C. In practice, HiC-Pro can be used to process dilution Hi-C, in situ Hi-C, DNase Hi-C, Micro-C, capture-C, capture Hi-C or HiChip data.</span></p>
<p>&nbsp;</p>
<p>http://nservant.github.io/HiC-Pro/</p><p>Address of the bookmark: <a href="http://nservant.github.io/HiC-Pro/" rel="nofollow">http://nservant.github.io/HiC-Pro/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38666/mcat-motif-combining-and-association-tool</guid>
	<pubDate>Sun, 13 Jan 2019 06:27:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38666/mcat-motif-combining-and-association-tool</link>
	<title><![CDATA[MCAT: Motif Combining and Association Tool]]></title>
	<description><![CDATA[<p>This is a pipeline for finding motifs in fasta files.<br>It can be run from the command line as follows:</p>
<p>usage: orange_pipeline_refine.py [-h] [-w W] [--nmotifs NMOTIFS] [--iter ITER] [-c C]<br>[-s S] [-d] [-ff] [-v V]<br>positive_seq negative_seq</p>
<p>positional arguments:<br>positive_seq the fasta file for the positive sequences<br>negative_seq the fasta file for the negative sequences</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/yanshen43/MCAT" rel="nofollow">https://github.com/yanshen43/MCAT</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</guid>
	<pubDate>Fri, 24 Jan 2020 06:04:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40604/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</link>
	<title><![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]></title>
	<description><![CDATA[<p><span>gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser. </span></p>
<p><span>gapFinisher can fill gaps in draft genomes quickly and reliably.</span></p><p>Address of the bookmark: <a href="https://github.com/kammoji/gapFinisher" rel="nofollow">https://github.com/kammoji/gapFinisher</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>