BOL: Related items

MMseqs2: ultra fast and sensitive sequence search and clustering suite

Manisha Mishra — Mon, 18 Jan 2021 10:47:56 -0600

MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin) Windows. The software is designed to run on multiple cores and servers and exhibits very good scalability. MMseqs2 can run 10000 times faster than BLAST. At 100 times its speed it achieves almost the same sensitivity. It can perform profile searches with the same sensitivity as PSI-BLAST at over 400 times its speed.

Address of the bookmark: https://github.com/soedinglab/MMseqs2

Carrot2 clustering engine

LEGE — Fri, 07 Apr 2023 13:11:24 -0500

This is the demo application of the Carrot² clustering engine. It uses Carrot²'s algorithms to organize search results into thematic folders.

User interfaces

Web Search Clustering organizes search results from public search engines into clusters; offers treemap- and pie-chart visualizations of the clusters.
Clustering Workbench 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.

Search engines

Web: web search results provided by etools.ch. Extensive use may require special arrangements with the owner of the etools.ch service.
PubMed: abstracts of medical papers from the PubMed database provided by NCBI.
Local file: content read from a local file in Carrot2 XML, JSON, CSV or Excel format.
Solr: queries an Apache Solr instance.
Elasticsearch: queries an Elasticsearch instance.

Clustering algorithms

Lingo: creates well-described flat clusters. Does not scale beyond a few thousand search results. Available as part of the open source Carrot² framework.
STC: the classic search results clustering algorithm. Produces flat cluster with adequate description, very fast. Available as part of the open source Carrot² framework
k-means: base line clustering algorithm, produces bag-of-words style cluster descriptions. Available as part of the open source Carrot² framework

Address of the bookmark: https://search.carrot2.org/#/search/web

LAST

Archana Malhotra — Wed, 09 Mar 2016 14:27:01 -0600

LAST can:

Handle big sequence data, e.g:
- Compare two vertebrate genomes
- Align billions of DNA reads to a genome
Indicate the reliability of each aligned column.
Use sequence quality data properly.
Compare DNA to proteins, with frameshifts.
Compare PSSMs to sequences
Calculate the likelihood of chance similarities between random sequences.
Do split and spliced alignment.
Train alignment parameters for unusual kinds of sequence (e.g. nanopore).

Address of the bookmark: http://last.cbrc.jp/

gVolante: Completeness Assessment of Genome/Transcriptome Sequences

Jit — Tue, 06 Aug 2019 21:37:56 -0500

gVolante provides an online interface for completeness assessment of user’s original or publicly available sequence datasets as well as for browsing results of completeness assessment performed on publicly available genome and transcriptome assemblies.

Address of the bookmark: https://gvolante.riken.jp/

KAST: Perform Alignment-free k-tuple frequency comparisons from sequences

Jit — Thu, 20 Sep 2018 08:56:35 -0500

Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.

Address of the bookmark: https://github.com/martinjvickers/KAST

SiLiX: implements an ultra-efficient algorithm for the clustering of homologous sequences

Jit — Wed, 12 Dec 2018 09:22:41 -0600

The software package SiLiX implements an ultra-efficient algorithm for the clustering of homologous sequences, based on single transitive links (single linkage) with alignment coverage constraints.

SiLiX adopts a graph-theoretical framework to interpret similarity pairs as edges of a network. A very efficient algorithm, based on the Disjoint Sets Data Structure, allows the computation of sequence families with low time and space requirements.

A parallel version of SiLiX, based on MPI, is also available in this package and has been proved to be scalable, so that its allows the study of very large datasets.

SiLiX is already included in the analysis pipeline for HOGENOM.

Address of the bookmark: http://lbbe.univ-lyon1.fr/SiLiX?lang=fr

Gepard: allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes

Jit — Mon, 26 Aug 2019 11:38:30 -0500

Gepard (German: "cheetah", Backronym for "GEnome PAir - Rapid Dotter") allows the calculation of dotplots even for large sequences like chromosomes or bacterial genomes. Reference: Krumsiek J, Arnold R, Rattei T. Gepard: A rapid and sensitive tool for creating dotplots on genome scale. Bioinformatics 2007; 23(8): 1026-8. PMID: 17309896

http://cube.univie.ac.at/gepard

Address of the bookmark: https://github.com/univieCUBE/gepard

Tiara: deep learning-based classification system for eukaryotic sequences

Rahul Nayak — Mon, 14 Mar 2022 23:02:11 -0500

With a large number of metagenomic datasets becoming available, eukaryotic metagenomics emerged as a new challenge. The proper classification of eukaryotic nuclear and organellar genomes is an essential step toward a better understanding of eukaryotic diversity.

Address of the bookmark: https://academic.oup.com/bioinformatics/article/38/2/344/6375939

LAST

Bulbul — Mon, 19 Dec 2016 14:07:53 -0600

LAST can:

Handle big sequence data, e.g:
- Compare two vertebrate genomes
- Align billions of DNA reads to a genome
Indicate the reliability of each aligned column.
Use sequence quality data properly.
Compare DNA to proteins, with frameshifts.
Compare PSSMs to sequences
Calculate the likelihood of chance similarities between random sequences.
Do split and spliced alignment.
Train alignment parameters for unusual kinds of sequence (e.g. nanopore).

Address of the bookmark: http://last.cbrc.jp/

GMASS: a novel measure for genomeassembly structural similarity

Abhimanyu Singh — Sun, 14 Apr 2019 20:35:40 -0500

The GMASS score is a novel measure for representing structural similarity between two assemblies. It will contribute to the understanding of assembly output and developing de novo assemblers.

https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z

Address of the bookmark: http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php