| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Making de Bruijn Graphs Eulerian | Bernardini, Giulia et al. | 2022 |
| 2 | On Strings Having the Same Length- k Substrings | Bernardini, Giulia et al. | 2022 |
| 3 | Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning | Bernardini, Giulia et al. | 2022 |
| 4 | Constructing Strings Avoiding Forbidden Substrings | Bernardini, Giulia et al. | 2021 |
| 5 | On Two Measures of Distance Between Fully-Labelled Trees | Bernardini, Giulia et al. | 2020 |
| 6 | String Sanitization Under Edit Distance | Bernardini, Giulia et al. | 2020 |
| 7 | A Rearrangement Distance for Fully-Labelled Trees | Bernardini, Giulia et al. | 2019 |
| 8 | Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication | Bernardini, Giulia et al. | 2019 |
| 9 | Degenerate String Comparison and Applications | Alzamel, Mai et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |