A nonexhaustive selection of code I wrote, in the hope that some of it will be useful to you.
ResearchI'm in the --- long overdue --- process of putting together readable implementations of tools I've built for my research or of my own published algorithms. They will progressively populate this space. My current plan is to release everything in Python, the translation from pseudocode to that language being more straightforward than to other languages. Feel free to send me your time-consuming instances should portions of my code be too slow for your purposes, and I'll see whether or not I can improve my implementations.
permgr : implements most of the algorithms and computations of bounds I have obtained in my papers regarding genome
rearrangement problems on permutations. Currently covers all
on sorting by transpositions and sorting by prefix block-interchanges.
(version 0.0.2, last updated on 09/01/2021)
decompositions : implements algorithms for partitioning the edge set of a subcubic graph into various combinations of paths, triangles and stars. Only polynomial-time algorithms are provided. This is the companion software to my JGT21 paper.
(version 0.0.1, last updated on 13/08/2021)