Demo Data from EDBT 2026 / reviewers in the wild / expert
Parthan Kasarapu
dblp:79/8163
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2015
0000-0002-8317-3649ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-author
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% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
structural bioinformatics |
0.2 | 1 | 2014 | On Sufficient Statistics of Least-Squares Superposition of Vector Sets · RECOMB 2014 |
Information theory › estimation theory
sufficient statistics |
0.1 | 1 | 2014 | On Sufficient Statistics of Least-Squares Superposition of Vector Sets · RECOMB 2014 |
Methods — techniques the papers use, named apart from their topics
sufficient statistics · 0.4least-squares fitting · 0.2least squares fitting · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Minimum message length estimation of mixtures of multivariate Gaussian and von Mises-Fisher distributions
Parthan Kasarapu, Lloyd Allison |
Mach. Learn. | 1 |
| 2014 | On Sufficient Statistics of Least-Squares Superposition of Vector Sets
Arun Siddharth Konagurthu, Parthan Kasarapu, Lloyd Allison, James H. Collier, Arthur M. Lesk |
RECOMB | 2 |
| 2014 | On Representing Protein Folding Patterns Using Non-Linear Parametric CurvesabstractProteins fold into complex three-dimensional shapes. Simplified representations of their shapes are central to rationalise, compare, classify, and interpret protein structures. Traditional methods to abstract protein folding patterns rely on representing their standard secondary structural elements (helices and strands of sheet) using line segments. This results in ignoring a significant proportion of structural information. The motivation of this research is to derive mathematically rigorous and biologically meaningful abstractions of protein folding patterns that maximize the economy of structural description and minimize the loss of structural information. We report on a novel method to describe a protein as a non-overlapping set of parametric three dimensional curves of varying length and complexity. Our approach to this problem is supported by information theory and uses the statistical framework of minimum message length (MML) inference. We demonstrate the effectiveness of our non-linear abstraction to support efficient and effective comparison of protein folding patterns on a large scale. Parthan Kasarapu, Maria Garcia de la Banda, Arun Siddharth Konagurthu |
IEEE ACM Trans. Comput. Biol. Bioinform. | 1 |