| * | 2009 |
|---|
| 9 | EE | Matthias Bernt,
Ming-Chiang Chen,
Daniel Merkle,
Hung-Lung Wang,
Kun-Mao Chao,
Martin Middendorf:
Finding All Sorting Tandem Duplication Random Loss Operations.
CPM 2009: 301-313 |
| 2008 |
|---|
| 8 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree.
RECOMB-CG 2008: 143-157 |
| 7 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
Solving the Preserving Reversal Median Problem.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 332-347 (2008) |
| 2007 |
|---|
| 6 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
A Fast and Exact Algorithm for the Perfect Reversal Median Problem.
ISBRA 2007: 305-316 |
| 5 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
Using median sets for inferring phylogenetic trees.
Bioinformatics 23(2): 129-135 (2007) |
| 4 | EE | Matthias Bernt,
Daniel Merkle,
Kai Ramsch,
Guido Fritzsch,
Marleen Perseke,
Detlef Bernhard,
Martin Schlegel,
Peter F. Stadler,
Martin Middendorf:
CREx: inferring genomic rearrangements based on common intervals.
Bioinformatics 23(21): 2957-2958 (2007) |
| 2006 |
|---|
| 3 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders.
CompLife 2006: 52-63 |
| 2 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
Genome Rearrangement Based on Reversals that Preserve Conserved Intervals.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(3): 275-288 (2006) |
| 2005 |
|---|
| 1 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
A Parallel Algorithm for Solving the Reversal Median Problem.
PPAM 2005: 1089-1096 |
