Genome aliquoting revisited

Journal of Computational Biology

Volumn 18, Issue 9, 2011, Pages 1065-1075

  Warren, Robert ^a   Sankoff, David ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Algorithms; evolution; genomic rearrangements

Indexed keywords

ALGORITHM; BIOLOGICAL MODEL; COMPUTER SIMULATION; CONFERENCE PAPER; GENE DOSAGE; GENE DUPLICATION; GENETICS; GENOME; PHYLOGENY; PLOIDY; TELOMERE;

ALGORITHMS; COMPUTER SIMULATION; GENE DOSAGE; GENE DUPLICATION; GENOME; MODELS, GENETIC; PHYLOGENY; PLOIDIES; TELOMERE;

EID: 80052640727     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2011.0087     Document Type: Conference Paper

References (10)

1. Alekseyev, M.A., and Pevzner, P.A. 2007. Whole genome duplications and contracted breakpoint graphs. SIAM J. Comput., 36, 1748-1763.
2. Bergeron, A., Mixtacki, J., and Stoye, J. 2006. A unifying view of genome rearrangements. Lect. Notes Comput. Sci. 4175, 163-173. (Pubitemid 44609667)
3. El-Mabrouk, N., and Sankoff, D. 2003. The reconstruction of doubled genomes. SIAM J. Comput. 32, 754-792.
4. Feijão, P., and Meidanis, J. 2009. SCJ: a novel rearrangement operation for which sorting, genome median and genome halving problems are easy. Lect. Notes Comput. Sci. 5724, 85-96.
5. Lovász, L., and Plummer, M.D. 2009. Matching Theory. AMS Chelsea Publishing, Providence.
6. Mixtacki, J. 2008. Genome halving under DCJ revisited. Lect. Notes Comput. Sci. 5092, 276-286.
7. Sankoff, D., and Blanchette, M. 1997. The median problem for breakpoints in comparative genomics. Proc. COCOON '97 251-264.
8. Tannier, E., Zheng, C., and Sankoff, D. 2009. Multichromosomal median and halving problems under different genomic distances. Bioinformatics 10, 120.
9. Warren, R., and Sankoff, D. 2009a. Genome aliquoting with double cut and join. BMC Bioinform. 10, S2.
10. Warren, R., and Sankoff, D. 2009b. Genome halving with double cut andjoin. J. Bioinform. Comput. Biol. 7, 357-371.