<?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/38212?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/38212?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</guid>
	<pubDate>Mon, 16 Mar 2020 10:09:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</link>
	<title><![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]></title>
	<description><![CDATA[<p><span>Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/pdf/1902.04341.pdf">https://arxiv.org/pdf/1902.04341.pdf</a></p>
<p>More at&nbsp;<a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Apollo" rel="nofollow">https://github.com/CMU-SAFARI/Apollo</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44366/mitofinder</guid>
	<pubDate>Tue, 29 Aug 2023 02:13:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44366/mitofinder</link>
	<title><![CDATA[MitoFinder]]></title>
	<description><![CDATA[<p dir="auto">Allio, R., Schomaker-Bastos, A., Romiguier, J., Prosdocimi, F., Nabholz, B., &amp; Delsuc, F. (2020) Mol Ecol Resour. 20, 892-905. (<a href="https://doi.org/10.1111/1755-0998.13160">publication link</a>)</p>
<p dir="auto" style="text-align: center;"><a href="https://github.com/RemiAllio/MitoFinder/blob/master/image/logo.png" target="_blank"><img src="https://github.com/RemiAllio/MitoFinder/raw/master/image/logo.png" alt="Drawing" width="250" style="border: 0px;"></a></p>
<p dir="auto"><span>Mitofinder</span>&nbsp;is a pipeline to&nbsp;<span>assemble</span>&nbsp;mitochondrial genomes and&nbsp;<span>annotate</span>&nbsp;mitochondrial genes from trimmed read sequencing data.</p>
<p dir="auto"><span>MitoFinder</span>&nbsp;is also designed to&nbsp;<span>find</span>&nbsp;and&nbsp;<span>annotate</span>&nbsp;mitochondrial sequences in existing genomic assemblies (generated from Hifi/PacBio/Nanopore/Illumina sequencing data...)</p>
<p dir="auto"><span>MitoFinder</span>&nbsp;is distributed under the&nbsp;<a href="https://github.com/RemiAllio/MitoFinder/blob/master/License/LICENSE">license</a>.</p><p>Address of the bookmark: <a href="https://github.com/RemiAllio/MitoFinder" rel="nofollow">https://github.com/RemiAllio/MitoFinder</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/43913/lsugenomics-lab</guid>
  <pubDate>Thu, 07 Jul 2022 05:26:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[lsugenomics Lab]]></title>
  <description><![CDATA[
<p>﻿In our lab, we seek to characterize and to compare genomes in order to better understand genetic and evolutionary processes linking genotypes to phenotypes.  <br /> <br />Sequencing and decoding plant genomes have been integral in our approaches.</p>

<p>The overarching goal of our research is to understand how to interpret complex and fascinating messages embedded in genomes.</p>

<p>https://www.lsugenomics.org/</p>
]]></description>
</item>
<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/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</guid>
	<pubDate>Wed, 29 Nov 2017 07:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</link>
	<title><![CDATA[Ribbon: Visualizing complex genome alignments and structural variation:]]></title>
	<description><![CDATA[<p>Ribbon can be used for long reads, short reads, paired-end reads, and assembly/genome alignments. Instructions for each data format are available by clicking on "instructions" in each tab on the right.</p>
<p>Local installation:</p>
<p>You can install Ribbon locally from Github by following the instructions here:&nbsp;<a href="https://github.com/MariaNattestad/ribbon" target="_blank">https://github.com/MariaNattestad/Ribbon</a></p><p>Address of the bookmark: <a href="http://genomeribbon.com/" rel="nofollow">http://genomeribbon.com/</a></p>]]></description>
	<dc:creator>Jit</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/29635/r-graphs</guid>
	<pubDate>Fri, 04 Nov 2016 10:48:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29635/r-graphs</link>
	<title><![CDATA[R Graphs !!]]></title>
	<description><![CDATA[<p><span>The blog is a collection of script examples with example data and output plots. R produce excellent quality graphs for data analysis, science and business presentation, publications and other purposes. Self-help codes and examples are provided. Enjoy nice graphs !!</span></p><p>Address of the bookmark: <a href="http://rgraphgallery.blogspot.be/" rel="nofollow">http://rgraphgallery.blogspot.be/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38039/vgsc-a-web-based-vector-graph-toolkit-of-genome-synteny-and-collinearity</guid>
	<pubDate>Tue, 30 Oct 2018 10:46:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38039/vgsc-a-web-based-vector-graph-toolkit-of-genome-synteny-and-collinearity</link>
	<title><![CDATA[VGSC: A Web-Based Vector Graph Toolkit of Genome Synteny and Collinearity]]></title>
	<description><![CDATA[<p><span>VGSC, the Vector Graph toolkit of genome Synteny and Collinearity, and its online service, to visualize the synteny and collinearity in the common graphical format, including both raster (JPEG, Bitmap, and PNG) and vector graphic (SVG, EPS, and PDF).</span><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42198/pggb-the-pangenome-graph-builder</guid>
	<pubDate>Sun, 13 Sep 2020 20:54:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42198/pggb-the-pangenome-graph-builder</link>
	<title><![CDATA[pggb: the pangenome graph builder]]></title>
	<description><![CDATA[<p><span>This pangenome graph construction pipeline renders a collection of sequences into a pangenome graph (in the variation graph model). Its goal is to build a graph that is locally directed and acyclic while preserving large-scale variation. Maintaining local linearity is important for the interpretation, visualization, and reuse of pangenome variation graphs.</span></p>
<p><img src="https://raw.githubusercontent.com/pangenome/pggb/master/data/images/DRB1-3123.fa.gz.pggb-s3000-p70-n10-a70-K11-k8-w10000-j5000-W0-e100.smooth.og.viz.png" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/pangenome/pggb" rel="nofollow">https://github.com/pangenome/pggb</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</guid>
	<pubDate>Thu, 28 Aug 2025 02:56:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</link>
	<title><![CDATA[AlfaPang: alignment free algorithm for pangenome graph construction]]></title>
	<description><![CDATA[<p><span>AlfaPang constructs variation graphs, leveraging its alignment-free and reference-free approach, based solely on intrinsic sequence properties. This design allows AlfaPang's runtime and memory usage to scale linearly with the size of input sequences, enabling it to handle significantly larger genome sets compared to other methods.</span></p><p>Address of the bookmark: <a href="https://github.com/AdamCicherski/AlfaPang" rel="nofollow">https://github.com/AdamCicherski/AlfaPang</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>