Lower bounds for maximum parsimony with gene order data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3678 LNBI, Issue , 2005, Pages 1-10

  Bachrach, Abraham ^a   Chen, Kevin ^a   Harrelson, Chris ^a   Mihaescu, Radu ^a   Rao, Satish ^a   Shah, Apurva ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; GENE ORDER DATA; HEURISTIC APPROXIMATIONS; TIME DYNAMIC PROGRAMMING ALGORITHMS;

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; LINEAR PROGRAMMING; PROGRAMMING THEORY; TRAVELING SALESMAN PROBLEM;

BOUNDARY VALUE PROBLEMS;

EID: 33646148032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554714_1     Document Type: Conference Paper

References (19)

1. B. Moret, S. Wyman, D. Bader, T. Warnow, and M. Yan. A new implementation and detailed study of breakpoint analysis. In PSMB, 2001.
2. D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol., 5(3):555-570, 1998.
3. G. Bourque and P. Pevzner. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res., 12(1):26-36, 2002.
4. D. Bryant. A lower bound for the breakpoint phylogeny problem. Journal of Discrete Algorithms, 2:229-255, 2004.
5. P. Purdom, P. Bradford, K. Tamura, and S. Kumar. Single column discrepency and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees. Bioinformatics, 16(2):140-151, 2000.
6. B. Holland, K. Huber, D. Penny, and V. Moulton. The minmax squeeze: Guarenteeing a minimal tree for population data. Mol, Biol. and Evol., 22(2):235-242, 2005.
7. J. Tang. A study of bounding methods for reconstructing phylogenies from gene-order data. PhD Thesis, 2003.
8. J. Tang, B. Moret, L. Cui, and C. dePamphilis. Phylogenetic reconstruction from arbitrary gene-order data. In BIBE, 2004.
9. J. Tang and B. Moret. Linear programming for phylogenetic reconstruction based on gene rearrangements. In CPM, 2005.
10. B. Moret, J. Tang, and T. Warnow. Reconstructing phylogenies from gene-content and gene-order data. In O Gascuel, editor, Mathematics of Evolution and Phylogeny. Oxford Univ. Press, 2004.
11. K. Chaudhuri, K. Chen, R. Mihaescu, and S. Rao. On the tandem duplication-random loss model of genome rearrangement. In review.
12. M. Charikar, R. Motwani, P. Raghavan, and C. Silverstein. Constrained TSP and low power computing. In WADS, 1997.
13. B. Moret. Personal communication, 2005.
14. G. Lancia and R. Ravi. GESTALT: Genomic steiner alignments. In CPM, 1999.
15. N. Young. Sequential and parallel algorithms for mixed packing and covering. In FOCS, 2001.
16. P. Flajolet and A. M. Odlyzko. The average height of binary trees and other simple trees. J. Computer System Sci., 25:171-213, 1982.
17. Z. Bar-Joseph, E. D. Demaine, D. K. Gifford, A. M. Hamel, T. S. Jaakkola, et al. Kary clustering with optimal leaf ordering for gene expression data. Bioinformatics, 19(9):1070-1078, 2003.
18. R. E. Burkard, V. G. Deineko, and G. J. Woeginger. The travelling salesman and the pq-tree. Mathematics of Operations Research, 24:262-272, 1999.
19. M. Farach, S. Kannan, and T. Warnow. A robust model for finding optimal evolutionary trees. In STOC, 1993.