Pages that link to "Item:Q2490599"
From MaRDI portal
The following pages link to Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques (Q2490599):
Displaying 10 items.
- A finding maximal clique algorithm for predicting loop of protein structure (Q849836) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- Fast maximal cliques enumeration in sparse graphs (Q1949748) (← links)
- Numerical characteristics of word frequencies and their application to dissimilarity measure for sequence comparison (Q2413831) (← links)
- A note on clustering the functionally-related paralogues and orthologues of proteins: a case of the FK506-binding proteins (FKBPs) (Q2490581) (← links)
- Fuzzy Clustering based on Coverings (Q2829662) (← links)
- An efficient cluster analysis method for protein sequences (Q2917162) (← links)
- A Comparative Study of Protein Sequence Clustering Algorithms (Q4930266) (← links)
- Linear-time algorithm for generating c-isolated bicliques (Q4976342) (← links)
- Some operations research methods for analyzing protein sequences and structures (Q5900888) (← links)
