| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Approximation Algorithms for the Longest Run Subsequence Problem | Asahiro, Yuichi et al. | 2023 |
| 2 | MUL-Tree Pruning for Consistency and Compatibility | Hampson, Christopher et al. | 2023 |
| 3 | Efficient Assignment of Identities in Anonymous Populations | Gąsieniec, Leszek et al. | 2022 |
| 4 | Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants | Asahiro, Yuichi et al. | 2022 |
| 5 | Building a Small and Informative Phylogenetic Supertree | Jansson, Jesper et al. | 2019 |
| 6 | New and Improved Algorithms for Unordered Tree Inclusion | Akutsu, Tatsuya et al. | 2018 |
| 7 | Minimal Phylogenetic Supertrees and Local Consensus Trees | Jansson, Jesper et al. | 2016 |
| 8 | On Finding the Adams Consensus Tree | Jansson, Jesper et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |