Andreas W. M. Dress

According to our database1, Andreas W. M. Dress authored at least 80 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
On the Structure of Discrete Metric Spaces Isometric to Circles.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2016
Characterizing block graphs in terms of their vertex-induced partitions.
Australas. J Comb., 2016

2014
Detecting Community Structures in Networks Using a Linear-Programming Based Approach: a Review.
Proceedings of the Social Networks: A Framework of Computational Intelligence, 2014

A matroid associated with a phylogenetic tree.
Discret. Math. Theor. Comput. Sci., 2014

2013
Obtaining splits from cut sets of tight spans.
Discret. Appl. Math., 2013

ICT Strategies for Bridging Biology and Precision Medicine (Dagstuhl Perspectives Workshop 13342).
Dagstuhl Reports, 2013

ICT for Bridging Biology and Medicine (Dagstuhl Perspectives Workshop 13342).
Dagstuhl Manifestos, 2013

Ultrametric networks: a new tool for phylogenetic analysis.
Algorithms Mol. Biol., 2013

2012
Structure Discovery in Biology: Motifs, Networks & Phylogenies (Dagstuhl Seminar 12291).
Dagstuhl Reports, 2012

Translationale und personalisierte Medizin -ein Einsatzfeld für SOA, Grid und Cloud.
Proceedings of the 57. Jahrestagung der Deutschen Gesellschaft für Medizinische Informatik, Biometrie und Epidemiologie, 42. Jahrestagung der Gesellschaft für Informatik, Was bewegt uns in der/die Zukunft?, 2012

Basic Phylogenetic Combinatorics.
Cambridge University Press, ISBN: 978-0-521-76832-0, 2012

2011
Blocks and Cut Vertices of the Buneman Graph.
SIAM J. Discret. Math., 2011

Retraction: Towards Prediction and Prioritization of disease genes by the modularity of human phenome-genome assembled network.
J. Integr. Bioinform., 2011

Dynamics of a Discrete-Time Model of an "Ideal-Storage" System Describing Hetero-Catalytic Processes on metal Surfaces.
Int. J. Bifurc. Chaos, 2011

'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers
CoRR, 2011

2010
An Algorithm for Computing Cutpoints in Finite Metric Spaces.
J. Classif., 2010

A note on single-linkage equivalence.
Appl. Math. Lett., 2010

The Ideal Storage Cellular Automaton Model.
Proceedings of the Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06., 2010

10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies.
Proceedings of the Structure Discovery in Biology: Motifs, Networks & Phylogenies, 06.06., 2010

2009
Preface.
Discret. Appl. Math., 2009

Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support.
Discret. Appl. Math., 2009

A spectral clustering-based framework for detecting community structures in complex networks.
Appl. Math. Lett., 2009

A Hall-type theorem for triplet set systems based on medians in trees.
Appl. Math. Lett., 2009

Barriers in metric spaces.
Appl. Math. Lett., 2009

A graph-theoretical invariant of topological spaces.
Appl. Math. Lett., 2009

Towards Identification of Human Disease Phenotype-Genotype Association via a Network-Module Based Method.
Proceedings of the 2009 IEEE International Conference on Bioinformatics and Biomedicine, 2009

2008
Community Structures of Networks.
Math. Comput. Sci., 2008

Preface.
J. Comb. Optim., 2008

Compatible decompositions and block realizations of finite metrics.
Eur. J. Comb., 2008

Block realizations of finite metrics and the tight-span construction I: The embedding theorem.
Appl. Math. Lett., 2008

Cut points in metric spaces.
Appl. Math. Lett., 2008

Stability of multiple alignments and phylogenetic trees: an analysis of ABC-transporter proteins family.
Algorithms Mol. Biol., 2008

Noisy: Identification of problematic columns in multiple sequence alignments.
Algorithms Mol. Biol., 2008

Recent Progress in Phylogenetic Combinatorics.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
On the dependence polynomial of a graph.
Eur. J. Comb., 2007

Linearly independent split systems.
Eur. J. Comb., 2007

