Parking functions, labeled trees and DCJ sorting scenarios

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

Volumn 5817 LNBI, Issue , 2009, Pages 24-35

  Ouangraoua, Aïda ^a,b   Bergeron, Anne ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

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

Author keywords

[No Author keywords available]

Indexed keywords

BIJECTIONS; COMBINATORIAL OBJECTS; EXACT FORMULAS; GENOME REARRANGEMENTS; LABELED TREES; PARKING FUNCTIONS; STATISTICAL SIGNIFICANCE;

STATISTICAL TESTS;

GENES;

EID: 78651235607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04744-2_3     Document Type: Conference Paper

References (23)

1. Ajana, Y., Lefebvre, J.-F., Tillier, E.R.M., El-Mabrouk, N.: Exploring the set of all minimal sequences of reversals - an application to test the replication-directed reversal hypothesis. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, p. 300. Springer, Heidelberg (2002)
2. Barcucci, E., del Lungo, A., Pergola, E.: Random generation of trees and other combinatorial objects. Theoretical Computer Science 218(2), 219-232 (1999)
3. Bérard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. IEEE/ACM Transactions on Computational Biology and Bioinformatics 4(1), 4-16 (2007)
4. Bergeron, A., Chauve, C., Hartman, T., St-onge, K.: On the properties of sequences of reversals that sort a signed permutation. In: Proceedings Troisièmes Journées Ouvertes Biologie Informatique Mathématiques, pp. 99-108 (2002)
5. Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163-173. Springer, Heidelberg (2006)
6. Braga, M.D.V., Sagot, M.-F., Scornavacca, C., Tannier, E.: Exploring the solution space of sorting by reversals, with experiments and an application to evolution. IEEE/ACM Transactions on Computational Biology and Bioinformatics 5(3), 348-356 (2008)
7. Diekmann, Y., Sagot, M.-F., Tannier, E.: Evolution under reversals: Parsimony and conservation of common intervals. IEEE/ACM Transactions on Computational Biology and Bioinformatics 4(2), 301-309 (2007)
8. Kalikow, L.H.: Enumeration of parking functions, allowable permutation pairs, and labeled trees. PhD thesis, Brandeis University (1999)
9. Konheim, A.G.,Weiss, B.: An occupancy discipline and applications. SIAMJournal of Applied Mathematics 14, 1266-1274 (1966)
10. McLysaght, A., Seoighe, C., Wolfe, K.H.: High frequency of inversions during eukaryote gene order evolution. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families, pp. 47-58. Kluwer Academic Press, Dordrecht (2000)
11. Miklós, I., Darling, A.: Efficient sampling of parsimonious inversion histories with application to genome rearrangement in yersinia. Genome Biology and Evolution 1(1), 153-164 (2009)
12. Miklós, I., Hein, J.: Genome rearrangement in mitochondria and its computational biology. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol. 3388, pp. 85-96. Springer, Heidelberg (2005)
13. Ozery-flato, M., Shamir, R.: Sorting by translocations via reversals theory. Journal of Computational Biology 14(4), 408-422 (2007)
14. Pevzner, P., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proceedings of National Academy of Sciences USA 100(13), 7672-7677 (2003)
15. Sankoff, D., Lefebvre, J.-F., Tillier, E.R.M., Maler, A., El-Mabrouk, N.: The distribution of inversion lengths in bacteria. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol. 3388, pp. 97-108. Springer, Heidelberg (2005)
16. Sankoff, D., Trinh, P.: Chromosomal breakpoint reuse in genome sequence rearrangement. Journal of Computational Biology 12(6), 812-821 (2005)
17. Siepel, A.C.: An algorithm to enumerate all sorting reversals. In: RECOMB 2002: Proceedings of the Sixth annual International Conference on Computational biology, pp. 281-290. ACM, New York (2002)
18. Stanley, R.P.: Enumerative Combinatorics, vol. I. Wadsworth and Brookes/Cole, Monterey, California (1986)
19. Stanley, R.P.: Parking functions and noncrossing partitions. Electronic Journal of Combinatorics 4(2), R20 (1997)
20. Stanley, R.P.: Enumerative Combinatorics, vol. II. Cambridge University Press, Cambridge (1999)
21. Swenson, K.M., Dong, Y., Tang, J., Moret, B.M.E.: Maximum independent sets of commuting and noninterfering inversions. In: 7th Asia-Pacific Bioinformatics Conference ( to appear, 2009)
22. Xu, A.W., Zheng, C., Sankoff, D.: Paths and cycles in breakpoint graphs of random multichromosomal genomes. Journal of Computational Biology 14(4), 423-435 (2007)
23. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340-3346 (2005)