The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas W. M. Dress: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas W. M. Dress
    Iterative versus simultaneous Multiple Sequence Alignment (Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:275- [Conf]
  2. Xin Chen, Andreas W. M. Dress, Holger Karas, Ingmar Reuter, Edgar Wingender
    A database framework for mapping expression patterns. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1999, pp:174-178 [Conf]
  3. C. Stock, B. Volkmer, Udo Tönges, M. Silva, Andreas W. M. Dress, Andreas Krämer
    Vergleichende Analyse von HTLV-I-Nukleotidsequenzen mittels Split-Zerlegungsmethode. [Citation Graph (0, 0)][DBLP]
    GMDS, 1996, pp:533-537 [Conf]
  4. Andreas W. M. Dress, Georg Füllen, Sören Perrey
    A Divide and Conquer Approach to Multiple Alignment. [Citation Graph (0, 0)][DBLP]
    ISMB, 1995, pp:107-113 [Conf]
  5. Burkhard Morgenstern, William R. Atchley, Klaus Hahn, Andreas W. M. Dress
    Segment-Based Scores for Pairwise and Multiple Sequence Alignments. [Citation Graph (0, 0)][DBLP]
    ISMB, 1998, pp:115-121 [Conf]
  6. Dietmar Cieslik, Andreas W. M. Dress, Walter M. Fitch
    Steiner's problem in double trees. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2002, v:15, n:7, pp:855-860 [Journal]
  7. Dietmar Cieslik, Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Connectivity calculus. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:3, pp:395-399 [Journal]
  8. Andreas W. M. Dress
    Proper gromov transforms of metrics are metrics. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2002, v:15, n:8, pp:995-999 [Journal]
  9. Andreas W. M. Dress, Ivan Gutman
    Asymptotic results regarding the number of walks in a graph. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:3, pp:388-393 [Journal]
  10. Andreas W. M. Dress, Ivan Gutman
    The number of walks in a grap. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:5, pp:797-801 [Journal]
  11. Andreas W. M. Dress, Stefan Grünewald
    Semiharmonic trees and monocyclic graphs. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:8, pp:1329-1332 [Journal]
  12. Andreas W. M. Dress, Stefan Grünewald, Dragan Stevanovic
    Semiharmonic graphs with fixed cyclomatic number. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2004, v:17, n:6, pp:623-629 [Journal]
  13. Andreas W. M. Dress, Tatiana Lokot
    A simple proof of the triangle inequality for the NTV metric. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:6, pp:809-813 [Journal]
  14. Andreas W. M. Dress, Tatiana Lokot, L. D. Pustyl'nikov
    A new scale-invariant geometry on L1 spaces. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2004, v:17, n:7, pp:815-820 [Journal]
  15. Andreas W. M. Dress, Dragan Stevanovic
    Hoffman-type identities. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:3, pp:297-302 [Journal]
  16. Burkhard Morgenstern, Kornelie Frech, Andreas W. M. Dress, Thomas Werner
    DIALIGN: finding local similarities by multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 1998, v:14, n:3, pp:290-294 [Journal]
  17. Burkhard Morgenstern, Sachin Goel, Alexander Sczyrba, Andreas W. M. Dress
    AltAVisT: Comparing alternative multiple sequence alignments. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:3, pp:425-426 [Journal]
  18. Burkhard Morgenstern, Oliver Rinner, Saïd Abdeddaïm, Dirk Haase, Klaus F. X. Mayer, Andreas W. M. Dress, Hans-Werner Mewes
    Exon discovery by genomic sequence alignment. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2002, v:18, n:6, pp:777-787 [Journal]
  19. Jens Stoye, Vincent Moulton, Andreas W. M. Dress
    DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1997, v:13, n:6, pp:625-626 [Journal]
  20. Andreas W. M. Dress, László Lovász
    On some combinatorial properties of algebraic matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:39-48 [Journal]
  21. Andreas W. M. Dress, Barbara Holland, Katharina T. Huber, Jack H. Koolen, Vincent Moulton, Jan Weyer-Menkhoff
    Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:1, pp:51-73 [Journal]
  22. Andreas W. M. Dress, Daniel H. Huson, Vincent Moulton
    Analyzing and Visualizing Sequence and Distance Data Using SplitsTree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:95-109 [Journal]
  23. Nikolai P. Dolbilin, Andreas W. M. Dress, Daniel H. Huson
    Two Finiteness Theorems for Periodic Tilings of d-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:2, pp:143-153 [Journal]
  24. Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Affine Maps That Induce Polyhedral Complex Isomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:1, pp:49-60 [Journal]
  25. Hans-Jürgen Bandelt, Victor Chepoi, Andreas W. M. Dress, Jack H. Koolen
    Combinatorics of lopsided sets. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:5, pp:669-689 [Journal]
  26. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    Six Points Suffice: How to Check for Metric Consistency. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:4, pp:465-474 [Journal]
  27. Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Antipodal Metrics and Split Systems. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:2, pp:187-200 [Journal]
  28. Andreas W. M. Dress, Jack H. Koolen, Vincent Moulton
    On Line Arrangements in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:549-557 [Journal]
  29. Andreas W. M. Dress, Jack H. Koolen, Vincent Moulton
    Addendum to "on line arrangements in the hyperbolic plane" [European J. Combin.23 (2002) 549-557]. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:3, pp:347- [Journal]
  30. Andreas W. M. Dress, Vincent Moulton, Werner F. Terhalle
    T-theory: An Overview. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:161-175 [Journal]
  31. Jianguo Qian, Andreas W. M. Dress, Yan Wang
    On the dependence polynomial of a graph. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:1, pp:337-346 [Journal]
  32. Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel
    Algorithmic Aspects of Tree Amalgamation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:522-537 [Journal]
  33. Darko Babic, Gunnar Brinkmann, Andreas W. M. Dress
    Topological Resonance Energy of Fullerenes. [Citation Graph (0, 0)][DBLP]
    Journal of Chemical Information and Computer Sciences, 1997, v:37, n:5, pp:920-923 [Journal]
  34. Gunnar Brinkmann, Andreas W. M. Dress, Sören Perrey, Jens Stoye
    Two applications of the Divide&Conquer principle in the molecular sciences. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:71-97 [Journal]
  35. Andreas W. M. Dress, Timothy F. Havel
    Bound Smoothing under Chirality Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:4, pp:535-549 [Journal]
  36. Andreas W. M. Dress, Daniel H. Huson
    Constructing Splits Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:3, pp:109-115 [Journal]
  37. Michael Clausen, Andreas W. M. Dress, Johannes Grabmeier, Marek Karpinski
    On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:84, n:2, pp:151-164 [Journal]
  38. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:4-10 [Conf]
  39. Andreas W. M. Dress, Rudolf Scharlau
    The 37 combinatorial types of minimal, non-transitive, equivariant tilings of the Euclidean plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:121-138 [Journal]
  40. Hans-Jürgen Bandelt, Andreas W. M. Dress
    An order theoretic framework for overlapping clustering. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:21-37 [Journal]

  41. Recent Progress in Phylogenetic Combinatorics. [Citation Graph (, )][DBLP]


  42. Towards Identification of Human Disease Phenotype-Genotype Association via a Network-Module Based Method. [Citation Graph (, )][DBLP]


  43. Cut points in metric spaces. [Citation Graph (, )][DBLP]


  44. Block realizations of finite metrics and the tight-span construction I: The embedding theorem. [Citation Graph (, )][DBLP]


  45. A graph-theoretical invariant of topological spaces. [Citation Graph (, )][DBLP]


  46. A spectral clustering-based framework for detecting community structures in complex networks. [Citation Graph (, )][DBLP]


  47. Barriers in metric spaces. [Citation Graph (, )][DBLP]


  48. A Hall-type theorem for triplet set systems based on medians in trees. [Citation Graph (, )][DBLP]


  49. A note on single-linkage equivalence. [Citation Graph (, )][DBLP]


  50. An algorithm for computing cutpoints in finite metric spaces [Citation Graph (, )][DBLP]


  51. Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support. [Citation Graph (, )][DBLP]


  52. Preface. [Citation Graph (, )][DBLP]


  53. Linearly independent split systems. [Citation Graph (, )][DBLP]


  54. Compatible decompositions and block realizations of finite metrics. [Citation Graph (, )][DBLP]


Search in 0.160secs, Finished in 0.163secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002