-
1
-
-
0029493079
-
Transforming men into mice (polynomial algorithm for genomic distance problem)
-
Hannenhalli S, Pevzner P. Transforming men into mice (polynomial algorithm for genomic distance problem). Proc. of FOCS 1995, 1995:581-592.
-
(1995)
Proc. of FOCS
, vol.1995
, pp. 581-592
-
-
Hannenhalli, S.1
Pevzner, P.2
-
2
-
-
24044535485
-
Efficient sorting of genomic permutations by translocation, inversion and block interchange
-
10.1093/bioinformatics/bti535, 15951307
-
Yancopoulos S, Attie O, Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 2005, 21:3340-3346. 10.1093/bioinformatics/bti535, 15951307.
-
(2005)
Bioinformatics
, vol.21
, pp. 3340-3346
-
-
Yancopoulos, S.1
Attie, O.2
Friedberg, R.3
-
3
-
-
33750264868
-
A unifying view of genome rearrangements
-
Bergeron A, Mixtacki J, Stoye J. A unifying view of genome rearrangements. Proc. of WABI 2006, LNBI, Volume 4175 2006, 163-173.
-
(2006)
Proc. of WABI 2006, LNBI, Volume 4175
, pp. 163-173
-
-
Bergeron, A.1
Mixtacki, J.2
Stoye, J.3
-
4
-
-
77958067329
-
The solution space of sorting by DCJ
-
10.1089/cmb.2010.0109, 20874401
-
Braga MDV, Stoye J. The solution space of sorting by DCJ. Journal of Computational Biology 2010, 17(9):1145-1165. 10.1089/cmb.2010.0109, 20874401.
-
(2010)
Journal of Computational Biology
, vol.17
, Issue.9
, pp. 1145-1165
-
-
Braga, M.D.V.1
Stoye, J.2
-
5
-
-
0033391532
-
Genome rearrangement with gene families
-
10.1093/bioinformatics/15.11.909, 10743557
-
Sankoff D. Genome rearrangement with gene families. Bioinformatics 1999, 15(11):909-917. 10.1093/bioinformatics/15.11.909, 10743557.
-
(1999)
Bioinformatics
, vol.15
, Issue.11
, pp. 909-917
-
-
Sankoff, D.1
-
6
-
-
4544335270
-
The complexity of calculating exemplar distances
-
Sankoff D, Nadeau JH
-
Bryant D. The complexity of calculating exemplar distances. Comparative Genomics 2000, 207-212. Sankoff D, Nadeau JH.
-
(2000)
Comparative Genomics
, pp. 207-212
-
-
Bryant, D.1
-
8
-
-
84856832577
-
Genome rearrangements with duplications
-
10.1186/1471-2105-11-S1-S27, 3026374, 20946611
-
Bader M. Genome rearrangements with duplications. BMC Bioinformatics 2010, 11(Suppl 1):S27. 10.1186/1471-2105-11-S1-S27, 3026374, 20946611.
-
(2010)
BMC Bioinformatics
, vol.11
, Issue.SUPPL. 1
-
-
Bader, M.1
-
9
-
-
0344794387
-
Sorting Signed Permutations by Reversals and Insertions/Deletions of Contiguous Segments
-
El-Mabrouk N. Sorting Signed Permutations by Reversals and Insertions/Deletions of Contiguous Segments. Journal of Discrete Algorithms 2001, 1:105-122.
-
(2001)
Journal of Discrete Algorithms
, vol.1
, pp. 105-122
-
-
El-Mabrouk, N.1
-
10
-
-
80052638701
-
Double Cut and Join with Insertions and Deletions
-
DOI: 10.1089/cmb.2011.0118, 10.1089/cmb.2011.0118, 21899423
-
Braga MDV, Willing E, Stoye J. Double Cut and Join with Insertions and Deletions. Journal of Computational Biology 2011, 18:1167-1184. DOI: 10.1089/cmb.2011.0118, 10.1089/cmb.2011.0118, 21899423.
-
(2011)
Journal of Computational Biology
, vol.18
, pp. 1167-1184
-
-
Braga, M.D.V.1
Willing, E.2
Stoye, J.3
-
11
-
-
80053523144
-
Genomic distance under gene substitutions
-
doi:10.1186/1471-2105-12-S9-S8, 3044316, 21342591
-
Braga MDV, Machado R, Ribeiro LC, Stoye J. Genomic distance under gene substitutions. BMC Bioinformatics 2011, 12(Suppl 9):S8. doi:10.1186/1471-2105-12-S9-S8, 3044316, 21342591.
-
(2011)
BMC Bioinformatics
, vol.12
, Issue.SUPPL. 9
-
-
Braga, M.D.V.1
Machado, R.2
Ribeiro, L.C.3
Stoye, J.4
-
12
-
-
70349789709
-
DCJ path formulation for genome transformations which include insertions, deletions, and duplications
-
10.1089/cmb.2009.0092, 19803734
-
Yancopoulos S, Friedberg R. DCJ path formulation for genome transformations which include insertions, deletions, and duplications. Journal of Computational Biology 2009, 16(10):1311-1338. 10.1089/cmb.2009.0092, 19803734.
-
(2009)
Journal of Computational Biology
, vol.16
, Issue.10
, pp. 1311-1338
-
-
Yancopoulos, S.1
Friedberg, R.2
|