Exploring the set of all minimal sequences of reversals-an application to test the replication-directed reversal hypothesis

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

Volumn 2452, Issue , 2002, Pages 300-315

  Ajana, Yasmine ^a   Lefebvre, Jean François ^a   Tillier, Elisabeth R M ^b   El Mabrouk, Nadia ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY HEALTH NETWORK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LINEAR ALGORITHMS; MINIMAL SOLUTIONS; REVERSAL DISTANCE; SORTING BY REVERSALS; SORTING PROCEDURE;

BIOINFORMATICS;

EID: 84957002571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45784-4_23     Document Type: Conference Paper

References (13)

1. D.A. Bader, B.M.E. Moret, and M. Yan. A linear-time algorithm for computing inv. dist. between signed perm. J. Comput. Biol., 8(5):483-491, 2001.
2. V. Bafna and P.A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11(2):224-240, 1998.
3. A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. In CPM’01, LNCS, pages 106-117. Springer Verlag, 2001.
4. P. Berman and S. Hannenhalli. Fast sorting by reversals. In CPM’96, LNCS, pages 168-185. Springer-Verlag, 1996.
5. M. Blanchette, T. Kunisawa, and D. Sankoff. Parametric genome rearrangement. Gene-Combis, 172:11-17, 1996.
6. N. El-Mabrouk. Sorting signed permutations by reversals and insertions/deletions of contiguous segments. to appear in J. Disc. Algo., 2000.
7. S. Hannenhalli. Polynomial-time algorithm for computing translocation distance between genomes. In CPM, LNCS 937, pages 162-176. Springer, 1995.
8. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip. In Proc. 27th Annu. ACM-SIAM Symp. Theory of Comp., pages 178-189, 1995.
9. S. Hannenhalli and P.A. Pevzner. Transforming men into mice. In Proc. of the IEEE 36th Annu. Symp. on Found. of Comp. Sci., pages 581-592, 1995.
10. H. Kaplan, R. Shamir, and R.E. Tarjan. Faster and simpler algo. for sorting sign. perm. by rev. In Proc. 8th Annu. ACM-SIAM Symp. Disc. Algo., 1997.
11. A. C. Siepel. An algorithm to find all sorting reversals. In RECOMB’02, pages 281-290, Washington, 2002. ACM.
12. E.R.M. Tillier and R.A. Collins. Genome rearrangement by replication-directed translocation. Nature Genetics, 26:195-197, October 2000.
13. M. E. Walter, Z. Dias, and J. Meidanis. Reversal and transposition distance of linear chromosomes. In SPIRE ’98, 1998.