Cargando…
A duality based 2-approximation algorithm for maximum agreement forest
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades, since it can be used to compute the rooted Subtree Prune-and-Regraft (rSPR) distance between two phylogenetic trees. Our...
Autores principales: | Olver, Neil, Schalekamp, Frans, van der Ster, Suzanne, Stougie, Leen, van Zuylen, Anke |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9945189/ https://www.ncbi.nlm.nih.gov/pubmed/36845754 http://dx.doi.org/10.1007/s10107-022-01790-y |
Ejemplares similares
-
New algorithms for maximum disjoint paths based on tree-likeness
por: Fleszar, Krzysztof, et al.
Publicado: (2017) -
Duality for nonconvex approximation and optimization
por: Singer, Ivan
Publicado: (2006) -
Universal series induced by approximate identities and some relevant applications
por: Nestoridis, Vassili, et al.
Publicado: (2011) -
A technique for obtaining true approximations for k-center with covering constraints
por: Anegg, Georg, et al.
Publicado: (2021) -
Packaging, Purification, and Titration of Replication-Deficient Semliki Forest Virus-Derived Particles as a Self-Amplifying mRNA Vaccine Vector
por: Savar, Nastaran Sadat, et al.
Publicado: (2022)