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. M. Resenchuk

dblp:38/2529 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › multiple sequence alignment
alignment editing
0.011995
ALIGNMENT SERVICE: creation and processing of alignments of sequences of unlimited length · Comput. Appl. Biosci. 1995
Bioinformatics and computational biology
multiple sequence alignment
0.011995
ALIGNMENT SERVICE: creation and processing of alignments of sequences of unlimited length · Comput. Appl. Biosci. 1995
Bioinformatics and computational biology
sequence alignment
0.011995
ALIGNMENT SERVICE: creation and processing of alignments of sequences of unlimited length · Comput. Appl. Biosci. 1995
Bioinformatics and computational biology › sequence analysis
similarity search
0.011995
ALIGNMENT SERVICE: creation and processing of alignments of sequences of unlimited length · Comput. Appl. Biosci. 1995

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

semiautomatic alignment editor · 0.0
YearPublicationVenuePosition
1995 ALIGNMENT SERVICE: creation and processing of alignments of sequences of unlimited length
abstract
A package for the creation and processing of multiple sequence alignment is described. There is no limit on the lengths of the processed nucleotide or amino acid sequences, and the number of sequences in the alignment is also unlimited. The main groups of functions are: a semiautomatic alignment editor; a wide set of functions for technical processing of alignments; nucleotide alignment mapping and translation; and similarity search functions. A user-friendly interface and a set of generally used file actions provide a special operational subsystem for everyday tasks.
S. M. Resenchuk, V. M. Blinov
Comput. Appl. Biosci.1