Publications by authors named "Gabriel Riera"

Orchard and tree-child networks share an important property with phylogenetic trees: they can be completely reduced to a single node by iteratively deleting cherries and reticulated cherries. As it is the case with phylogenetic trees, the number of ways in which this can be done gives information about the topology of the network. Here, we show that the problem of computing this number in tree-child networks is akin to that of finding the number of linear extensions of the poset induced by each network, and give an algorithm based on this reduction whose complexity is bounded in terms of the level of the network.

View Article and Find Full Text PDF
Article Synopsis
  • Faith's Phylogenetic Diversity (PD) showcases a strong exchange property that facilitates moving leaves between sets without decreasing diversity, leading to an efficient greedy solution for optimizing PD on rooted trees.
  • The study introduces an exchange property specifically for rooted Phylogenetic Subnet Diversity (rPSD) on phylogenetic networks, which requires a more intricate approach to exchanging leaves.
  • Utilizing this new exchange property, the researchers develop a polynomial-time greedy solution for optimizing rPSD in rooted semibinary level-2 phylogenetic networks.
View Article and Find Full Text PDF

Motivation: Two key steps in the analysis of uncultured viruses recovered from metagenomes are the taxonomic classification of the viral sequences and the identification of putative host(s). Both steps rely mainly on the assignment of viral proteins to orthologs in cultivated viruses. Viral Protein Families (VPFs) can be used for the robust identification of new viral sequences in large metagenomics datasets.

View Article and Find Full Text PDF

Background: The alignment of protein-protein interaction networks was recently formulated as an integer quadratic programming problem, along with a linearization that can be solved by integer linear programming software tools. However, the resulting integer linear program has a huge number of variables and constraints, rendering it of no practical use.

Results: We present a compact integer linear programming reformulation of the protein-protein interaction network alignment problem, which can be solved using state-of-the-art mathematical modeling and integer linear programming software tools, along with empirical results showing that small biological networks, such as virus-host protein-protein interaction networks, can be aligned in a reasonable amount of time on a personal computer and the resulting alignments are structurally coherent and biologically meaningful.

View Article and Find Full Text PDF