What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algebra
- Discrete mathematics
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Algorithm, Phylogenetic tree and Multiple sequence alignment.
His Discrete mathematics research is multidisciplinary, incorporating perspectives in Equivariant map and Metric.
Many of his research projects under Combinatorics are closely connected to Irreducible polynomial and Minimal polynomial with Irreducible polynomial and Minimal polynomial, tying the diverse disciplines of science together.
His work deals with themes such as Biological evolution, Sequence analysis, Bioinformatics and Character, which intersect with Algorithm.
Andreas W. M. Dress combines subjects such as Basis and Amino acid residue with his study of Phylogenetic tree.
His Multiple sequence alignment research incorporates elements of Sequence, Data set and Identification.
His most cited work include:
- Split decomposition: a new and useful approach to phylogenetic analysis of distance data. (434 citations)
- Self-assembly in aqueous solution of wheel-shaped Mo154 oxide clusters into vesicles. (363 citations)
- Inorganic Chemistry Goes Protein Size: A Mo368 Nano-Hedgehog Initiating Nanochemistry by Symmetry Breaking (353 citations)
What are the main themes of his work throughout his whole career to date?
Andreas W. M. Dress mostly deals with Combinatorics, Discrete mathematics, Algorithm, Finite set and Algebra.
His Combinatorics study incorporates themes from Characterization, Metric space, Metric and Phylogenetic tree.
His Phylogenetic tree study focuses on Phylogenetic network in particular.
His biological study focuses on Tight span.
His research is interdisciplinary, bridging the disciplines of Multiple sequence alignment and Algorithm.
To a larger extent, Andreas W. M. Dress studies Sequence alignment with the aim of understanding Multiple sequence alignment.
He most often published in these fields:
- Combinatorics (47.47%)
- Discrete mathematics (33.33%)
- Algorithm (11.11%)
What were the highlights of his more recent work (between 2005-2019)?
- Combinatorics (47.47%)
- Discrete mathematics (33.33%)
- Finite set (10.77%)
In recent papers he was focusing on the following fields of study:
Andreas W. M. Dress spends much of his time researching Combinatorics, Discrete mathematics, Finite set, Phylogenetic tree and Algorithm.
His research integrates issues of Algebraic number and Metric in his study of Combinatorics.
His research on Discrete mathematics focuses in particular on Disjoint union.
His Phylogenetic tree research includes themes of Phylogenetics and Theoretical computer science.
His study ties his expertise on Sequence together with the subject of Algorithm.
His research investigates the connection with Tree and areas like Multiple sequence alignment which intersect with concerns in Data set.
Between 2005 and 2019, his most popular works were:
- Analyzing proteome topology and function by automated multidimensional fluorescence microscopy (333 citations)
- Basic Phylogenetic Combinatorics (105 citations)
- Noisy: identification of problematic columns in multiple sequence alignments. (103 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Discrete mathematics
His primary areas of investigation include Discrete mathematics, Combinatorics, Algorithm, Data set and Phylogenetic tree.
His studies in Discrete mathematics integrate themes in fields like Enhanced Data Rates for GSM Evolution, Metric and Finite set.
Andreas W. M. Dress specializes in Combinatorics, namely Tree.
His study in the field of Tree and Computation is also linked to topics like Traverse and Ray.
His Data set research is multidisciplinary, relying on both Hierarchical clustering, Phylogenetic network, Genetic model and Split networks.
His research in Phylogenetic tree intersects with topics in Basis and Structure.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
