|
Braga, Marilia D. V. and Willing, Eyla and Stoye, Jens Double cut and join with insertions and deletions., Journal of Computational Biology, 2011 |
 |
|
Bergeron, A. and Mixtacki, J. and Stoye, J. Chapter 10: The inversion distance problem., , 2005 |
|
|
Bergeron, A. and Mixtacki, J. and Stoye, J. On sorting by translocations, Journal of Computational Biology, 2006 |
|
|
Bergeron, A. and Mixtacki, J. and Stoye, J. A Unifying View of Genome Rearrangements, 2006 |
|
|
Bergeron, A. and Mixtacki, J. and Stoye, J. HP distance via double cut and join distance, 2008 |
|
|
Erdos, P.L. and L., Soukup and Stoye, J. Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance, Applied Mathematics Letters, 2011 |
|
|
Hannenhalli, S. and Pevzner, P.A. Transforming men into mice (polynomial algorithm for genomic distance problem)., 1995 |
|
|
Hannenhalli, S. and Pevzner, P.A. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals., ACM, 1999 |
|
|
Jean, G. and Nikolski, M. Genome rearrangements: a correct algorithm for optimal capping., Information Processing Letters, 2007 |
|
|
Kovac, J. and Warren, R. and Braga, MD. and Stoye, J. Restricted DCJ model: rearrangement problems with chromosome reincorporation., Journal of Computational Biology, 2011 |
|
|
Pevzner, P.A. and Tesler, G. Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited., 2003 |
|
|
Tannier, E. and Bergeron, A. and Sagot, M.-F. Advances in sorting by reversals., Discrete Applied Mathematics, 2007 |
|
|
G. Tesler Efficient algorithms for multichromosomal genome rearrangements., Journal of Computer and System Sciences, 2002 |
|
|
Yancopoulos, S. and Attie, O. and Friedberg, R. Efficient sorting of genomic permutations by translocation, inversion and block interchange., Bioinformatics, 2005 |
|
