Martin Bader

According to our database1, Martin Bader authored at least 11 papers between 2006 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Genome rearrangement algorithms.
PhD thesis, 2011

The transposition median problem is NP-complete.
Theor. Comput. Sci., 2011

Genome Rearrangement Algorithmen.
Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

2010
Genome rearrangements with duplications.
BMC Bioinform., 2010

2009
Sorting by reversals, block interchanges, tandem duplications, and deletions.
BMC Bioinform., 2009

2008
Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation.
J. Comput. Biol., 2008

A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions.
BMC Bioinform., 2008

GENESIS: genome evolution scenarios.
Bioinform., 2008

2007
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.
J. Comput. Biol., 2007

How to Achieve an Equivalent Simple Permutation in Linear Time.
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

2006
RoboCupJunior: Robots Lure Kids to Science.
Künstliche Intell., 2006


  Loading...