Genome rearrangements with partially ordered chromosomes

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 52-62

  Zheng, Chunfang ^a   Sankoff, David ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMARKERS; BIOTECHNOLOGY; GRAPH THEORY; CHROMOSOMES; COMBINATORIAL MATHEMATICS; DIRECTED GRAPHS; LINEARIZATION;

GENOME REARRANGEMENTS; GENOMIC MAPS; MASTER MAPS; SPECIES; DIRECTED ACYCLIC GRAPH (DAG); MISSING DATA; OPTIMAL SEQUENCE; PARTIAL ORDER;

GENES;

EID: 26844433590     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_8     Document Type: Conference Paper

References (5)

1. Bader, D. A., Bernard M.E. Moret, B. M. E. and Yan, M. 2001. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology 8, 483-91.
2. Hannenhalli, S. and Pevzner, P.A. 1995. Transforming men into mice (polynomial algorithm for genomic distance problem. Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science. 581-92.
3. Hannenhalli, S. and Pevzner, P.A. 1999. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM 48, 1-27.
4. Tesler, G. 2002. Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65, 587-609.
5. Zheng, C., Lenert, A. and Sankoff, D. 2005. Reversal distance for partially ordered genomes. Bioinformatics 21, supplementary issue, Proceedings of ISMB 2005.