Vincent L. Moulton

From MaRDI portal
Person:1295607

Available identifiers

zbMath Open moulton.vincent-lMaRDI QIDQ1295607

List of research outcomes

PublicationDate of PublicationType
The space of equidistant phylogenetic cactuses2024-03-11Paper
A distance-based model for convergent evolution2024-01-24Paper
Diversities and the generalized circumradius2023-12-21Paper
Computing consensus networks for collections of 1-nested phylogenetic networks2023-09-20Paper
Injective split systems2023-07-12Paper
Polynomial invariants for cactuses2023-06-05Paper
Planar median graphs and cubesquare-graphs2023-03-29Paper
Encoding and ordering \(X\)-cactuses2022-09-30Paper
Forest-based networks2022-09-28Paper
An algorithm for reconstructing level-2 phylogenetic networks from trinets2022-09-02Paper
Order distances and split systems2022-08-02Paper
Posets and Spaces of $k$-Noncrossing RNA Structures2022-07-13Paper
Planar Rooted Phylogenetic Networks2022-03-18Paper
Compatible split systems on a multiset2022-03-09Paper
Overlaid species forests2022-01-13Paper
Planar Median Graphs and Cubesquare-Graphs2021-10-18Paper
Optimal realizations and the block decomposition of a finite metric space2021-08-02Paper
The rigid hybrid number for two phylogenetic trees2021-04-08Paper
Optimizing phylogenetic diversity under constraints2020-11-05Paper
Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances2020-09-01Paper
Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks2020-03-06Paper
Three-way symbolic tree-maps and ultrametrics2020-03-06Paper
Recognizing and realizing cactus metrics2020-02-18Paper
Order distances and split systems2019-10-22Paper
Reconciling event-labeled gene trees with MUL-trees and species networks2019-10-22Paper
Computing a consensus of multilabeled trees2019-09-12Paper
Correction to: ``Tree-based unrooted phylogenetic networks2019-05-09Paper
Phylogenetic flexibility via Hall-type inequalities and submodularity2019-03-26Paper
Recovering normal networks from shortest inter-taxa distance information2019-03-01Paper
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics2019-01-25Paper
The polytopal structure of the tight-span of a totally split-decomposable metric2019-01-22Paper
Searching for realizations of finite metric spaces in tight spans2018-10-18Paper
Quarnet inference rules for level-1 networks2018-09-25Paper
Leaf-Reconstructibility of Phylogenetic Networks2018-08-10Paper
Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution2018-06-15Paper
Combinatorial properties of triplet covers for binary trees2018-06-08Paper
Geometric medians in reconciliation spaces of phylogenetic trees2018-05-25Paper
Tree-based unrooted phylogenetic networks2018-04-12Paper
Bounds for phylogenetic network space metrics2018-04-10Paper
UPGMA and the normalized equidistant minimum evolution problem2018-03-12Paper
Characterizing Block Graphs in Terms of their Vertex-Induced Partitions2017-11-17Paper
Minimum triplet covers of binary phylogenetic \(X\)-trees2017-11-08Paper
Binets: fundamental building blocks for phylogenetic networks2017-06-27Paper
A cubic-time algorithm for computing the trinet distance between level-1 networks2017-04-20Paper
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets2017-03-06Paper
Folding and unfolding phylogenetic trees and networks2016-11-04Paper
Transforming phylogenetic networks: moving beyond tree space2016-09-05Paper
Reduction rules for the maximum parsimony distance on phylogenetic trees2016-08-31Paper
An algorithm for computing cutpoints in finite metric spaces2016-04-04Paper
Recognizing treelike \(k\)-dissimilarities2016-04-04Paper
Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations2016-02-18Paper
Neighborhoods of trees in circular orderings2015-07-01Paper
Fishing for minimum evolution trees with neighbor-nets2015-06-25Paper
A parsimony-based metric for phylogenetic trees2015-06-10Paper
Optimal realizations of two-dimensional, totally-decomposable metrics2015-04-29Paper
Representing Partitions on Trees2014-12-22Paper
Computing the blocks of a quasi-median graph2014-12-03Paper
There are only finitely many distance-regular graphs of fixed valency greater than two2014-11-26Paper
Optimal algorithms for computing edge weights in planar split networks2014-08-05Paper
The size of 3-compatible, weakly compatible split systems2014-08-05Paper
Trinets encode tree-child and level-2 phylogenetic networks2014-07-03Paper
Obtaining splits from cut sets of tight spans2014-04-16Paper
Encoding and constructing 1-nested phylogenetic networks with trinets2013-06-25Paper
Orthology relations, symbolic ultrametrics, and cographs2013-02-01Paper
The `Butterfly effect' in Cayley graphs with applications to genomics.2012-12-13Paper
Generating functions for multi-labeled trees2012-11-22Paper
Trees, tight-spans and point configurations2012-08-10Paper
The split decomposition of a \(k\)-dissimilarity map2012-07-04Paper
Injective optimal realizations of finite metric spaces2012-05-30Paper
Blocks and Cut Vertices of the Buneman Graph2012-03-15Paper
On Patchworks and Hierarchies2012-02-11Paper
A `non-additive' characterization of \(\wp\)-adic norms.2012-01-24Paper
Basic Phylogenetic Combinatorics2010-05-12Paper
Block realizations of finite metrics and the tight-span construction. I: The embedding theorem2010-02-12Paper
There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency2009-11-16Paper
Barriers in metric spaces2009-11-06Paper
Phylogenetic diversity and the maximum coverage problem2009-10-14Paper
A graph-theoretical invariant of topological spaces2009-06-29Paper
Consistency of the QNet algorithm for generating planar split networks from weighted quartets2009-06-24Paper
Optimal realizations of generic five-point metrics2009-06-17Paper
Characterizing weak compatibility in terms of weighted quartets2009-04-14Paper
Characterizing cell-decomposable metrics2009-04-07Paper
An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces2009-03-03Paper
Compatible decompositions and block realizations of finite metrics2008-09-04Paper
Encoding phylogenetic trees in terms of weighted quartets2008-08-18Paper
A regular decomposition of the edge-product space of phylogenetic trees2008-06-26Paper
Cut points in metric spaces2008-05-21Paper
Concerning the relationship between realizations and tight spans of finite metrics2008-01-04Paper
Estimating parameters for generalized mass action models using constraint propagation2007-10-09Paper
Two theorems concerning the Bannai-Ito conjecture2007-08-27Paper
Some uses of the Farris transform in mathematics and phylogenetics -- A review2007-05-21Paper
Parameter reconstruction for biochemical networks using interval analysis2006-09-14Paper
Phylogenetic networks from multi-labelled trees2006-08-23Paper
Hereditarily optimal realizations of consistent metrics2006-06-28Paper
https://portal.mardi4nfdi.de/entity/Q54716242006-06-14Paper
On the structure of the tight-span of a totally split-decomposable metric2006-04-06Paper
The tight span of an antipodal metric space. I: combinatorial properties2005-12-29Paper
Four Characters Suffice to Convexly Define a Phylogenetic Tree2005-09-16Paper
Bounding the number of hybridisation events for a consistent evolutionary history2005-09-13Paper
Recovering a phylogenetic tree using pairwise closure operations2005-08-01Paper
\(4n-10\)2005-02-25Paper
Peeling phylogenetic `oranges'2005-01-26Paper
The tight span of an antipodal metric space. II: Geometrical properties2004-12-13Paper
Replacing cliques by stars in quasi-median graphs2004-11-23Paper
There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 102004-08-06Paper
Connectivity calculus2004-06-11Paper
The structure of spherical graphs.2004-03-14Paper
A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph2003-11-16Paper
Antipodal metrics and split systems2003-09-05Paper
Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization2003-08-14Paper
Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem2003-08-14Paper
Maximal energy bipartite graphs2003-07-08Paper
https://portal.mardi4nfdi.de/entity/Q44101512003-07-02Paper
On line arrangements in the hyperbolic plane2003-03-18Paper
Hyperbolic bridged graphs2003-03-18Paper
On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 72003-03-18Paper
An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex2002-09-12Paper
Vector braids2002-09-09Paper
Quasi-median graphs from sets of partitions2002-08-29Paper
A classification of the six-point prime metrics2002-07-22Paper
The relation graph2002-05-21Paper
On the hyperbolicity of chordal graphs2002-05-20Paper
Totally split-decomposable metrics of combinatorial dimension two2002-03-04Paper
Six points suffice: How to check for metric consistency2002-02-17Paper
\(2kn-\binom{2k+1}{2}\). A note on extremal combinatorics of cyclic split systems2001-12-11Paper
Metric spaces in pure and applied mathematics2001-12-10Paper
Maximal energy graphs2001-09-20Paper
https://portal.mardi4nfdi.de/entity/Q27247412001-08-16Paper
The coherency index2000-11-02Paper
An exceptional split geometry2000-09-25Paper
On the tight span of an antipodal graph2000-09-15Paper
Affine maps that induce polyhedral complex isomorphisms2000-08-24Paper
A polynomial time algorithm for constructing the refined Buneman tree2000-02-16Paper
A comparison between two distinct continuous models in projective cluster theory: The median and the tight-span construction1999-12-20Paper
Some variations on a theme by Buneman1999-12-13Paper
HOPF-BRAID GROUPS1999-11-21Paper
On the number of vertices and edges of the Buneman graph1999-10-05Paper
https://portal.mardi4nfdi.de/entity/Q43757361999-09-13Paper
A note on the uniqueness of coherent decompositions1999-07-05Paper
Retractions of finite distance functions onto tree metrics1999-06-06Paper
Analyzing and visualizing sequence and distance data using SPLITSTREE1998-01-18Paper
Trees, taxonomy, and strongly compatible multi-state characters1997-08-25Paper
\(T\)-theory: An overview1997-01-09Paper
T-theory1997-01-09Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vincent L. Moulton