Hurdles hardly have to be heeded

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5267 LNBI, Issue , 2008, Pages 241-251

  Swenson, Krister M ^a   Lin, Yu ^a   Rajan, Vaibhav ^a   Moret, Bernard M E ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BREAK-POINTS; GENOMIC ARCHITECTURE; RANDOM PERMUTATIONS; RANDOMIZED ALGORITHMS; REARRANGEMENT MECHANISMS;

ASYMPTOTIC ANALYSIS; PROBABILITY;

CHARACTERIZATION;

EID: 70349825369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87989-3_18     Document Type: Conference Paper

References (13)

1. Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8(5), 483-491 (2001);
2. A preliminary version appeared in WADS 2001, pp. 365-376
3. Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics 146(2), 134-145 (2005)
4. Bergeron, A., Chauve, C., Hartman, T., Saint-Onge, K.: On the properties of sequences of reversals that sort a signed permutation. In: JOBIM, 99-108 (June 2002)
5. Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 68-79. Springer, Heidelberg (2003)
6. Caprara, A.: On the tightness of the alternating-cycle lower bound for sorting by reversals. J. Combin. Optimization 3, 149-182 (1999)
7. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Ann. ACM Symp. Theory of Comput. (STOC 1995), pp. 178-189. ACM Press, New York (1995)
8. Hannenhalli, S., Pevzner, P.A.: Transforming mice into men (polynomial algorithm for genomic distance problems). In: Proc. 36th Ann. IEEE Symp. Foundations of Comput. Sci. (FOCS 1995), pp. 581-592. IEEE Computer Society Press, Piscataway (1995)
9. Kaplan, H., Verbin, E.: Efficient data structures and a new randomized approach for sorting signed permutations by reversals. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 170-185. Springer, Heidelberg (2003)
10. Sankoff, D., Haque, L.: The distribution of genomic distance between random genomes. J. Comput. Biol. 13(5), 1005-1012 (2006)
11. Sturtevant, A.H., Beadle, G.W.: The relation of inversions in the x-chromosome of drosophila melanogaster to crossing over and disjunction. Genetics 21, 554-604 (1936)
12. Sturtevant, A.H., Dobzhansky, Th.: Inversions in the third chromosome of wild races of drosophila pseudoobscura and their use in the study of the history of the species. Proc. Nat'l Acad. Sci., USA 22, 448-450 (1936)
13. Tannier, E., Sagot, M.: Sorting by reversals in subquadratic time. In: Sahinalp, S.C.,Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 1-13. Springer, Heidelberg (2004)