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

V. A. Shepelev

dblp:32/2851 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—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%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
sequence analysis
0.011994
Multidimensional dot-matrices · Comput. Appl. Biosci. 1994
Bioinformatics and computational biology › sequence analysis › sequence visualization
sequence similarity visualization
0.011994
Multidimensional dot-matrices · Comput. Appl. Biosci. 1994

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

multidimensional projection · 0.0
YearPublicationVenuePosition
1994 Multidimensional dot-matrices
abstract
A generalization of the dot-matrix of similarity for n sequences is proposed. For the visualization of the n-dimensional dot-matrix, the n projections onto the plane passing through the main diagonal and each of the n axes of Euclidean space En are displayed. The projection is compressed so that the points at the coordinates (xi, sigma j not equal to ixj/(n - 1)) are depicted on the plane. The common regions of similarity are revealed as segments of straight lines parallel to the main diagonal. An algorithm for the n-dimensional dot-matrix calculation of time of the order of O[n*L2 + n*(L2p)2] is suggested where L is the mean length of sequence and p is the stringency parameter of the order of 10(-6). The method is illustrated for the family of plant phenylalanine ammonia-lyase genes.
V. A. Shepelev, N. V. Yanishevsky
Comput. Appl. Biosci.1