Knut Reinert

Orcid: 0000-0003-3078-8129

Affiliations:
  • Free University of Berlin, Germany


According to our database1, Knut Reinert authored at least 101 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decoil: Reconstructing Extrachromosomal DNA Structural Heterogeneity from Long-Read Sequencing Data.
Proceedings of the Research in Computational Molecular Biology, 2024

Optimizing Job/Task Granularity for Metagenomic Workflows in Heterogeneous Cluster Infrastructures.
Proceedings of the Workshops of the EDBT/ICDT 2024 Joint Conference co-located with the EDBT/ICDT 2024 Joint Conference, 2024

CuttleFlow: Infrastructure-Specific Workflow Adaption for Improved Reusability.
Proceedings of the 20th IEEE International Conference on e-Science, 2024

2023
A mathematical programming approach for resource allocation of data analysis workflows on heterogeneous clusters.
J. Supercomput., November, 2023

Linear: a framework to enable existing software to resolve structural variants in long reads with flexible and efficient alignment-free statistical models.
Briefings Bioinform., March, 2023

A multi-view latent variable model reveals cellular heterogeneity in complex tissues for paired multimodal single-cell data.
Bioinform., January, 2023

2022
LaRA 2: parallel and vectorized program for sequence-structure alignment of RNA sequences.
BMC Bioinform., 2022

Needle: a fast and space-efficient prefilter for estimating the quantification of very large collections of expression experiments.
Bioinform., 2022

Co-Design for Energy Efficient and Fast Genomic Search: Interleaved Bloom Filter on FPGA.
Proceedings of the FPGA '22: The 2022 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, Virtual Event, USA, 27 February 2022, 2022

2021
The Collaborative Research Center FONDA.
Datenbank-Spektrum, 2021

SCORE: Smart Consensus Of RNA Expression - a consensus tool for detecting differentially expressed genes in bacteria.
Bioinform., 2021

RLM: fast and simplified extraction of read-level methylation metrics from bisulfite sequencing data.
Bioinform., 2021

Computational strategies to combat COVID-19: useful tools to accelerate SARS-CoV-2 and coronavirus research.
Briefings Bioinform., 2021

PriSeT: efficient <i>de novo</i> primer discovery.
Proceedings of the BCB '21: 12th ACM International Conference on Bioinformatics, 2021

2020
Ranbow: A fast and accurate method for polyploid haplotype reconstruction.
PLoS Comput. Biol., 2020

Portability of Scientific Workflows in NGS Data Analysis: A Case Study.
CoRR, 2020

GenMap: ultra-fast computation of genome mappability.
Bioinform., 2020

ganon: precise metagenomics classification against large and up-to-date sets of reference sequences.
Bioinform., 2020

2018
Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading.
Bioinform., 2018

DREAM-Yara: an exact read mapper for very large databases with short update time.
Bioinform., 2018

2017
FAMOUS: Fast Approximate string Matching using OptimUm search Schemes.
CoRR, 2017

Flexbar 3.0 - SIMD and multicore parallelization.
Bioinform., 2017

Vaquita: Fast and Accurate Identification of Structural Variation Using Combined Evidence.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

EPR-Dictionaries: A Practical and Fast Data Structure for Constant Time Searches in Unidirectional and Bidirectional FM Indices.
Proceedings of the Research in Computational Molecular Biology, 2017

2016
Next Generation Sequencing (Dagstuhl Seminar 16351).
Dagstuhl Reports, 2016

Constant-time and space-efficient unidirectional and bidirectional FM-indices using EPR-dictionaries.
CoRR, 2016

From the desktop to the grid: scalable bioinformatics via workflow conversion.
BMC Bioinform., 2016

2015
IMSEQ - a fast and error aware approach to immunogenetic sequence analysis.
Bioinform., 2015

LocalAli: an evolutionary-based local alignment approach to identify functionally <i>conserved</i> modules in multiple networks.
Bioinform., 2015

Methods for the detection and assembly of novel sequence in high-throughput sequencing data.
Bioinform., 2015

