Computing the reversal distance between genomes in the presence of multi-gene families via binary integer programming

Journal of Bioinformatics and Computational Biology

Volumn 5, Issue 1, 2007, Pages 117-133

  Suksawatchon, Jakkarin ^a,b   Lursinsap, Chidchanok ^a   Bodén, Mikael ^c  

^a CHULALONGKORN UNIVERSITY   (Thailand)

^b BURAPHA UNIVERSITY   (Thailand)

^c UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Binary integer programming; Gene duplication; Genome rearrangement; Multi gene families; Reversal distance

Indexed keywords

ACCURACY; ARTICLE; CONTROLLED STUDY; GENE DUPLICATION; GENE REARRANGEMENT; GENETIC ALGORITHM; GENETIC ANALYSIS; GENETIC DISTANCE; HUMAN; MATHEMATICAL ANALYSIS; MULTIGENE FAMILY; NONHUMAN; PROCESS DEVELOPMENT;

ALGORITHMS; BASE SEQUENCE; CHROMOSOME MAPPING; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; MODELS, GENETIC; MOLECULAR SEQUENCE DATA; MULTIGENE FAMILY; PROGRAMMING, LINEAR; SEQUENCE ANALYSIS, DNA;

EID: 34248184141     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720007002552     Document Type: Article

References (17)

1. Bafna V, Pevzner P, Genome rearrangements and sorting by reversals, in Proc 34th Ann IEEE Symp Foundations Comput Sci, pp. 148-157, 1993.
2. Hannenhalli S, Pevzner P, Transforming Cabbage Into Turnip, in Proc 27th Ann ACM-SIAM Symp Theory Comput, pp. 178-189, 1995.
3. El-Mabrouk N, Genome rearrangement by reversals and insertions/deletions of contiguous segments, in Proc 11th Ann Symp Combinatorial Pattern Matching (CPM'00), Lecture Notes Comput Sci 1848:222-234, 2000.
4. El-Mabrouk N, Reconstructing an ancestral genome using minimum segment duplications and reversals, J Comput Syst Sci 65:442-464, 2002.
5. Tannier E, Sagot M, Sorting by reversals in subquadratic time, in Proc 15th Ann Symp Combinatorial Pattern Matching, Lecture Notes Comput Sci (LNCS) 3109:1-13, 2004.
6. Bader D, Moret B, Yan M, A linear-time algorithm for computing inversion distance between signed permutations with an experimental study, Algorithms and Data Structures: Seventh International Workshop, WADS 2001, pp. 365-376, 2001.
7. Zhang J, Evolution by gene duplication: An update, TRENDS Ecol Evol 18(6):292-298, 2003.
8. Sankoff D, Genome rearrangement with gene families, Bioinformatics 15:909-917, 1999.
9. Bryant D, The complexity of calculating exemplar distances, Comparative Genom 207-212, 2000.
10. Thach Nguyen C, Tay YC, Zhang L, Divide-and-conquer approach for the exemplar breakpoint distance, Bioinformatics 21(10):2171-2176, 2005.
11. Joel V, Young E, Lerat E, Moret B, Reversing gene erosion-reconstructing ancestral bacteria genomes from gene content and order data, in Proc 4th Int Workshop Algorithms Bioinform WABI'04, Lecture Notes Comput Sci 3240:1-13, 2004.
12. Chen X et al., Assignment of orthologous genes via genome rearrangement, IEEE/ACM Trans on Comput Biol Bioinform 2(4):302-315, 2005.
13. Caprara A, On the practical solution of reversal median problem, in Proc Algorithm Bioinform WABI 2001 2149:238-251, 2001.
14. Mantin I, Shamir R, An algorithm for sorting signed permutations by reversal, (http://www.math.tau.ac.il/~rshamir/GR), 1999.
15. Hannenhalli S, Pevzner P, Transforming men into mice (polynomial algorithm for genomic distance problem), 36th Ann Symp Foundations Comput Sci, pp. 581-592, 1995.
16. Yancopoulos S, Attie O, Friedberg F, Efficient sorting of genomic permutations by translocation, inversion and block interchage, Bioinformatics 21(16):3340-3346, 2005.
17. Tesler G, Efficient algorithms for multichromosomal genome rearrangements, J Comput Syst Sci 65:587-609, 2002.