| Reconstructing embedded graphs from persistence diagrams RL Belton, BT Fasy, R Mertz, S Micka, DL Millman, D Salinas, ... Computational Geometry 90, 101658, 2020 | 25 | 2020 |
| Flow decomposition with subpath constraints L Williams, AI Tomescu, B Mumey IEEE/ACM Transactions on Computational Biology and Bioinformatics 20 (1 …, 2022 | 24 | 2022 |
| Learning simplicial complexes from persistence diagrams RL Belton, BT Fasy, R Mertz, S Micka, DL Millman, D Salinas, ... arXiv preprint arXiv:1805.10716, 2018 | 24 | 2018 |
| RNA transcript assembly using inexact flows L Williams, G Reynolds, B Mumey 2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM …, 2019 | 18 | 2019 |
| Safety and completeness in flow decompositions for RNA assembly S Khan, M Kortelainen, M Cáceres, L Williams, AI Tomescu International Conference on Research in Computational Molecular Biology, 177-192, 2022 | 17 | 2022 |
| Challenges in reconstructing shapes from Euler characteristic curves BT Fasy, S Micka, DL Millman, A Schenfisch, L Williams arXiv preprint arXiv:1811.11337, 2018 | 17 | 2018 |
| Fast, flexible, and exact minimum flow decompositions via ILP FHC Dias, L Williams, B Mumey, AI Tomescu International Conference on Research in Computational Molecular Biology, 230-245, 2022 | 12 | 2022 |
| Width Helps and Hinders Splitting Flows M Cáceres, M Cairo, A Grigorjew, S Khan, B Mumey, R Rizzi, AI Tomescu, ... ACM Transactions on Algorithms 20 (2), 2024 | 10 | 2024 |
| Persistence diagrams for efficient simplicial complex reconstruction BT Fasy, S Micka, DL Millman, A Schenfisch, L Williams arXiv preprint arXiv:1912.12759 1 (5), 13, 2019 | 10 | 2019 |
| Improving RNA assembly via safety and completeness in flow decompositions S Khan, M Kortelainen, M Cáceres, L Williams, AI Tomescu Journal of Computational Biology 29 (12), 1270-1287, 2022 | 7 | 2022 |
| Minimum flow decomposition in graphs with cycles using integer linear programming FHC Dias, L Williams, B Mumey, AI Tomescu arXiv preprint arXiv:2209.00042, 2022 | 7 | 2022 |
| Maximal perfect haplotype blocks with wildcards L Williams, B Mumey Iscience 23 (6), 2020 | 7 | 2020 |
| A faithful discretization of the augmented persistent homology transform BT Fasy, S Micka, DL Millman, A Schenfisch, L Williams arXiv preprint arXiv:1912.12759, 2019 | 7 | 2019 |
| The first algorithm for reconstructing simplicial complexes of arbitrary dimension from persistence diagrams BT Fasy, S Micka, DL Millman, A Schenfisch, L Williams arXiv preprint arXiv:1912.12759, 2019 | 6 | 2019 |
| Efficient graph reconstruction and representation using augmented persistence diagrams BT Fasy, S Micka, DL Millman, A Schenfisch, L Williams arXiv preprint arXiv:2212.13206, 2022 | 5 | 2022 |
| Efficient minimum flow decomposition via integer linear programming FHC Dias, L Williams, B Mumey, AI Tomescu Journal of Computational Biology 29 (11), 1252-1267, 2022 | 5 | 2022 |
| A safety framework for flow decomposition problems via integer linear programming FHC Dias, M Cáceres, L Williams, B Mumey, AI Tomescu Bioinformatics 39 (11), btad640, 2023 | 4 | 2023 |
| Extending maximal perfect haplotype blocks to the realm of pangenomics L Williams, B Mumey Algorithms for Computational Biology: 7th International Conference, AlCoB …, 2020 | 1 | 2020 |
| A Faithful Discretization of the Verbose Persistent Homology Transform BT Fasy, S Micka, DL Millman, A Schenfisch, L Williams arXiv e-prints, arXiv: 1912.12759, 2019 | 1 | 2019 |
| Width Helps and Hinders Splitting Flows MA Caceres Reyes, M Cairo, A Grigorjew, S Khan, BM Mumey, R Rizzi, ... | | 2022 |