CIDANE: Comprehensive Isoform Discovery and Abundance Estimation.
Proceedings of the Research in Computational Molecular Biology, 2015

2014
Genome alignment with graph data structures: a comparison.
BMC Bioinform., 2014

Gustaf: Detecting and correctly classifying SVs in the NGS twilight zone.
Bioinform., 2014

Fiona: a parallel and automatic strategy for read error correction.
Bioinform., 2014

Journaled string tree - a scalable data structure for analyzing thousands of similar genomes on your laptop.
Bioinform., 2014

NetCoffee: a fast and accurate global alignment approach to identify functionally conserved proteins in multiple networks.
Bioinform., 2014

Lambda: the local aligner for massive biological data.
Bioinform., 2014

2013
The Duplication-Loss Small Phylogeny Problem: From Cherries to Trees.
J. Comput. Biol., 2013

Optimal precursor ion selection for LC-MALDI MS/MS.
BMC Bioinform., 2013

From the Desktop to the Grid: conversion of KNIME Workflows to gUSE.
Proceedings of the 5th International Workshop on Science Gateways, 2013

Scalable string similarity search/join with approximate seeds and multiple backtracking.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012
Antilope - A Lagrangian Relaxation Approach to the de novo Peptide Sequencing Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Fast and sensitive read mapping with approximate seeds and multiple backtracking
CoRR, 2012

PPINGUIN: Peptide Profiling Guided Identification of Proteins improves quantitation of iTRAQ ratios.
BMC Bioinform., 2012

RazerS 3: Faster, fully sensitive read mapping.
Bioinform., 2012

Detecting genomic indel variants with exact breakpoints in single- and paired-end sequencing data using SplazerS.
Bioinform., 2012

Hidden Breakpoints in Genome Alignments.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
STELLAR: fast and exact local alignments.
BMC Bioinform., 2011

A Novel And Well-Defined Benchmarking Method For Second Generation Read Mapping.
BMC Bioinform., 2011

Biomarker Discovery and Redundancy Reduction towards Classification using a Multi-factorial MALDI-TOF MS T2DM Mouse Model Dataset.
BMC Bioinform., 2011

2010
Oops I Did it Again... Sustainability in Sequence Analysis via Software Libraries.
ERCIM News, 2010

MicroRazerS: rapid alignment of small RNA reads.
Bioinform., 2010

OpenMS and TOPP: Open Source Software for LC-MS Data Analysis.
Proceedings of the Proteome Bioinformatics, 2010

2009
A consistency-based consensus algorithm for <i>de novo</i> and reference-guided sequence assembly of short reads.
Bioinform., 2009

Statistical quality assessment and outlier detection for liquid chromatography-mass spectrometry experiments.
BioData Min., 2009

Fast Structural Alignment of Biomolecules Using a Hash Table, N-Grams and String Descriptors.
Algorithms, 2009

Integer Linear Programming in Computational Biology.
Proceedings of the Efficient Algorithms, 2009

Biological Sequence Analysis Using the SeqAn C++ Library.
Chapman and Hall / CRC mathematical and computational biology series, CRC Press, ISBN: 978-1-4200-7623-3, 2009

2008
Computational Quantification of Peptides from LC-MS Data.
J. Comput. Biol., 2008

OpenMS - An open-source software framework for mass spectrometry.
BMC Bioinform., 2008

LC-MSsim - a simulation software for liquid chromatography mass spectrometry data.
BMC Bioinform., 2008

Robust consensus computation.
BMC Bioinform., 2008

SeqAn An efficient, generic C++ library for sequence analysis.
BMC Bioinform., 2008

An Exact Mathematical Programming Approach to Multiple RNA Sequence-Structure Alignment.
Algorithmic Oper. Res., 2008

Fast and Adaptive Variable Order Markov Chain Construction.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Segment-based multiple sequence alignment.
Proceedings of the ECCB'08 Proceedings, 2008

