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

Matija Korpar

dblp:129/1461 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—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
GPUs and heterogeneous computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence alignment
local alignment		 0.212013
SW#-GPU-enabled exact alignments on genome scale · Bioinform. 2013
Bioinformatics and computational biology
sequence alignment		 0.212013
SW#-GPU-enabled exact alignments on genome scale · Bioinform. 2013
GPUs and heterogeneous computing
GPU-accelerated bioinformatics		 0.012013
SW#-GPU-enabled exact alignments on genome scale · Bioinform. 2013

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

smith-waterman algorithm · 0.3dynamic programming · 0.3CUDA · 0.3
YearPublicationVenuePosition
2013 SW#-GPU-enabled exact alignments on genome scale
abstract
SUMMARY: We propose SW#, a new CUDA graphical processor unit-enabled and memory-efficient implementation of dynamic programming algorithm, for local alignment. It can be used as either a stand-alone application or a library. Although there are other graphical processor unit implementations of the Smith-Waterman algorithm, SW# is the only one publicly available that can produce sequence alignments on genome-wide scale. For long sequences, it is at least a few hundred times faster than a CPU version of the same algorithm. AVAILABILITY: Source code and installation instructions freely available for download at http://complex.zesoi.fer.hr/SW.html.
Matija Korpar, Mile Sikic
 Bioinform.1