An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
Combinatorics of lopsided sets.
Eur. J. Comb., 2006

2005
Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform.
Discret. Appl. Math., 2005

2004
Constructing Splits Graphs.
IEEE ACM Trans. Comput. Biol. Bioinform., 2004

A new scale-invariant geometry on <i>L</i>1 spaces.
Appl. Math. Lett., 2004

Semiharmonic graphs with fixed cyclomatic number.
Appl. Math. Lett., 2004

2003
Addendum to "on line arrangements in the hyperbolic plane" [European J. Combin.23 (2002) 549-557].
Eur. J. Comb., 2003

AltAVisT: Comparing alternative multiple sequence alignments.
Bioinform., 2003

Hoffman-type identities.
Appl. Math. Lett., 2003

A simple proof of the triangle inequality for the NTV metric.
Appl. Math. Lett., 2003

Semiharmonic trees and monocyclic graphs.
Appl. Math. Lett., 2003

The number of walks in a grap.
Appl. Math. Lett., 2003

Asymptotic results regarding the number of walks in a graph.
Appl. Math. Lett., 2003

Connectivity calculus.
Appl. Math. Lett., 2003

2002
On Line Arrangements in the Hyperbolic Plane.
Eur. J. Comb., 2002

Antipodal Metrics and Split Systems.
Eur. J. Comb., 2002

Exon discovery by genomic sequence alignment.
Bioinform., 2002

Proper gromov transforms of metrics are metrics.
Appl. Math. Lett., 2002

Steiner's problem in double trees.
Appl. Math. Lett., 2002

2001
Six Points Suffice: How to Check for Metric Consistency.
Eur. J. Comb., 2001

2000
Algorithmic Aspects of Tree Amalgamation.
J. Algorithms, 2000

Affine Maps That Induce Polyhedral Complex Isomorphisms.
Discret. Comput. Geom., 2000

1999
Some new perspectives regarding sparse continuous models for discrete data structures.
Electron. Notes Discret. Math., 1999

A database framework for mapping expression patterns.
Proceedings of the German Conference on Bioinformatics, 1999

1998
Two Finiteness Theorems for Periodic Tilings of d-Dimensional Euclidean Space.
Discret. Comput. Geom., 1998

DIALIGN: finding local similarities by multiple sequence alignment.
Bioinform., 1998

Segment-Based Scores for Pairwise and Multiple Sequence Alignments.
Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB-98), Montréal, Québec, Canada, June 28, 1998

1997
Two applications of the Divide&Conquer principle in the molecular sciences.
Math. Program., 1997

Topological Resonance Energy of Fullerenes.
J. Chem. Inf. Comput. Sci., 1997

A Constructive Enumeration of Fullerenes.
J. Algorithms, 1997

DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.
Comput. Appl. Biosci., 1997

Iterative versus simultaneous Multiple Sequence Alignment (Abstract).
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996
T-theory: An Overview.
Eur. J. Comb., 1996

Analyzing and Visualizing Sequence and Distance Data Using SplitsTree.
Discret. Appl. Math., 1996

Vergleichende Analyse von HTLV-I-Nukleotidsequenzen mittels Split-Zerlegungsmethode.
Proceedings of the Medizinische Informatik, Biometrie und Epidemiologie, 1996

Towards a theory of holistic clustering.
Proceedings of the Mathematical Hierarchies and Biology, 1996

1995
A Divide and Conquer Approach to Multiple Alignment.
Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, 1995

1994
An order theoretic framework for overlapping clustering.
Discret. Math., 1994

1991
On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields.
Theor. Comput. Sci., 1991

Bound Smoothing under Chirality Constraints.
SIAM J. Discret. Math., 1991

1988
On Matroids which have Precisely One Basis in Common.
Eur. J. Comb., 1988

Shortest-path problems and molecular conformation.
Discret. Appl. Math., 1988

1987
On some combinatorial properties of algebraic matroids.
Comb., 1987

1986
The 37 combinatorial types of minimal, non-transitive, equivariant tilings of the Euclidean plane.
Discret. Math., 1986


  Loading...