Demo Data from VLDB 2026 / reviewers in the wild / expert
V. V. Panjukov
dblp:72/2350
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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 |
Algorithms and data structures · 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
sequence alignment |
0.0 | 1 | 1993 | Finding steady alignments: similarity and distance · Comput. Appl. Biosci. 1993 |
Algorithms and data structures › sequence algorithms › string algorithms
sequence alignment algorithm |
0.0 | 1 | 1993 | Finding steady alignments: similarity and distance · Comput. Appl. Biosci. 1993 |
Methods — techniques the papers use, named apart from their topics
gap penalty analysis · 0.0dynamic programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Finding steady alignments: similarity and distanceabstractCertain alignments keep the optimum despite the weight parameters varying over a range of values. Alignments of this kind are called steady. A method finding all the steady optimal alignments of two sequences is presented providing that a gap penalty is directly proportional to gap length. It has been discovered previously that a weight of < 0.5 for one insertion/deletion forces the similarity and distance out of equivalence. An account for this fact is given. V. V. Panjukov |
Comput. Appl. Biosci. | 1 |