08101 Abstracts Collection - Computational Proteomics.
Proceedings of the Computational Proteomics, 02.03. - 07.03.2008, 2008

2007
Integer linear programming approaches for non-unique probe selection.
Discret. Appl. Math., 2007

Accurate multiple sequence-structure alignment of RNA sequences using combinatorial optimization.
BMC Bioinform., 2007

TOPP - the OpenMS proteomics pipeline.
Bioinform., 2007

A Fast and Accurate Algorithm for the Quantification of Peptides from Mass Spectrometry Data.
Proceedings of the Research in Computational Molecular Biology, 2007

A geometric approach for the alignment of liquid chromatography - mass spectrometry data.
Proceedings of the Proceedings 15th International Conference on Intelligent Systems for Molecular Biology (ISMB) & 6th European Conference on Computational Biology (ECCB), 2007

A General Paradigm for Fast, Adaptive Clustering of Biological Sequences.
Proceedings of the German Conference on Bioinformatics, 2007

2006
A branch-and-cut algorithm for multiple sequence alignment.
Math. Program., 2006

High-Accuracy Peak Picking of Proteomics Data Using Wavelet Techniques.
Proceedings of the Biocomputing 2006, 2006

2005
Transformation and other factors of the peptide mass spectrometry pairwise peak-list comparison process.
BMC Bioinform., 2005

Calibration of mass spectrometric peptide mass fingerprint data without specific external or internal calibrants.
BMC Bioinform., 2005

Multiple Structural RNA Alignment with Lagrangian Relaxation.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

05471 Abstract Collection - Computational Proteomics.
Proceedings of the Computational Proteomics, 20.-25. November 2005, 2005

05471 Executive Summary - Computational Proteomics.
Proceedings of the Computational Proteomics, 20.-25. November 2005, 2005

Evaluation of LC-MS data for the absolute quantitative analysis of marker proteins.
Proceedings of the Computational Proteomics, 20.-25. November 2005, 2005

Algorithms for the Automated Absolute Quantification of Diagnostic Markers in Complex Proteomics Samples.
Proceedings of the Computational Life Sciences, First International Symposium, 2005

Fast and Accurate Structural RNA Alignment by Progressive Lagrangian Optimization.
Proceedings of the Computational Life Sciences, First International Symposium, 2005

2004
Differenzielle Proteomanalyse - Experimentelle Methoden, algorithmische Herausforderungen (Differential Analysis in Proteomics: Experimental Methods, Algorithmic Challenges).
it Inf. Technol., 2004

Optimal robust non-unique probe selection using Integer Linear Programming.
Proceedings of the Proceedings Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology 2004, 2004

2002
The greedy path-merging algorithm for contig scaffolding.
J. ACM, 2002

Segment Match Refinement and Applications.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

2001
Comparing Assemblies Using Fragments and Mate-Pairs.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

The greedy path-merging algorithm for sequence assembly.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Visualization challenges for a new cyberpharmaceutical computing paradigm.
Proceedings of the IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics, 2001

Design of a compartmentalized shotgun assembler for the human genome.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

2000
The Practical Use of the A* Algorithm for Exact Multiple Sequence Alignment.
J. Comput. Biol., 2000

A polyhedral approach to sequence alignment problems.
Discret. Appl. Math., 2000

An iterative method for faster sum-of-pairs multiple sequence alignment.
Bioinform., 2000

1999
A polyhedral approach to sequence alignment problems.
PhD thesis, 1999

An exact solution for the segment-to-segment multiple sequence alignment problem.
Bioinform., 1999

Combining Divide-and-Conquer, the A<sup>*</sup>-Algorithm, and Successive Realignment Approaches to Speed Multiple Sequence Alignment.
Proceedings of the German Conference on Bioinformatics, 1999

1998
A Polyhedral Approach to RNA Sequence Structure Alignment.
J. Comput. Biol., 1998

1997
A branch-and-cut algorithm for multiple sequence alignment.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

1996
Lower Bounds for Row Minima Searching (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996


  Loading...