ArticleBMC bioinformatics2007
CLUSS: clustering of protein sequences based on a new similarity measure.
Article in BMC bioinformatics, 2007. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 17 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
17 citing papers in PubMed.
- Missing value replacement in strings and applications.Data mining and knowledge discovery · 2025Article
- Accurately clustering biological sequences in linear time by relatedness sorting.Nature communications · 2024Article
- Large-scale survey and database of high affinity ligands for peptide recognition modules.Molecular systems biology · 2020Article
- A systematic pipeline for classifying bacterial operons reveals the evolutionary landscape of biofilm machineries.PLoS computational biology · 2020Article
- SimSpliceEvol: alternative splicing-aware simulation of biological sequence evolution.BMC bioinformatics · 2019Article
- CLAP: a web-server for automatic classification of proteins with special reference to multi-domain proteins.BMC bioinformatics · 2014Article
- From local structure to a global framework: recognition of protein folds.Journal of the Royal Society, Interface · 2014Review
- DendroBLAST: approximate phylogenetic trees in the absence of multiple sequence alignments.PloS one · 2013Article
- Functional annotation of conserved hypothetical proteins from Haemophilus influenzae Rd KW20.PloS one · 2013Article
- A novel hierarchical clustering algorithm for gene sequences.BMC bioinformatics · 2012Article
- Tracing lifestyle adaptation in prokaryotic genomes.Frontiers in microbiology · 2012Article
- In silico characterization of thermostable lipases.Extremophiles : life under extreme conditions · 2011Article
- Genome-wide comparative gene family classification.PloS one · 2010Article
- Classification of protein kinases on the basis of both kinase and non-kinase regions.PloS one · 2010Article
- Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets.BMC bioinformatics · 2010Article
- Partially-supervised protein subclass discovery with simultaneous annotation of functional residues.BMC structural biology · 2009Article
- Comparison study on k-word statistical measures for protein: from sequence to 'sequence space'.BMC bioinformatics · 2008Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundThe rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important. The challenge is to identify subfamilies of evolutionarily related sequences. This identification reveals phylogenetic relationships, which provide prior knowledge to help researchers understand biological phenomena. A good evolutionary model is essential to achieve a clustering that reflects the biological reality, and an accurate estimate of protein sequence similarity is crucial to the building of such a model. Most existing algorithms estimate this similarity using techniques that are not necessarily biologically plausible, especially for hard-to-align sequences such as proteins with different domain structures, which cause many difficulties for the alignment-dependent algorithms. In this paper, we propose a novel similarity measure based on matching amino acid subsequences. This measure, named SMS for Substitution Matching Similarity, is especially designed for application to non-aligned protein sequences. It allows us to develop a new alignment-free algorithm, named CLUSS, for clustering protein families. To the best of our knowledge, this is the first alignment-free algorithm for clustering protein sequences. Unlike other clustering algorithms, CLUSS is effective on both alignable and non-alignable protein families. In the rest of the paper, we use the term "phylogenetic" in the sense of "relatedness of biological functions".
resultsTo show the effectiveness of CLUSS, we performed an extensive clustering on COG database. To demonstrate its ability to deal with hard-to-align sequences, we tested it on the GH2 family. In addition, we carried out experimental comparisons of CLUSS with a variety of mainstream algorithms. These comparisons were made on hard-to-align and easy-to-align protein sequences. The results of these experiments show the superiority of CLUSS in yielding clusters of proteins with similar functional activity.
conclusionWe have developed an effective method and tool for clustering protein sequences to meet the needs of biologists in terms of phylogenetic analysis and prediction of biological functions. Compared to existing clustering methods, CLUSS more accurately highlights the functional characteristics of the clustered families. It provides biologists with a new and plausible instrument for the analysis of protein sequences, especially those that cause problems for the alignment-dependent algorithms.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.