Motivation Several protein-protein interaction networks (PPIN) aligners have been developed during the last 15 years. One of their goals is to help the functional annotation of proteins and the prediction of protein-protein interactions. A correct aligner must preserve the network’s topology as well as the biological coherence. However, this is a trade-off that is hard to achieve. In addition, most aligners require a considerable effort to use in practice and many researchers must choose an aligner without the opportunity to previously compare the performance of different aligners. Results We developed PINAWeb, a user-friendly web-based tool to obtain and compare the results produced by the aligners: AligNet, HubAlign, L-GRAAL, PINALOG and SPINAL. PPINs can be uploaded either from the STRING database or from a user database. The source code of PINAWeb is freely available on GitHub to enable researchers to add other aligners, network databases or alignment score metrics. In addition, PINAWeb provides a report with the analysis for every alignment in terms of topological and functional information scores, as well as the visualization of the alignments’ comparison (agreement/differences) when more than one aligner are considered. Availability https://bioinfo.uib.es/~recerca/PINAWeb
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 largest set to the smallest 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 of bounded level and reticulations’ in-degree, which involves a more complicated interchange of leaves. We derive from it a polynomial-time greedy solution to the rPSD optimization problem on rooted semibinary level-2 phylogenetic networks.
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.
The Fair Proportion of a species in a phylogenetic tree is a very simple measure that has been used to assess its value relative to the overall phylogenetic diversity represented by the tree. It has recently been proved by Fuchs and Jin to be equal to the Shapley Value of the coallitional game that sends each subset of species to its rooted Phylogenetic Diversity in the tree. We prove in this paper that this result extends to the natural translations of the Fair Proportion and the rooted Phylogenetic Diversity to rooted phylogenetic networks. We also generalize to rooted phylogenetic networks the expression for the Shapley Value of the unrooted Phylogenetic Diversity game on a phylogenetic tree established by Haake, Kashiwada and Su.
9 November 2024 in Bulletin of Mathematical Biology
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.