Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
From MaRDI portal
Publication:2490599
Recommendations
- A Comparative Study of Protein Sequence Clustering Algorithms
- An efficient cluster analysis method for protein sequences
- Parallel approach for visual clustering of protein databases
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Extension and robustness of transitivity clustering for protein-protein interaction network analysis
Cited in
(13)- Fast maximal cliques enumeration in sparse graphs
- Numerical characteristics of word frequencies and their application to dissimilarity measure for sequence comparison
- A note on clustering the functionally-related paralogues and orthologues of proteins: a case of the FK506-binding proteins (FKBPs)
- Fuzzy clustering based on coverings
- An efficient cluster analysis method for protein sequences
- Parallel approach for visual clustering of protein databases
- scientific article; zbMATH DE number 2089974 (Why is no real title available?)
- A Comparative Study of Protein Sequence Clustering Algorithms
- Linear-time algorithm for generating c-isolated bicliques
- Some operations research methods for analyzing protein sequences and structures
- A dynamic programming algorithm for the maximum s-club problem on trees
- A finding maximal clique algorithm for predicting loop of protein structure
- The worst-case time complexity for generating all maximal cliques and computational experiments
This page was built for publication: Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490599)