 | 2011 |
|---|
| 11 |       | Martin Bader:
The transposition median problem is NP-complete.
Theor. Comput. Sci. 412(12-14): 1099-1110 (2011) |
| 10 | | Martin Bader:
Genome rearrangement algorithms.
University of Ulm 2011 |
| 2010 |
|---|
| 9 | | Martin Bader:
Genome rearrangements with duplications.
BMC Bioinformatics 11(S-1): 27 (2010) |
| 2009 |
|---|
| 8 | | Martin Bader:
Sorting by reversals, block interchanges, tandem duplications, and deletions.
BMC Bioinformatics 10(S-1): (2009) |
| 2008 |
|---|
| 7 | | Martin Bader,
Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch:
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
BMC Bioinformatics 9: (2008) |
| 6 | | Simon Gog,
Martin Bader,
Enno Ohlebusch:
GENESIS: genome evolution scenarios.
Bioinformatics 24(5): 711-712 (2008) |
| 5 | | Simon Gog,
Martin Bader:
Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation.
Journal of Computational Biology 15(8): 1029-1041 (2008) |
| 2007 |
|---|
| 4 | | Simon Gog,
Martin Bader:
How to Achieve an Equivalent Simple Permutation in Linear Time.
RECOMB-CG 2007: 58-68 |
| 3 | | Martin Bader,
Enno Ohlebusch:
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.
Journal of Computational Biology 14(5): 615-636 (2007) |
| 2006 |
|---|
| 2 | | Martin Bader,
Enno Ohlebusch:
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.
RECOMB 2006: 563-577 |
| 1 | | Gerhard K. Kraetzschmar,
Martin Bader,
Rolf Bayer:
RoboCupJunior: Robots Lure Kids to Science.
KI 20(2): 36-38 (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page