Evolution under reversals: Parsimony and conservation of common intervals

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 4, Issue 2, 2007, Pages 301-309

  Diekmann, Yoan ^a   Sagot, Marie France ^b   Tannier, Eric ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Common intervals; Computational biology; Genome rearrangements; Perfect sorting; Signed permutations; Sorting by reversals

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MAMMALS; POLYNOMIALS;

COMPUTATIONAL BIOLOGY; GENOME REARRANGEMENTS; PERFECT SORTING; SIGNED PERMUTATIONS;

GENES;

MAMMALIA;

ALGORITHM; ARTICLE; CHROMOSOME MAP; DNA SEQUENCE; GENE REARRANGEMENT; GENETIC VARIABILITY; GENETICS; METHODOLOGY; MOLECULAR EVOLUTION; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE;

ALGORITHMS; BASE SEQUENCE; CHROMOSOME MAPPING; CONSERVED SEQUENCE; EVOLUTION, MOLECULAR; GENE REARRANGEMENT; MOLECULAR SEQUENCE DATA; SEQUENCE ANALYSIS, DNA; VARIATION (GENETICS);

EID: 34248356749     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2007.1042     Document Type: Article

References (12)

1. D.A. Bader, B.M.E. Moret, and M. Yan, "A Linear-Time Algorithm for Computing Inversion Distances between Signed Permutations with an Experimental Study," J. Computational Biology, vol. 8, no. 5, pp. 483-491, 2001.
2. M.-P. Beal, A. Bergeron, S. Corteel, and M. Raffinot, "An Algorithmic View of Gene Teams," Theoretical Computer Science, vol. 320, nos. 2-3, pp. 395-418, 2004.
3. S. Bérard, A. Bergeron, and C. Chauve, "Common Structures in Evolution Scenarios," Proc. Second RECOMB Comparative Genomics Satellite Workshop, pp. 1-15, 2004.
4. S. Bérard, A. Bergeron, C. Chauve, and C. Paul, "Perfect Sorting by Reversals Is Not Always Difficult," Proc. Workshop Computational Biology and Bioinfomatics (WABI '05), pp. 228-237, 2005.
5. A. Bergeron, J. Mixtacki, and J. Stoye, "The Inversion Distance Problem," Math. Evolution and Phytogeny, O. Gascuel, ed., Oxford Univ. Press, 2005.
6. G. Bourque, P. Pevzner, and G. Tesler, "Reconstructing the Genomic Architecture of Ancestral Mammals: Lessons from Human, Mouse and Rat Genomes," Genome Research, vol. 14, pp. 507-516, 2004.
7. B.-M. Bui Xuan, M. Habib, and C. Paul, "Revisiting T. Uno and M. Yagiura's Algorithm," Proc. Int'l Symp. Algorithms and Computation (ISAAC '05), pp. 146-155, 2005.
8. M. Figeac and J.-S. Varré, "Sorting by Reversals with Common Intervals," Proc. Workshop Computational Biology and Bioinformatics (WABI '04), pp. 26-37, 2004.
9. S. Hannenhalli and P. Pevzner, "Transforming Cabbage into Turnip (Polynomial Algorithm for Sorting Signed Permutations by Reversals)," J. ACM, vol. 46, pp. 1-27, 1999.
10. S. Heber and J. Stoye, "Finding All Common Intervals of k Permutations," Proc. Ann. Symp. Combinatorial Pattern Matching (CPM '01), pp. 207-218, 2001.
11. M.-F. Sagot and E. Tannier, "Perfect Sorting by Reversals," Proc. Int'l Computing and Combinatorics Conf. (COCOON '05), pp. 42-51, 2005.
12. E. Tannier, A. Bergeron, and M.-F. Sagot, "Advances on Sorting by Reversals," Discrete Applied Math., 2006.