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

Janusz Kaczmarek

dblp:60/1083 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · unresolved

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%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
DNA sequencing		 0.011997
Sequential and parallel algorithms for DNA sequencing · Comput. Appl. Biosci. 1997
Bioinformatics and computational biology › sequence analysis
sequence reconstruction		 0.011997
Sequential and parallel algorithms for DNA sequencing · Comput. Appl. Biosci. 1997
Bioinformatics and computational biology › genomics › DNA sequencing
sequencing by hybridization		 0.011997
Sequential and parallel algorithms for DNA sequencing · Comput. Appl. Biosci. 1997

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

parallel algorithm · 0.0combinatorial algorithm · 0.0
YearPublicationVenuePosition
1997 Sequential and parallel algorithms for DNA sequencing
abstract
MOTIVATION: Reconstruction of the original DNA sequence in the sequencing by the hybridization approach (SBH) requires computational support due to a large number of possible combinations. One can notice a lack of algorithms admitting false-negative data and giving in addition all possible solutions. RESULTS: In this paper, a new method of sequencing has been proposed. An algorithm based on its idea (for the general case, when some data are missing, like in the real experiment) has been implemented and tested. Authentic DNA sequences have been used for testing. A parallel version of the algorithm has also been implemented and tested. The quality of the reconstruction is satisfactory for the library of oligonucleotides of length between 8 and 12, and 100, 200 and 300 bp long sequences. A way to a further decrease in the computation time is also suggested.
Jacek Blazewicz, Janusz Kaczmarek, Marta Kasprzak, Wojciech T. Markiewicz, Jan Weglarz
 Comput. Appl. Biosci.2