Software
A nonexhaustive selection of code I wrote, in the hope that some of it will be useful to you.
Research
I'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.Genome rearrangements
-
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
my results
on sorting by transpositions and sorting by prefix block-interchanges.
(version 0.0.3, last updated on 29/03/2023)
Graph classification
Graph classification is concerned with the following problem: given an input graph, what are the minimal (with respect to inclusion) graph classes to which this graph belongs? This problem generalises to several input graphs, in which case we are interested in determining common features shared by all these input graphs.- graphotaxy performs graph classification, using the invaluable resources made available by the ISGCI. It cannot be exhaustive, if only because the recognition status of many classes is unknown, but it currently implements recognisers for over 700 classes.
Graph decompositions
-
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)