Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

S. Srivathsan

dblp:93/9779 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein structure analysis
0.112011
Multi-view methods for protein structure comparison using latent dirichlet allocation · Bioinform. 2011
Bioinformatics and computational biology › structural bioinformatics › protein structure database
protein structure retrieval
0.112011
Multi-view methods for protein structure comparison using latent dirichlet allocation · Bioinform. 2011
Bioinformatics and computational biology › structural bioinformatics
protein structure representation
0.012011
Multi-view methods for protein structure comparison using latent dirichlet allocation · Bioinform. 2011

Methods — techniques the papers use, named apart from their topics

multi-view retrieval · 0.1latent dirichlet allocation · 0.1
YearPublicationVenuePosition
2011 Multi-view methods for protein structure comparison using latent dirichlet allocation
abstract
MOTIVATION: With rapidly expanding protein structure databases, efficiently retrieving structures similar to a given protein is an important problem. It involves two major issues: (i) effective protein structure representation that captures inherent relationship between fragments and facilitates efficient comparison between the structures and (ii) effective framework to address different retrieval requirements. Recently, researchers proposed vector space model of proteins using bag of fragments representation (FragBag), which corresponds to the basic information retrieval model. RESULTS: In this article, we propose an improved representation of protein structures using latent dirichlet allocation topic model. Another important requirement is to retrieve proteins, whether they are either close or remote homologs. In order to meet diverse objectives, we propose multi-viewpoint based framework that combines multiple representations and retrieval techniques. We compare the proposed representation and retrieval framework on the benchmark dataset developed by Kolodny and co-workers. The results indicate that the proposed techniques outperform state-of-the-art methods. AVAILABILITY: http://www.cse.iitm.ac.in/~ashishvt/research/protein-lda/. CONTACT: [email protected].
S. Shivashankar, S. Srivathsan, Balaraman Ravindran, Ashish V. Tendulkar
Bioinform.2