A variant of the tandem duplication - random loss model of genome rearrangement

Theoretical Computer Science

Volumn 410, Issue 8-10, 2009, Pages 847-858

  Bouvel, Mathilde ^a   Rossin, Dominique ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Genome rearrangement; Pattern; Pattern avoiding permutations; Permutations; Sorting; Tandem duplication random loss model

Indexed keywords

GENOME REARRANGEMENT; PATTERN; PATTERN-AVOIDING PERMUTATIONS; PERMUTATIONS; SORTING; TANDEM DUPLICATION - RANDOM LOSS MODEL;

BOOLEAN FUNCTIONS;

EID: 59049100203     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.11.017     Document Type: Article

References (10)

1. Albert M.H., Aldred R.E.L., Atkinson M.D., Van Ditmarsch H.P., Handley C.C., Hotlon D.A., and McCaughan D.J. Compositions of pattern restricted sets of permutations. Australas. J. Combin. 37 (2007) 43-56
2. Bérard S., Bergeron A., Chauve C., and Paul C. Perfect sorting by reversals is not always difficult. IEEE/ACM Trans. Comput. Biol. Bioinform. 4 1 (2007)
3. Bóna M. Combinatorics of Permutations (2004), CRC Press, Inc., Boca Raton, FL, USA
4. M. Bouvel, E. Pergola, Posets and permutations in the duplication-loss model: Minimal permutations with d descents. arXiv:0806.1494v1[math.CO], 2008
5. K. Chaudhuri, K. Chen, R. Mihaescu, S. Rao, On the tandem duplication-random loss model of genome rearrangement, in: SODA, 2006, pp. 564-570
6. Chen M.C., and Lee R.C.T. Sorting by transpositions based on the first increasing substring concept. BIBE '04: Proceedings of the 4th IEEE Symposium on Bioinformatics and Bioengineering (2004), IEEE Computer Society, Washington, DC, USA 553
7. Comtet L. Advanced Combinatorics (1974), Dordrecht
8. El-Mabrouk N., and Sankoff D. The reconstruction of doubled genomes. SIAM J. Comput. 32 3 (2003) 754-792
9. Labarre A. A new tight upper bound on the transposition distance. In: Casadio R., and Myers G. (Eds). Algorithms in Bioinformatics. 5th International Workshop, WABI 2005, October 3-6, 2005, Proceedings. Lecture Notes in Computer Science vol. 3692 (2005), Springer, Mallorca, Spain 216-227
10. Labarre A. New bounds and tractable instances for the transposition distance. IEEE/ACM Trans. Comput. Biology Bioinform 3 4 (2006) 380-394