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
Demo Data from EDBT 2026 / reviewers in the wild / expert

A. V. Grigorjev

dblp:81/761 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1990
—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 › genomics › genome analysis
genome mapping		 0.011990
Mapping DNA by stochastic relaxation: a new approach to fragment sizes · Comput. Appl. Biosci. 1990
Bioinformatics and computational biology › sequence analysis › DNA sequence analysis
restriction mapping		 0.011990
Mapping DNA by stochastic relaxation: a new approach to fragment sizes · Comput. Appl. Biosci. 1990

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

stochastic relaxation · 0.0simulated annealing · 0.0least-squares refinement · 0.0
YearPublicationVenuePosition
1990 Mapping DNA by stochastic relaxation: a new approach to fragment sizes
abstract
Instead of the traditional manipulations with given fixed fragment lengths in the restriction map construction a method of varying the lengths is proposed and realized under the simulated annealing algorithm scheme. The described approach has no upper limit on the number of fragments mapped with even ordinary hardware. A program has been derived from the algorithm combined with the last-squares refinement procedure for both linear and circular maps. The algorithm's ability to pick up missed maps is illustrated and the problem of reducing the number of solutions is discussed.
A. V. Grigorjev, Andrey A. Mironov
 Comput. Appl. Biosci.1