Volker Heun

Publication Activity (10 Years)

Years Active: 1993-2017
Publications (10 Years): 1

Top Topics

Computational Biology

Space Efficient

Sequence Databases

Top Venues

Inform. Spektrum

Publications

Julien Gagneur, Caroline C. Friedel, Volker Heun, Ralf Zimmer, Burkhard Rost
Bioinformatics advances biology and medicine by turning big data troves into knowledge. Inform. Spektrum 40 (2) (2017)
Benjamin Albrecht, Volker Heun
Space Efficient Modifications to Structator - A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns. SEA (2012)
Johannes Fischer, Volker Heun
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. 40 (2) (2011)
Johannes Fischer, Volker Heun
Finding Range Minima in the Middle: Approximations and Applications. Math. Comput. Sci. 3 (1) (2010)
Volker Heun
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees. Inf. Process. Lett. 108 (4) (2008)
Volker Heun, Ralf Zimmer
Veranstaltung zum Tagungsmotto: Bioinformatik und Biotechnologie. GI Jahrestagung (2) (2008)
Johannes Fischer, Volker Heun
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA (2008)
Johannes Fischer, Volker Heun, Horst Martin Stühler
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. DCC (2008)
Simon W. Ginzinger, Thomas Gräupl, Volker Heun
SimShiftDB: Chemical-Shift-Based Homology Modeling. BIRD (2007)
Johannes Fischer, Volker Heun
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. ESCAPE (2007)
Johannes Fischer, Volker Heun, Stefan Kramer
Optimal String Mining Under Frequency Constraints. PKDD (2006)
Johannes Fischer, Volker Heun
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. CPM (2006)
Johannes Fischer, Volker Heun, Stefan Kramer
Fast Frequent String Mining Using Suffix Arrays. ICDM (2005)
Volker Heun
Approximate protein folding in the HP side chain model on extended cubic lattices. Discret. Appl. Math. 127 (1) (2003)
Volker Heun, Ernst W. Mayr
Efficient Embeddings into Hypercube-like Topologies. Comput. J. 46 (6) (2003)
Volker Heun, Ernst W. Mayr
Efficient Dynamic Embeddings of Binary Trees into Hypercubes. J. Algorithms 43 (1) (2002)
Volker Heun, Ernst W. Mayr
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes. J. Algorithms 43 (1) (2002)
Volker Heun, Ernst W. Mayr
Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes. J. Parallel Distributed Comput. 61 (8) (2001)
Volker Heun
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. ESA (1999)
Volker Heun, Wolfgang Merkle, Ulrich Weigand
Proving the PCP-Theorem. Lectures on Proof Verification and Approximation Algorithms (1997)
Volker Heun, Ernst W. Mayr
A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes. Euro-Par, Vol. I (1996)
Volker Heun, Ernst W. Mayr
Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes. IRREGULAR (1996)
Volker Heun, Ernst W. Mayr
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. J. Algorithms 20 (2) (1996)
Volker Heun, Ernst W. Mayr
Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. STACS (1996)
Volker Heun
Effiziente Einbettungen baumartiger Graphen in den Hyperwürfel. Ausgezeichnete Informatikdissertationen (1996)
Volker Heun, Ernst W. Mayr
A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube Forschungsberichte, TU Munich (1993)