Publication
Computing RF Tree Distance over Succinct Representations
| dc.contributor.author | Branco, António Pedro | |
| dc.contributor.author | Vaz, Cátia | |
| dc.contributor.author | Francisco, Alexandre P. | |
| dc.date.accessioned | 2024-11-11T10:14:43Z | |
| dc.date.available | 2024-11-11T10:14:43Z | |
| dc.date.issued | 2024-01 | |
| dc.description.abstract | There are several tools available to infer phylogenetic trees, which depict the evolutionary relationships among biological entities such as viral and bacterial strains in infectious outbreaks or cancerous cells in tumor progression trees. These tools rely on several inference methods available to produce phylogenetic trees, with resulting trees not being unique. Thus, methods for comparing phylogenies that are capable of revealing where two phylogenetic trees agree or differ are required. An approach is then proposed to compute a similarity or dissimilarity measure between trees, with the Robinson–Foulds distance being one of the most used, and which can be computed in linear time and space. Nevertheless, given the large and increasing volume of phylogenetic data, phylogenetic trees are becoming very large with hundreds of thousands of leaves. In this context, space requirements become an issue both while computing tree distances and while storing trees. We propose then an efficient implementation of the Robinson–Foulds distance over tree succinct representations. Our implementation also generalizes the Robinson–Foulds distances to labelled phylogenetic trees, i.e., trees containing labels on all nodes, instead of only on leaves. Experimental results show that we are able to still achieve linear time while requiring less space. Our implementation in C++ is available as an open-source tool. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.citation | Branco AP, Vaz C, Francisco AP. Computing RF Tree Distance over Succinct Representations. Algorithms. 2024; 17(1):15. https://doi.org/10.3390/a17010015 | pt_PT |
| dc.identifier.doi | 10.3390/a17010015 | pt_PT |
| dc.identifier.eissn | 1999-4893 | |
| dc.identifier.uri | http://hdl.handle.net/10400.21/17866 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.publisher | MDPI | pt_PT |
| dc.relation | LA/P/0078/2020 - Fundação para a Ciência e a Tecnologia (FCT) | pt_PT |
| dc.relation | Instituto de Engenharia de Sistemas e Computadores, Investigação e Desenvolvimento em Lisboa | |
| dc.relation.publisherversion | https://www.mdpi.com/1999-4893/17/1/15 | pt_PT |
| dc.subject | tree dissimilarity | pt_PT |
| dc.subject | succinct data structures | pt_PT |
| dc.subject | phylogenetic trees | pt_PT |
| dc.subject | Robinson–Foulds distance | pt_PT |
| dc.title | Computing RF Tree Distance over Succinct Representations | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.awardTitle | Instituto de Engenharia de Sistemas e Computadores, Investigação e Desenvolvimento em Lisboa | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F50021%2F2020/PT | |
| oaire.citation.endPage | 21 | pt_PT |
| oaire.citation.issue | 1 | pt_PT |
| oaire.citation.startPage | 1 | pt_PT |
| oaire.citation.title | Algorithms | pt_PT |
| oaire.citation.volume | 17 | pt_PT |
| oaire.fundingStream | 6817 - DCRRNI ID | |
| person.familyName | Vaz | |
| person.givenName | Cátia | |
| person.identifier.ciencia-id | 8718-741E-BBD9 | |
| person.identifier.orcid | 0000-0001-6074-3074 | |
| person.identifier.rid | ADC-1473-2022 | |
| person.identifier.scopus-author-id | 27267941600 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | article | pt_PT |
| relation.isAuthorOfPublication | 0c5cb0fd-7cd7-4a16-86a8-7a68188e53ff | |
| relation.isAuthorOfPublication.latestForDiscovery | 0c5cb0fd-7cd7-4a16-86a8-7a68188e53ff | |
| relation.isProjectOfPublication | 1f3e7ad3-87bb-4203-919b-53592c18fcea | |
| relation.isProjectOfPublication.latestForDiscovery | 1f3e7ad3-87bb-4203-919b-53592c18fcea |