scholarly journals Evaluation and improvements of clustering algorithms for detecting remote homologous protein families

2015 ◽  
Vol 16 (1) ◽  
Author(s):  
Juliana S Bernardes ◽  
Fabio RJ Vieira ◽  
Lygia MM Costa ◽  
Gerson Zaverucha
2014 ◽  
Vol 23 (9) ◽  
pp. 1220-1234 ◽  
Author(s):  
Jimin Pei ◽  
Wenlin Li ◽  
Lisa N. Kinch ◽  
Nick V. Grishin

1988 ◽  
Vol 2 (3) ◽  
pp. 193-199 ◽  
Author(s):  
D. Altschuh ◽  
T. Vernet ◽  
P. Berti ◽  
D. Moras ◽  
K. Nagai

2001 ◽  
Vol 17 (8) ◽  
pp. 748-749 ◽  
Author(s):  
P. I. W. de Bakker ◽  
A. Bateman ◽  
D. F. Burke ◽  
R. N. Miguel ◽  
K. Mizuguchi ◽  
...  

2016 ◽  
Author(s):  
Alice Coucke ◽  
Guido Uguzzoni ◽  
Francesco Oteri ◽  
Simona Cocco ◽  
Remi Monasson ◽  
...  

AbstractCoevolution of residues in contact imposes strong statistical constraints on the sequence variability between homologous proteins. Direct-Coupling Analysis (DCA), a global statistical inference method, successfully models this variability across homologous protein families to infer structural information about proteins. For each residue pair, DCA infers 21×21 matrices describing the coevolutionary coupling for each pair of amino acids (or gaps). To achieve the residue-residue contact prediction, these matrices are mapped onto simple scalar parameters; the full information they contain gets lost. Here, we perform a detailed spectral analysis of the coupling matrices resulting from 70 protein families, to show that they contain quantitative information about the physico-chemical properties of amino-acid interactions. Results for protein families are corroborated by the analysis of synthetic data from lattice-protein models, which emphasizes the critical effect of sampling quality and regularization on the biochemical features of the statistical coupling matrices.


2017 ◽  
Vol 12 (1) ◽  
Author(s):  
Daria V. Dibrova ◽  
Kirill A. Konovalov ◽  
Vadim V. Perekhvatov ◽  
Konstantin V. Skulachev ◽  
Armen Y. Mulkidjanian

Author(s):  
Mohana Priya K ◽  
Pooja Ragavi S ◽  
Krishna Priya G

Clustering is the process of grouping objects into subsets that have meaning in the context of a particular problem. It does not rely on predefined classes. It is referred to as an unsupervised learning method because no information is provided about the "right answer" for any of the objects. Many clustering algorithms have been proposed and are used based on different applications. Sentence clustering is one of best clustering technique. Hierarchical Clustering Algorithm is applied for multiple levels for accuracy. For tagging purpose POS tagger, porter stemmer is used. WordNet dictionary is utilized for determining the similarity by invoking the Jiang Conrath and Cosine similarity measure. Grouping is performed with respect to the highest similarity measure value with a mean threshold. This paper incorporates many parameters for finding similarity between words. In order to identify the disambiguated words, the sense identification is performed for the adjectives and comparison is performed. semcor and machine learning datasets are employed. On comparing with previous results for WSD, our work has improvised a lot which gives a percentage of 91.2%


2017 ◽  
Vol 5 (12) ◽  
pp. 323-325
Author(s):  
E. Mahima Jane ◽  
◽  
◽  
E. George Dharma Prakash Raj

Sign in / Sign up

Export Citation Format

Share Document