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

David Fleer

dblp:32/7064 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Applied, 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.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
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
sequence analysis
0.112009
mkESA: enhanced suffix array construction tool · Bioinform. 2009
Algorithms and data structures › sequence algorithms › string algorithms
string indexing
0.112009
mkESA: enhanced suffix array construction tool · Bioinform. 2009
Algorithms and data structures › sequence algorithms › string algorithms › string indexing
suffix array construction
0.112009
mkESA: enhanced suffix array construction tool · Bioinform. 2009

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

parallelization · 0.2deep-shallow suffix array construction · 0.2
YearPublicationVenuePosition
2022 When Geometry is not Enough: Using Reflector Markers in Lidar SLAM
abstract
Lidar-based SLAM systems perform well in a wide range of circumstances by relying on the geometry of the environment. However, even mature and reliable approaches struggle when the environment contains structureless areas such as long hallways. To allow the use of lidar-based SLAM in such environments, we propose to add reflector markers in specific locations that would otherwise be difficult. We present an algorithm to reliably detect these markers and two approaches to fuse the detected markers with geometry-based scan matching. The performance of the proposed methods is demonstrated on real-world datasets from several industrial environments.
Gerhard Kurz, Sebastian A. Scherer, Peter Biber, David Fleer
IROS4
2009 mkESA: enhanced suffix array construction tool
abstract
Abstract Summary: We introduce the tool mkESA, an open source program for constructing enhanced suffix arrays (ESAs), striving for low memory consumption, yet high practical speed. mkESA is a user-friendly program written in portable C99, based on a parallelized version of the Deep-Shallow suffix array construction algorithm, which is known for its high speed and small memory usage. The tool handles large FASTA files with multiple sequences, and computes suffix arrays and various additional tables, such as the LCP table (longest common prefix) or the inverse suffix array, from given sequence data. Availability: The source code of mkESA is freely available under the terms of the GNU General Public License (GPL) version 2 at http://bibiserv.techfak.uni-bielefeld.de/mkesa/. Contact: [email protected]
Robert Homann, David Fleer, Robert Giegerich, Marc Rehmsmeier
Bioinform.2