Matthias Bernt

IEEE ACM Trans. Comput. Biol. Bioinform., 2019

2018

Genome Rearrangement with ILP.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements.

[BibT_eX]

[DOI]

Tom Hartmann

BMC Bioinform., 2018

2017

Partially local three-way alignments and the sequence signatures of mitochondrial genome rearrangements.

[BibT_eX]

[DOI]

Marwa Al Arab

Christian Höner zu Siederdissen

Kifah Tout

Peter F. Stadler

Algorithms Mol. Biol., 2017

2016

A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2016

2015

Cophylogenetic Reconciliation with ILP.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Refined ranking relations for selection of solutions in multi objective metaheuristics.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

2014

The Influence of Correlated Objectives on Different Types of P-ACO Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimisation, 2014

2013

Unifying Parsimonious Tree Reconciliation.

[BibT_eX]

[DOI]

Nicolas Wieseke

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

A common interval guided ACO algorithm for permutation problems.

[BibT_eX]

[DOI]

Martin Clauß

Proceedings of the 2013 IEEE Symposium on Swarm Intelligence, 2013

Refined ranking relations for multi objective optimization andapplication to P-ACO.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

On Weighting Schemes for Gene Order Analysis.

[BibT_eX]

[DOI]

Nicolas Wieseke

Proceedings of the German Conference on Bioinformatics 2013, 2013

2012

Preserving Inversion Phylogeny Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Annotation guided local similarity search in multiple sequences and its application to mitochondrial genomes.

[BibT_eX]

[DOI]

Ruby L. V. Moritz

Proceedings of the 12th IEEE International Conference on Bioinformatics & Bioengineering, 2012

2011

Finding all sorting tandem duplication random loss operations.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

A method for computing an inventory of metazoan mitochondrial gene order rearrangements.

[BibT_eX]

[DOI]

BMC Bioinform., 2011

2010

Gene order rearrangement methods for the reconstruction of phylogeny

[BibT_eX]

[DOI]

PhD thesis, 2010

2009

Finding All Sorting Tandem Duplication Random Loss Operations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

Solving the Preserving Reversal Median Problem.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics, International Workshop, 2008

2007

CREx: inferring genomic rearrangements based on common intervals.

[BibT_eX]

[DOI]

Bioinform., 2007

Using median sets for inferring phylogenetic trees.

[BibT_eX]

[DOI]

Bioinform., 2007

A Fast and Exact Algorithm for the Perfect Reversal Median Problem.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

2006

Genome Rearrangement Based on Reversals that Preserve Conserved Intervals.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2006

The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders.

[BibT_eX]

[DOI]

Proceedings of the Computational Life Sciences II, 2006

2005

A Parallel Algorithm for Solving the Reversal Median Problem.

[BibT_eX]

[DOI]