<?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/44589?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/44589?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/41442/gsp4pdb-a-web-tool-to-visualize-search-and-explore-protein-ligand-structural-patterns</guid>
	<pubDate>Sun, 15 Mar 2020 03:41:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41442/gsp4pdb-a-web-tool-to-visualize-search-and-explore-protein-ligand-structural-patterns</link>
	<title><![CDATA[GSP4PDB: a web tool to visualize, search and explore protein-ligand structural patterns]]></title>
	<description><![CDATA[<p><span><span>GSP4PDB is a user-friendly and efficient application to search and discover new patterns of protein-ligand interaction.</span></span></p>
<p><span>GSP4PDB</span><span>&nbsp;is part of the services provided by the&nbsp;</span><a href="https://structuralbio.utalca.cl/" target="_blank">Bioinformatic Group</a><span>&nbsp;of the&nbsp;</span><a href="http://www.utalca.cl/" target="_blank">University of Talca</a></p>
<p><a href="http://gdblab.com/gsp4pdb/gsp4pdb2/">http://gdblab.com/gsp4pdb/gsp4pdb2/</a></p>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-3352-x</p><p>Address of the bookmark: <a href="http://gdblab.com/gsp4pdb/gsp4pdb2/" rel="nofollow">http://gdblab.com/gsp4pdb/gsp4pdb2/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</guid>
	<pubDate>Fri, 07 Apr 2023 13:11:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44301/carrot2-clustering-engine</link>
	<title><![CDATA[Carrot2 clustering engine]]></title>
	<description><![CDATA[<h2>&nbsp;</h2>
<p>This is the demo application of the&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;clustering engine</a>. It uses Carrot<sup>2</sup>'s algorithms to organize search results into thematic folders.</p>
<h3>User interfaces</h3>
<ul>
<li><span><a href="https://search.carrot2.org/#/search/:source">Web Search Clustering</a></span>&nbsp;organizes search results from public search engines into clusters; offers treemap- and pie-chart visualizations of the clusters.</li>
<li><span><a href="https://search.carrot2.org/#/workbench">Clustering Workbench</a></span>&nbsp;clusters content from local files in JSON or Excel format, Solr or Elasticsearch; allows tuning of clustering parameters and exporting results as Excel or JSON.</li>
</ul>
<h3>Search engines</h3>
<ul>
<li><span>Web</span>:&nbsp;<span>web search results provided by&nbsp;<a href="https://etools.ch/" target="_blank">etools.ch</a>. Extensive use may require special arrangements with the&nbsp;<a href="mailto:sschmid@comcepta.com" target="_blank">owner</a>&nbsp;of the etools.ch service.</span></li>
<li><span>PubMed</span>:&nbsp;<span>abstracts of medical papers from the PubMed database provided by NCBI.</span></li>
<li><span>Local file</span>:&nbsp;<span>content read from a local file in Carrot2 XML, JSON, CSV or Excel format.</span></li>
<li><span>Solr</span>:&nbsp;<span>queries an Apache Solr instance.</span></li>
<li><span>Elasticsearch</span>:&nbsp;<span>queries an Elasticsearch instance.</span></li>
</ul>
<h3>Clustering algorithms</h3>
<ul>
<li><span>Lingo</span>:&nbsp;<span>creates well-described flat clusters. Does not scale beyond a few thousand search results. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a>.</span></li>
<li><span>STC</span>:&nbsp;<span>the classic search results clustering algorithm. Produces flat cluster with adequate description, very fast. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
<li><span>k-means</span>:&nbsp;<span>base line clustering algorithm, produces bag-of-words style cluster descriptions. Available as part of the open source&nbsp;<a href="http://project.carrot2.org/" target="_blank">Carrot<sup>2</sup>&nbsp;framework</a></span></li>
</ul><p>Address of the bookmark: <a href="https://search.carrot2.org/#/search/web" rel="nofollow">https://search.carrot2.org/#/search/web</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</guid>
	<pubDate>Fri, 29 Jan 2016 10:37:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</link>
	<title><![CDATA[Alignment of closely related whole genomes/scaffolds]]></title>
	<description><![CDATA[<p>With the relative ease and low cost of current generation sequencing technologies has led to a dramatic increase in the number of sequenced genomes for species across the tree of life. This increasing volume of data requires tools that can quickly compare multiple whole-genome sequences, millions of base pairs in length, to aid in the study of populations, pan-genomes, and genome evolution.This bookmaks have been created to report new tools for whole genome alignments.</p>
<p>Please report new whole genome alignment tools under comment sections.</p><p>Address of the bookmark: <a href="http://www.cs.utoronto.ca/~brudno/721.full.pdf" rel="nofollow">http://www.cs.utoronto.ca/~brudno/721.full.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</guid>
	<pubDate>Fri, 03 Mar 2017 09:57:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</link>
	<title><![CDATA[CLgenomics]]></title>
	<description><![CDATA[<p>CLgenomics is a standalone desktop software specifically designed for bacterial genome analysis. This program has a powerful multi-genome browser, which enables rapid and responsive exploration of bacterial genomes.</p>
<p>To use CLgenomics, individual genome data (genome sequences + annotation details) are compiled and saved in a specially formatted file called CLG (ChunLab Genomics).&nbsp;Each CLG file corresponds with one bacterial genome. If multiple genomes are being considered and compared, multiple CLG files are needed. ChunLab offers &gt;40,000 CLG files of publicly available Bacterial and Archaeal genomes.</p><p>Address of the bookmark: <a href="https://chunlab.wordpress.com/clgenomics-software/" rel="nofollow">https://chunlab.wordpress.com/clgenomics-software/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39674/simka-and-simkamin-are-comparative-metagenomics-method-dedicated-to-ngs-datasets</guid>
	<pubDate>Sat, 06 Jul 2019 13:56:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39674/simka-and-simkamin-are-comparative-metagenomics-method-dedicated-to-ngs-datasets</link>
	<title><![CDATA[Simka and SimkaMin are comparative metagenomics method dedicated to NGS datasets]]></title>
	<description><![CDATA[<p>Simka is a de novo comparative metagenomics tool. Simka represents each dataset as a k-mer spectrum and compute several classical ecological distances between them.</p>
<p>Developper:&nbsp;<a href="http://people.rennes.inria.fr/Gaetan.Benoit/">Ga&euml;tan Benoit</a>, PhD, former member of the&nbsp;<a href="http://team.inria.fr/genscale/">Genscale</a>&nbsp;team at Inria.</p>
<p>Contact: claire dot lemaitre at inria dot fr</p>
<p><span>Simka and SimkaMin are comparative metagenomics method dedicated to NGS datasets.&nbsp;</span><span></span><span><a href="https://gatb.inria.fr/software/simka/">https://gatb.inria.fr/software/simka/</a></span></p><p>Address of the bookmark: <a href="https://github.com/GATB/simka" rel="nofollow">https://github.com/GATB/simka</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44468/orthoflow-workflow-for-phylogenetic-inference-of-genome-scale-datasets-of-protein-coding-genes</guid>
	<pubDate>Wed, 21 Feb 2024 06:13:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44468/orthoflow-workflow-for-phylogenetic-inference-of-genome-scale-datasets-of-protein-coding-genes</link>
	<title><![CDATA[Orthoflow: workflow for phylogenetic inference of genome-scale datasets of protein-coding genes]]></title>
	<description><![CDATA[<p><span>Orthoflow is a workflow for phylogenetic inference of genome-scale datasets of protein-coding genes. Our goal was to make it straightforward to work from a combination of input sources including annotated contigs in Genbank format and FASTA files containing CDSs. It uses several state of the art inference methods for orthology inference, either based on HMM profiles or de novo inference of orthogroups. Through the use of OrthoSNAP, many additional ortholog alignments can be generated from multi-copy gene families. For phylogenetic inference, users can choose a supermatrix approach and/or gene tree inference followed by supertree reconstruction. Users can specify a range of alignment filtering settings to retain high-quality alignments for phylogenetic inference. The workflow produces a detailed report that, in addition to the phylogenetic results, includes a range of diagnostics to verify the quality of the results.</span></p><p>Address of the bookmark: <a href="https://github.com/rbturnbull/orthoflow" rel="nofollow">https://github.com/rbturnbull/orthoflow</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32862/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</guid>
	<pubDate>Fri, 19 May 2017 07:44:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32862/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</link>
	<title><![CDATA[GAM-NGS: genomic assemblies merger for next generation sequencing]]></title>
	<description><![CDATA[<p><span>GAM-NGS is a tool able to merge two or more assemblies in order to improve contiguity and correctness. It can be used on all NGS-based assembly projects and it shows its full potential with multi-library Illumina-based projects. With more than 20 available assemblers it is hard to select the best tool. In this context we propose a tool that improves assemblies (and, as a by-product, perhaps even assemblers) by merging them and selecting the generating that is most likely to be correct.</span></p><p>Address of the bookmark: <a href="https://github.com/vice87/gam-ngs" rel="nofollow">https://github.com/vice87/gam-ngs</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42566/genomic-open-source-breeding-informatics-initiative</guid>
	<pubDate>Wed, 06 Jan 2021 19:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42566/genomic-open-source-breeding-informatics-initiative</link>
	<title><![CDATA[Genomic Open-source Breeding informatics initiative]]></title>
	<description><![CDATA[<p><span>To build open-source genomic data management and analysis tools to enable breeders to implement genomic and marker-assisted selection as part of their routine breeding programs.</span></p>
<p><span><span>To transform breeding by connecting diverse data with precision breeding tools to advance yields and adaptation to local growing conditions, bringing global communities closer to a sustainable, reliable food supply.</span></span></p><p>Address of the bookmark: <a href="http://cbsugobii05.biohpc.cornell.edu/wordpress/" rel="nofollow">http://cbsugobii05.biohpc.cornell.edu/wordpress/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33506/bedops-v2426-high-performance-genomic-feature-operations</guid>
	<pubDate>Mon, 12 Jun 2017 10:11:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33506/bedops-v2426-high-performance-genomic-feature-operations</link>
	<title><![CDATA[BEDOPS v2.4.26: high-performance genomic feature operations]]></title>
	<description><![CDATA[<p><strong>BEDOPS v2.4.26</strong> is a suite of tools to address common questions raised in genomic studies &mdash; mostly with regard to overlap and proximity relationships between data sets. It aims to be scalable and flexible, facilitating the efficient and accurate analysis and management of large-scale genomic data.</p>
<p>The <a href="https://bedops.readthedocs.io/en/latest/content/overview.html#overview">overview</a> section of the <strong>BEDOPS v2.4.26</strong> documentation summarizes the toolkit, functionality and performance enhancements. The <a href="https://bedops.readthedocs.io/en/latest/index.html#reference">reference</a> table offers documentation for all applications and scripts.</p><p>Address of the bookmark: <a href="https://github.com/bedops/bedops" rel="nofollow">https://github.com/bedops/bedops</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>