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

A. Julich

dblp:17/4952 · 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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
sequence comparison		 0.011995
Implementations of BLAST for parallel computers · Comput. Appl. Biosci. 1995
Parallel and multicore computing
parallel programming models		 0.011995
Implementations of BLAST for parallel computers · Comput. Appl. Biosci. 1995
Parallel and multicore computing › parallel computing › parallel bioinformatics
parallel sequence search		 0.011995
Implementations of BLAST for parallel computers · Comput. Appl. Biosci. 1995

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

shared-memory parallelism · 0.0distributed-memory parallelism · 0.0
YearPublicationVenuePosition
1995 Implementations of BLAST for parallel computers
abstract
The BLAST sequence comparison programs have been ported to a variety of parallel computers-the shared memory machine Cray Y-MP 8/864 and the distributed memory architectures Intel iPSC/860 and nCUBE. Additionally, the programs were ported to run on workstation clusters. We explain the parallelization techniques and consider the pros and cons of these methods. The BLAST programs are very well suited for parallelization for a moderate number of processors. We illustrate our results using the program blastp as an example. As input data for blastp, a 799 residue protein query sequence and the protein database PIR were used.
A. Julich
 Comput. Appl. Biosci.1