Markus E. Nebel
YOU?
Author Swipe
View article: Multiway Powersort
Multiway Powersort Open
We present a stable mergesort variant, Multiway Powersort, that exploits existing runs and finds nearly-optimal merging orders for k-way merges with negligible overhead. This builds on Powersort (Munro & Wild, ESA2018), which has recently …
View article: On the use of sequence-quality information in OTU clustering
On the use of sequence-quality information in OTU clustering Open
Background High-throughput sequencing has become an essential technology in life science research. Despite continuous improvements in technology, the produced sequences are still not entirely accurate. Consequently, the sequences are usual…
View article: Evaluation data for "On the use of sequence-quality information in OTU clustering"
Evaluation data for "On the use of sequence-quality information in OTU clustering" Open
Prepared data sets and aggregated results of the comparative evaluation of [GeFaST](https://github.com/romueller/gefast)'s quality-aware clustering and refinement methods performed in "On the use of sequence-quality information in OTU clus…
View article: Scalable Data Structures (Dagstuhl Seminar 21071)
Scalable Data Structures (Dagstuhl Seminar 21071) Open
This report documents the program and the outcomes of Dagstuhl Seminar 21071 "Scalable Data Structure". Even if the field of data structures is quite mature, new trends and limitations in computer hardware together with the ever-increasing…
View article: Median-of-<i>k</i> Jumplists and Dangling-Min BSTs
Median-of-<i>k</i> Jumplists and Dangling-Min BSTs Open
We extend randomized jumplists introduced by Br\\"onnimann et al. (STACS 2003)\nto choose jump-pointer targets as median of a small sample for better search\ncosts, and present randomized algorithms with expected $O(\\log n)$ time\ncomplex…
View article: Additional file 2 of GeFaST: An improved method for OTU assignment by generalising Swarmâ s fastidious clustering approach
Additional file 2 of GeFaST: An improved method for OTU assignment by generalising Swarmâ s fastidious clustering approach Open
Tabular data showing results on the statistical significance of differences in clustering quality on the uneven data set. (CSV 220 KB)
View article: Additional file 4 of GeFaST: An improved method for OTU assignment by generalising Swarmâ s fastidious clustering approach
Additional file 4 of GeFaST: An improved method for OTU assignment by generalising Swarmâ s fastidious clustering approach Open
Tabular data showing results on the statistical significance of differences in clustering quality on the eldermet data set. (CSV 86 KB)
View article: Evaluation data for "GeFaST: An improved method for OTU assignment by generalising Swarm's fastidious clustering approach"
Evaluation data for "GeFaST: An improved method for OTU assignment by generalising Swarm's fastidious clustering approach" Open
Data sets and results of the comparative analyses of [GeFaST](https://github.com/romueller/gefast) performed in "[GeFaST: An improved method for OTU assignment by generalising Swarm's fastidious clustering approach](https://bmcbioinformati…
View article: Additional file 3 of GeFaST: An improved method for OTU assignment by generalising Swarmâ s fastidious clustering approach
Additional file 3 of GeFaST: An improved method for OTU assignment by generalising Swarmâ s fastidious clustering approach Open
Tabular data showing results on the statistical significance of differences in clustering quality on the even data set. (CSV 219 KB)
View article: Median-of-k Jumplists
Median-of-k Jumplists Open
We extend randomized jumplists introduced by Br\onnimann et al. (STACS 2003) to choose jump-pointer targets as median of a small sample, and present randomized algorithms with expected $O(\log n)$ time complexity that maintain the probabil…
View article: Median-of-k Jumplists and Dangling-Min BSTs
Median-of-k Jumplists and Dangling-Min BSTs Open
We extend randomized jumplists introduced by Brönnimann et al. (STACS 2003) to choose jump-pointer targets as median of a small sample for better search costs, and present randomized algorithms with expected $O(\log n)$ time complexity tha…
View article: Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101)
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101) Open
This report documents the program and the outcomes of Dagstuhl Seminar 16101 "Data Structures and Advanced Models of Computation on Big Data". In today's computing environment vast amounts of data are processed, exchanged and analyzed. The…