Marta Casanellas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Marta Casanellas has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Jesús Fernández-Sánchez
Centre de Recerca Matemàtica. ETSEIB Universitat Politècnica de Catalunya Av. Diagonal 647 08028 Barcelona
12 shared publications Jesús Fernández-Sánchez
Institut de Matematiques de la UPC-BarcelonaTech (IMTech), Universitat Politècnica de Catalunya and Centre de Recerca Matemàtica, Barcelona, Spain
6 shared publicationsRobin Hartshorne
Department of Mathematics, University of California, Berkeley, CA, 94720-3840, USA
4 shared publications- Rosa Maria Miró Roig
Facultat de Matemàtiques i Informàtica, Universitat de Barcelona, Barcelona, Spain
4 shared publications - Anna Kedzierska
Centre for Genomic Regulation (CRG), Dr. Aiguader 88, Barcelona, 08003, Spain
3 shared publications - Mateusz Michałek
University of Konstanz
3 shared publications
Latest Publications
- 3 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 9 (4) , 765-793
Phylogenetic Invariants: From the General Markov to Equivariant Models
In the last decade, some algebraic tools have been successfully applied to phylogenetic reconstruction. These tools are mainly based on the knowledge of equations describing algebraic varieties associated to Markov processes of molecular substitution on phylogenetic trees, the so called phylogenetic invariants. Although the theory involved allows for the explicit determination of these equations for all equivariant models (which include some of the most popular nucleotide substitution models), practical uses of these algebraic tools have been restricted to the case of the general Markov model. Arguably, one of the reasons for this restriction is that knowledge of linear representation theory is required before making these equations explicit. With the aim of enlarging the practical uses of algebraic phylogenetics, in this paper we prove that phylogenetic invariants for equivariant models can be derived from phylogenetic invariants for the general Markov model without the need of representation theory. Our main result states that the algebraic variety corresponding to an equivariant model on a phylogenetic tree [Formula: see text] is an irreducible component of the variety corresponding to the general Markov model on [Formula: see text] intersected with the linear space defined by the model. We also prove that for any equivariant model, those phylogenetic invariants that are relevant for practical uses (e.g., tree reconstruction) can be simply deduced from a single rank constraint on the matrices obtained by flattening the joint distribution at the leaves of the tree. This condition can be easily tested from singular values of the matrices, and it allows us to extend our results from trees to phylogenetic networks.
- 3 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 9 (4) , 765-793
Phylogenetic Invariants: From the General Markov to Equivariant Models
In the last decade, some algebraic tools have been successfully applied to phylogenetic reconstruction. These tools are mainly based on the knowledge of equations describing algebraic varieties associated to Markov processes of molecular substitution on phylogenetic trees, the so called phylogenetic invariants. Although the theory involved allows for the explicit determination of these equations for all equivariant models (which include some of the most popular nucleotide substitution models), practical uses of these algebraic tools have been restricted to the case of the general Markov model. Arguably, one of the reasons for this restriction is that knowledge of linear representation theory is required before making these equations explicit. With the aim of enlarging the practical uses of algebraic phylogenetics, in this paper we prove that phylogenetic invariants for equivariant models can be derived from phylogenetic invariants for the general Markov model without the need of representation theory. Our main result states that the algebraic variety corresponding to an equivariant model on a phylogenetic tree [Formula: see text] is an irreducible component of the variety corresponding to the general Markov model on [Formula: see text] intersected with the linear space defined by the model. We also prove that for any equivariant model, those phylogenetic invariants that are relevant for practical uses (e.g., tree reconstruction) can be simply deduced from a single rank constraint on the matrices obtained by flattening the joint distribution at the leaves of the tree. This condition can be easily tested from singular values of the matrices, and it allows us to extend our results from trees to phylogenetic networks.
- 1 June 2025
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 32 (6) , 626-630
Generating Heterogeneous Data on Gene Trees
We introduce GenPhylo, a Python module that simulates nucleotide sequence data along a phylogeny avoiding the restriction of continuous-time Markov processes. GenPhylo uses directly a general Markov model and therefore naturally incorporates heterogeneity across lineages. We solve the challenge of generating transition matrices with a pre-given expected number of substitutions (the branch length information) by providing an algorithm that can be incorporated in other simulation software.
- 1 June 2025
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 32 (6) , 626-630
Generating Heterogeneous Data on Gene Trees
We introduce GenPhylo, a Python module that simulates nucleotide sequence data along a phylogeny avoiding the restriction of continuous-time Markov processes. GenPhylo uses directly a general Markov model and therefore naturally incorporates heterogeneity across lineages. We solve the challenge of generating transition matrices with a pre-given expected number of substitutions (the branch length information) by providing an algorithm that can be incorporated in other simulation software.
- 26 August 2024
- Published by Springer Nature
- p. 26-44
Phylogenetic Reconstruction Based on Algebra
- 22 August 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 84 (4) , 1845-1867
A Novel Algebraic Approach to Time-Reversible Evolutionary Models
In recent years, algebraic tools have been proven useful in phylogenetic reconstruction and model selection through the study of phylogenetic invariants. However, up to now, the models studied from an algebraic viewpoint are either too general or too restrictive (as group-based models with a uniform stationary distribution) to be used in practice. In this paper we provide a new framework to study time-reversible models, which are the most widely used by biologists. In our approach we consider algebraic time-reversible models on phylogenetic trees (as defined by Allman and Rhodes) and introduce a new inner product to make all transition matrices of the process diagonalizable through the same orthogonal eigenbasis. This framework generalizes the Fourier transform widely used to work with group-based models and recovers some of the well-known results. As illustration, we combine our technique with algebraic geometry tools to provide relevant phylogenetic invariants for trees evolving under the Tamura–Nei model of nucleotide substitution.
- 22 August 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 84 (4) , 1845-1867
A Novel Algebraic Approach to Time-Reversible Evolutionary Models
In recent years, algebraic tools have been proven useful in phylogenetic reconstruction and model selection through the study of phylogenetic invariants. However, up to now, the models studied from an algebraic viewpoint are either too general or too restrictive (as group-based models with a uniform stationary distribution) to be used in practice. In this paper we provide a new framework to study time-reversible models, which are the most widely used by biologists. In our approach we consider algebraic time-reversible models on phylogenetic trees (as defined by Allman and Rhodes) and introduce a new inner product to make all transition matrices of the process diagonalizable through the same orthogonal eigenbasis. This framework generalizes the Fourier transform widely used to work with group-based models and recovers some of the well-known results. As illustration, we combine our technique with algebraic geometry tools to provide relevant phylogenetic invariants for trees evolving under the Tamura–Nei model of nucleotide substitution.
- Open Access
- 13 June 2023
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 85 (7) , 1-50
Designing Weights for Quartet-Based Methods When Data are Heterogeneous Across Lineages
Homogeneity across lineages is a general assumption in phylogenetics according to which nucleotide substitution rates are common to all lineages. Many phylogenetic methods relax this hypothesis but keep a simple enough model to make the process of sequence evolution more tractable. On the other hand, dealing successfully with the general case (heterogeneity of rates across lineages) is one of the key features of phylogenetic reconstruction methods based on algebraic tools. The goal of this paper is twofold. First, we present a new weighting system for quartets () based on algebraic and semi-algebraic tools, thus especially indicated to deal with data evolving under heterogeneous rates. This method combines the weights of two previous methods by means of a test based on the positivity of the branch lengths estimated with the paralinear distance. is statistically consistent when applied to data generated under the general Markov model, considers rate and base composition heterogeneity among lineages and does not assume stationarity nor time-reversibility. Second, we test and compare the performance of several quartet-based methods for phylogenetic tree reconstruction (namely QFM, wQFM, quartet puzzling, weight optimization and Willson’s method) in combination with several systems of weights, including weights and other weights based on algebraic and semi-algebraic methods or on the paralinear distance. These tests are applied to both simulated and real data and support weight optimization with weights as a reliable and successful reconstruction method that improves upon the accuracy of global methods (such as neighbor-joining or maximum likelihood) in the presence of long branches or on mixtures of distributions on trees.
- 13 June 2023
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 85 (7) , 1-50
Open AccessDesigning Weights for Quartet-Based Methods When Data are Heterogeneous Across Lineages
Homogeneity across lineages is a general assumption in phylogenetics according to which nucleotide substitution rates are common to all lineages. Many phylogenetic methods relax this hypothesis but keep a simple enough model to make the process of sequence evolution more tractable. On the other hand, dealing successfully with the general case (heterogeneity of rates across lineages) is one of the key features of phylogenetic reconstruction methods based on algebraic tools. The goal of this paper is twofold. First, we present a new weighting system for quartets () based on algebraic and semi-algebraic tools, thus especially indicated to deal with data evolving under heterogeneous rates. This method combines the weights of two previous methods by means of a test based on the positivity of the branch lengths estimated with the paralinear distance. is statistically consistent when applied to data generated under the general Markov model, considers rate and base composition heterogeneity among lineages and does not assume stationarity nor time-reversibility. Second, we test and compare the performance of several quartet-based methods for phylogenetic tree reconstruction (namely QFM, wQFM, quartet puzzling, weight optimization and Willson’s method) in combination with several systems of weights, including weights and other weights based on algebraic and semi-algebraic methods or on the paralinear distance. These tests are applied to both simulated and real data and support weight optimization with weights as a reliable and successful reconstruction method that improves upon the accuracy of global methods (such as neighbor-joining or maximum likelihood) in the presence of long branches or on mixtures of distributions on trees.
- 1 January 2023
- Published by Universitat Autonoma de Barcelona in Publicacions Matemàtiques
- Vol. 67 (1) , 411-445
The embedding problem for Markov matrices
- 1 January 2023
- Published by Universitat Autonoma de Barcelona in Publicacions Matemàtiques
- Vol. 67 (1) , 411-445
The embedding problem for Markov matrices
- 2 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 18 (6) , 2855-2861
SAQ: Semi-Algebraic Quartet Reconstruction
We present the phylogenetic quartet reconstruction method SAQ (Semi-Algebraic Quartet reconstruction). SAQ is consistent with the most general Markov model of nucleotide substitution and, in particular, it allows for rate heterogeneity across lineages. Based on the algebraic and semi-algebraic description of distributions that arise from the general Markov model on a quartet, the method outputs normalized weights for the three trivalent quartets (which can be used as input of quartet-based methods). We show that SAQ is a highly competitive method that outperforms most of the well known reconstruction methods on data simulated under the general Markov model on 4-taxon trees. Moreover, it also achieves a high performance on data that violates the underlying assumptions.
- 2 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 18 (6) , 2855-2861
SAQ: Semi-Algebraic Quartet Reconstruction
We present the phylogenetic quartet reconstruction method SAQ (Semi-Algebraic Quartet reconstruction). SAQ is consistent with the most general Markov model of nucleotide substitution and, in particular, it allows for rate heterogeneity across lineages. Based on the algebraic and semi-algebraic description of distributions that arise from the general Markov model on a quartet, the method outputs normalized weights for the three trivalent quartets (which can be used as input of quartet-based methods). We show that SAQ is a highly competitive method that outperforms most of the well known reconstruction methods on data simulated under the general Markov model on 4-taxon trees. Moreover, it also achieves a high performance on data that violates the underlying assumptions.
- Open Access
Rank conditions on phylogenetic networks
Less rigid than phylogenetic trees, phylogenetic networks allow the description of a wider range of evolutionary events. In this note, we explain how to extend the rank invariants from phylogenetic trees to phylogenetic networks evolving under the general Markov model and the equivariant models.
Open AccessRank conditions on phylogenetic networks
Less rigid than phylogenetic trees, phylogenetic networks allow the description of a wider range of evolutionary events. In this note, we explain how to extend the rank invariants from phylogenetic trees to phylogenetic networks evolving under the general Markov model and the equivariant models.
- 9 March 2020
- Published by Annual Reviews in Annual Review of Statistics and Its Application
- Vol. 7 (1) , 227-250
Algebraic Statistics in Practice: Applications to Networks
Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra, and computational algebra), geometry, and combinatorics to provide insight into knotty problems in mathematical statistics. In this review, we illustrate this on three problems related to networks: network models for relational data, causal structure discovery, and phylogenetics. For each problem, we give an overview of recent results in algebraic statistics, with emphasis on the statistical achievements made possible by these tools and their practical relevance for applications to other scientific disciplines.
- 9 March 2020
- Published by Annual Reviews in Annual Review of Statistics and Its Application
- Vol. 7 (1) , 227-250
Algebraic Statistics in Practice: Applications to Networks
Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra, and computational algebra), geometry, and combinatorics to provide insight into knotty problems in mathematical statistics. In this review, we illustrate this on three problems related to networks: network models for relational data, causal structure discovery, and phylogenetics. For each problem, we give an overview of recent results in algebraic statistics, with emphasis on the statistical achievements made possible by these tools and their practical relevance for applications to other scientific disciplines.