Demo Data from EDBT 2026 / reviewers in the wild / expert
Nigel Douglas
dblp:36/997
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1
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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
multiple sequence alignment |
0.0 | 1 | 2002 | Parallelized multiple alignment · Bioinform. 2002 |
Bioinformatics and computational biology › multiple sequence alignment
parallel multiple sequence alignment |
0.0 | 1 | 2002 | Parallelized multiple alignment · Bioinform. 2002 |
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 2002 | Parallelized multiple alignment · Bioinform. 2002 |
Parallel and multicore computing › parallel programming models
message passing |
0.0 | 1 | 2002 | Parallelized multiple alignment · Bioinform. 2002 |
Methods — techniques the papers use, named apart from their topics
SIMD · 0.1MPI · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Parallelized multiple alignmentabstractUNLABELLED: Multiple sequence alignment is a frequently used technique for analyzing sequence relationships. Compilation of large alignments is computationally expensive, but processing time can be considerably reduced when the computational load is distributed over many processors. Parallel processing functionality in the form of single-instruction multiple-data (SIMD) technology was implemented into the multiple alignment program Praline by using 'message passing interface' (MPI) routines. Over the alignments tested here, the parallelized program performed up to ten times faster on 25 processors compared to the single processor version. AVAILABILITY: Example program code for parallelizing pairwise alignment loops is available from http://mathbio.nimr.mrc.ac.uk/~jkleinj/tools/mpicode. The 'message passing interface' package (MPICH) is available from http:/www.unix.mcs.anl.gov/mpi/mpich. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Praline is accessible at http://mathbio.nimr.mrc.ac.uk/praline. Jens Kleinjung, Nigel Douglas, Jaap Heringa |
Bioinform. | 2 |