Conservation of combinatorial structures in evolution scenarios

Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science)

Volumn 3388, Issue , 2005, Pages 1-14

  Bérard, Sèverine ^a   Bergeron, Anne ^b   Chauve, Cedric ^b  

^a LIRMM   (France)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; GENES; GENETIC ENGINEERING; CHARACTERIZATION; LIVING SYSTEMS STUDIES; PROBLEM SOLVING; QUALITY CONTROL;

GENOME REARRANGEMENT SCENARIOS; HUMAN X CHROMOSOMES;

COMBINATORIAL MATHEMATICS; GENETIC ENGINEERING;

COMBINATORIAL STRUCTURES; COMMUTING SCENARIOS; HUMAN X CHROMOSOMES;

EID: 26444559147     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32290-0_1     Document Type: Conference Paper

References (18)

1. D. A. Bader, B. M. E. Moret, and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comp. Biol., 8(5):483-491, 2001.
2. A. Bergeron. A very elementary presentation of the hannenhalli-pevzner theory. In CPM 2001, volume 2089 of Lecture Notes in Comput. Sci., pages 106-117, 2001. (Extended version to appear in Discrete Applied Math.).
3. A. Bergeron, C Chauve, T. Hartman, and K. St-Onge. On the properties of sequences of reversals that sort a signed permutation. In JOBIM 2002, pages 99-108, 2002.
4. A. Bergeron, S. Heber, and J. Stoye. Common intervals and sorting by reversals: A marriage of necessity. Bioinformatics, 18(Suppl. 2):S54-S63, 2002. (ECCB 2002).
5. A. Bergeron, J. Mixtacki, and J. Stoye. Reversal distance without hurdles and fortresses. In CPM 2004, volume 3109 of Lecture Notes in Comput. Sci., pages 388-399, 2004.
6. G. Bourque and P. A. Pevzner. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res., 12(1):26-36, 2002.
7. G. Bourque, P. A. Pevzner, and G. Tesler. Reconstructing the genomic architecture of ancestral mammals: Lessons from human, mouse, and rat genomes. Genome Res., 14(4):507-516, 2004.
8. A. Caprara. Formulations and hardness of multiple sorting by reversals. In RECOMB 1999, pages 84-94, 1999.
9. M. Figeac and J.-S. Varré. Sorting by reversals with common intervals. In WABI 2004, volume 3240 of Lecture Notes in Bioinformatics, pages 26-37, 2004.
10. R. A. Gibbs et al. Genome sequence of the brown norway rat yields insights into mammalian evolution. Nature, 428:493-521, 2004.
11. S. Hannenhalli and P. A. Pevzner. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM, 46(1): 1-27, 1999.
12. S. Heber and J. Stoye. Finding all common intervals of k permutations. In CPM 2001. volume 2089 of Lecture Notes in Comput. Sci., pages 207-218, 2001.
13. H. Kaplan, R. Shamir, and R. E. Tarjan. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Computing, 29 (3): 880-892, 1999.
14. B. M. E. Moret, A. C. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In WABI 2002. volume 2452 of Lecture Notes in Comput. Sci., pages 521-536, 2002.
15. P. A. Pevzner and G. Tesler. Genome rearrangements in mammalian evolution: Lessons from human and mouse genomes. Genome Res., 13(1):37-45, 2003.
16. E. Tannier and M.-F. Sagot. Sorting by reversals in subquadratic time. In CPM 2004, volume 3109 of Lecture Notes in Comput. Sci., pages 1-13, 2004.
17. G. Tesler. GRIMM: genome rearrangements web server. Bioinformatics, 18(3):492-493, 2002.
18. T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290-309, 2000.