Tomás Martínez Coronado

Tomás Martínez Coronado

Auto-generated profile, based on publicly available information

Tomás Martínez Coronado

Department of Mathematics and Computer Science, University of the Balearic Islands, Palma, Spain

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 June 2019 in Journal of Mathematical Biology
Verified
Journal Article
Closed access
PDF file
TCTomás M. Coronado
Tomás M. Coronado
Arnau Mir TorresArnau Mir Torres
Arnau Mir Torres
FRFrancesc Rosselló
Francesc Rosselló
Gabriel ValienteGabriel Valiente
Gabriel Valiente

1 January 2021 in Mathematical Biosciences
Verified
Journal Article
Closed access
KBKrzysztof Bartoszek
Krzysztof Bartoszek
TCTomás M. Coronado
Tomás M. Coronado
AMArnau Mir
Arnau Mir
FRFrancesc Rosselló
Francesc Rosselló

1 February 2024 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
GCGabriel Cardona
Gabriel Cardona
JPJoan Carles Pons
Joan Carles Pons
GRGerard Ribas
Gerard Ribas
TCTomás Martínez Coronado
Tomás Martínez Coronado
Phylogenetic networks generalize phylogenetic trees in order to model reticulation events. Although the comparison of phylogenetic trees is well studied, and there are multiple ways to do it in an efficient way, the situation is much different for phylogenetic networks. Some classes of phylogenetic networks, mainly tree-child networks, are known to be classified efficiently by their μ-representation, which essentially counts, for every node, the number of paths to each leaf. In this paper, we introduce the extended μ-representation of networks, where the number of paths to reticulations is also taken into account. This modification allows us to distinguish orchard networks and to define a metric on the space of such networks that can, moreover, be computed efficiently. The class of orchard networks, as well as being one of the classes with biological significance (one such network can be interpreted as a tree with extra arcs involving coexisting organisms), is one of the most generic ones (in mathematical terms) for which such a representation can (conjecturally) exist, since a slight relaxation of the definition leads to a problem that is Graph Isomorphism Complete.

18 April 2018 in The Scientific World Journal
Verified
Journal Article
Open access
PDF file
TCTomás M. Coronado
Tomás M. Coronado
Arnau Mir TorresArnau Mir Torres
Arnau Mir Torres
FRFrancesc Rosselló
Francesc Rosselló
Ford’s α-model is one of the most popular random parametric models of bifurcating phylogenetic tree growth, having as specific instances both the uniform and the Yule models. Its general properties have been used to study the behavior of phylogenetic tree shape indices under the probability distribution it defines. But the explicit formulas provided by Ford for the probabilities of unlabeled trees and phylogenetic trees fail in some cases. In this paper we give correct explicit formulas for these probabilities.

5 March 2018 in bioRxiv
Verified
Preprint
Open access
PDF file
TCTomás M. Coronado
Tomás M. Coronado
Arnau Mir TorresArnau Mir Torres
Arnau Mir Torres
FRFrancesc Rosselló
Francesc Rosselló
Gabriel ValienteGabriel Valiente
Gabriel Valiente
We define a new balance index for phylogenetic trees based on the symmetry of the evolutive history of every quartet of leaves. This index makes sense for polytomic trees and it can be computed in time linear in the number of leaves. We compute its maximum and minimum values for arbitrary and bifurcating trees, and we provide exact formulas for its expected value and variance for bifurcating trees under Ford’s α -model and Aldous’ β-model and for arbitrary trees under the α-γ-model.

4 October 2024 in Journal of Mathematical Biology
Verified
Journal Article
Open access
PDF file
TCTomás M. Coronado
Tomás M. Coronado
GRGabriel Riera
Gabriel Riera
FRFrancesc Rosselló
Francesc Rosselló
Faith’s Phylogenetic Diversity (PD) on rooted phylogenetic trees satisfies the so-called strong exchange property that guarantees that, for every two sets of leaves of different cardinalities, a leaf can always be moved from the larger set to the smaller set in such a way that the sum of the PD values does not decrease. This strong exchange property entails a simple polynomial-time greedy solution to the PD optimization problem on rooted phylogenetic trees. In this paper we obtain an exchange property for the rooted Phylogenetic Subnet Diversity (rPSD) on rooted phylogenetic networks, which involves a more complicated exchange of leaves. We derive from it a polynomial-time greedy solution to the rPSD optimization problem on rooted semibinary level-2 phylogenetic networks.