Magnus Bordewich
Magnus Bordewich
Professor of Computer Science, Durham University
Verified email at - Homepage
Cited by
Cited by
On the computational complexity of the rooted subtree prune and regraft distance
M Bordewich, C Semple
Annals of combinatorics 8, 409-423, 2005
Computing the minimum number of hybridization events for a consistent evolutionary history
M Bordewich, C Semple
Discrete Applied Mathematics 155 (8), 914-928, 2007
Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable
M Bordewich, C Semple
IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (3), 458-466, 2007
A network approach to study karyotypic evolution: the chromosomal races of the common shrew (Sorex araneus) and house mouse (Mus musculus) as model systems
TA White, M Bordewich, JB Searle
Systematic biology 59 (3), 262-276, 2010
A reduction algorithm for computing the hybridization number of two trees
M Bordewich, S Linz, KS John, C Semple
Evolutionary Bioinformatics 3, 117693430700300017, 2007
Approximate counting and quantum computation
M Bordewich, M Freedman, L Lovász, D Welsh
Combinatorics, Probability and Computing 14 (5-6), 737-754, 2005
A 3-approximation algorithm for the subtree distance between phylogenies
M Bordewich, C McCartin, C Semple
Journal of Discrete Algorithms 6 (3), 458-471, 2008
Consistency of topological moves based on the balanced minimum evolution principle of phylogenetic inference
M Bordewich, O Gascuel, KT Huber, V Moulton
IEEE/ACM Transactions on Computational Biology and Bioinformatics 6 (1), 110-117, 2008
Determining phylogenetic networks from inter-taxa distances
M Bordewich, C Semple
Journal of mathematical biology 73 (2), 283-303, 2016
Reticulation-visible networks
M Bordewich, C Semple
Advances in Applied Mathematics 78, 114-141, 2016
Mixing of the Glauber dynamics for the ferromagnetic Potts model
M Bordewich, C Greenhill, V Patel
Random Structures & Algorithms 48 (1), 21-52, 2016
Selecting taxa to save or sequence: desirable criteria and a greedy solution
M Bordewich, AG Rodrigo, C Semple
Systematic biology 57 (6), 825-834, 2008
Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
M Bordewich, S Linz, C Semple
Journal of theoretical biology 423, 1-12, 2017
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
M Bordewich, M Dyer, M Karpinski
Random Structures & Algorithms 32 (3), 375-399, 2008
Path coupling without contraction
M Bordewich, M Dyer
Journal of Discrete Algorithms 5 (2), 280-292, 2007
Stopping times, metrics and approximate counting
M Bordewich, M Dyer, M Karpinski
Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006
Identifying phylogenetic trees
M Bordewich, KT Huber, C Semple
Discrete Mathematics 300 (1-3), 30-43, 2005
Nature reserve selection problem: a tight approximation algorithm
M Bordewich, C Semple
IEEE/ACM transactions on computational biology and bioinformatics 5 (2), 275-280, 2008
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
M Bordewich, N Tokac
Discrete applied mathematics 213, 47-59, 2016
Optimizing phylogenetic diversity across two trees
M Bordewich, C Semple, A Spillner
Applied mathematics letters 22 (5), 638-641, 2009
The system can't perform the operation now. Try again later.
Articles 1–20