Computing the breakpoint distance between partially ordered genomes

Journal of Bioinformatics and Computational Biology

Volumn 5, Issue 5, 2007, Pages 1087-1101

  Fu, Zheng ^a   Jiang, Tao ^a  

^a University of California Riverside   (United States)

Author keywords

Breakpoint distance; Comparative genomics; Partially ordered genome

Indexed keywords

ARTICLE; BIOINFORMATICS; CONTROLLED STUDY; GENE MAPPING; GENE ORDER; GENETIC ALGORITHM; GENOMICS; HUMAN; LEARNING ALGORITHM; MOUSE; NONHUMAN; RAT; SIMULATION;

ALGORITHMS; ANIMALS; CHROMOSOME MAPPING; CHROMOSOMES, HUMAN, X; COMPUTATIONAL BIOLOGY; DATABASES, GENETIC; GENOME, HUMAN; GENOMICS; HUMANS; MICE; RATS; X CHROMOSOME;

EID: 35348918163     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720007003107     Document Type: Article

References (15)

1. Nadeau J, Taylor B, Lengths of chromosomal segments conserved since divergence of man and mouse, Proc Natl Acad Sci 81:814-818, 1984.
2. Watterson G, Ewens W, Hall T, Morgan A, The chromosome inversion problem, J Theor Biol 99:1-7, 1982.
3. Hannenhalli S, Pevzner P, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), Proc 27th Annu ACM Symp Theory Comput, pp. 178-187, 1995.
4. Sankoff D, Mechanisms of genome evolution: Models and inference, Bull Int Stat Inst 47:461-475, 1989.
5. Zheng C, Sankoff D, Genome rearrangements with partially ordered chromosomes, Proc COCOON, 2005.
6. Zheng C, Lenert A, Sankoff D, Reversal distance for partially-ordered genomes, Bioinformatics 21 (Suppl 1):i502-i508, 2005.
7. Ozery-Flato M, Shamir R, Partial order problem is NP-hard, unpublished manuscript, 2006.
8. Caprara A, Sorting by reversal is difficult, Proc 1st RECOMB pp. 75-83, 1997.
9. Even G, Naor J, Schieber B, Sudan M, Approximating minimum feedback sets and multi-cuts in directed graphs, Proc Int Conf Integer Programming Combin Optim, Lecture Notes in Computer Science, Vol. 920, Springer-Verlag, pp. 14-28, 1995.
10. Seymour PD, Packing directed circuits fractionally, Combinatorica 15:281-288, 1995.
11. Demetrescu C, Finocchi I, Combinatorial algorithms for feedback problems, Inform Process Lett 86(3):129-136, 2003.
12. Karolchik D, Baertsch R, Diekhans M et al., The UCSC Genome Browser Database, Nucleic Acids Res 31(1):51-54, 2003.
13. Polacco ML, Sandhez-Villeda H, Coe E, A consensus genetic map, intermated B73 × mo17 (IBM) neighbors, Maize Genet Coop New Lett 77:137-179, 2003.
14. Bowers JE, Abbey C, Anderson S et al., A high-density genetic recombination map of sequence-tagged sites for sorghum, as a framework for comparative structural and evolutionary genomics of tropical grains and grasses, Genetics 165:367-386, 2003.
15. Menz MA, Klein RR, Mullet JE, Obert JA, Unruh NC, Klein PE, A high-density genetic map of Sorghum bicolor (L.) Moench based on 2926 AFLP, RFLP and SSR markers, Plant Mol Biol 48:483-499, 2002.