Phylogenetic reconstruction with gene rearrangements and gene losses

Proceedings - 2010 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2010

Volumn , Issue , 2010, Pages 35-38

  Zhang, Yiwei ^a   Hu, Fei ^a   Tang, Jijun ^a  

^a The Department of Mechanical Engineering   (United States)

Author keywords

Branch and bound; Gene loss; Genome rearrangement; Phylogeny

Indexed keywords

ANCESTRAL GENOMES; BRANCH AND BOUNDS; GENE CONTENT; GENE LOSS; GENE REARRANGEMENT; GENOME REARRANGEMENT; MEDIAN ALGORITHMS; MEDIAN PROBLEM; ORDER DATA; PHYLOGENETIC RECONSTRUCTION; PHYLOGENETIC TREES; PHYLOGENY; SIMULATED DATASETS; TRIANGLE INEQUALITY;

BIOINFORMATICS; BIOLOGY;

GENES;

EID: 79952412540     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBM.2010.5706531     Document Type: Conference Paper

References (6)

1. Caprara, A. (2003). The reversal median problem. INFORMS Journal on Computing, 15(1), 93-113.
2. El-Marbrouk, N. (2000). Genome rearrangement by reversals and insertions/deletions of contiguous segment. In Proc. 11th Ann. Symp. Combinational Pattern Matching, volume 1848 of Lecture Notes in Computer Science, 222-234.
3. Sankoff, D. and M. Blanchette (1998). Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5, 555-570. (Pubitemid 28436301)
4. Swenson, K., W. Arndt, J. Tang and B. More (2008). Phylogenetic reconstruction from complete gene orders of whole genomes. Sixth Asia Pacific Bioinformatics Conference (APBC 2008), in Advances in Bioinformatics and Computational Biology Vol. 6, 241-250.
5. Tang, J., B. Moret, L. Cui, and C. dePamphilis (2004) Phylogenetic reconstruction from arbitrary gene-order data. Proc. 4th IEEE Conf. on Bioinformatics and Bioengineering (BIBE 2004) 592-599.
6. Yancopoulos S., Attie O., and Friedberg R. (2005). Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21, 3340-3346. (Pubitemid 41222437)