Convex recolorings of strings and trees: Definitions, hardness results and algorithms

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 218-232

  Moran, Shlomo ^a   Snir, Sagi ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COLOR; LINGUISTICS; MATHEMATICAL MODELS;

BOUNDED DEGREE TREES; CONVEX RECOLORINGS; PHYLOGENETICS; UNIFORM MODEL;

TREES (MATHEMATICS);

EID: 26844540454     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_20     Document Type: Conference Paper

References (17)

1. R. Agrawala and D. Fernandez-Baca. Simple algorithms for perfect phylogeny and triangulating colored graphs. International Journal of Foundations of Computer Science, 7(1):11-21, 1996.
2. A. Ben-Dor, N. Friedman, and Z. Yakhini. Class discovery in gene expression data. In RECOMB, pages 31-38, 2001.
3. M. Bittner and et.al. Molecular classification of cutaneous malignant melanoma by gene expression profiling. Nature, 406(6795):536-40, 2000.
4. H.L. Bodlaender, M.R. Fellows, and T. Warnow. Two strikes against perfect phylogeny. In ICALP, pages 273-283, 1992.
5. R. G. Downey and M. R. Fellows, newblock Parameterized Complexity. Springer, 1999.
6. A. Dress and M.A. Steel. Convex tree realizations of partitions. Applied Mathematics Letters, 5(3):3-6, 1992.
7. D. Fernndez-Baca and J. Lagergren. A polynomial-time algorithm for near-perfect phylogeny. SIAM Journal on Computing, 32(5):1115-1127, 2003.
8. W. M. Fitch. A non-sequential method for constructing trees and hierarchical classifications. Journal of Molecular Evolution, 18(1):30-37, 1981.
9. L.A. Goldberg, P.W. Goldberg, C.A. Phillips, Z Sweedyk, and T. Warnow. Minimizing phylogenetic number to find good evolutionary trees. Discrete Applied Mathematics, 71:111-136, 1996.
10. D. Gusfield. Efficient algorithms for inferring evolutionary history. Networks, 21:19-28, 1991.
11. A. Hirsh, A. Tsolaki, K. DeRiemer, M. Feldman, and P. Small. From the cover: Stable association between strains of mycobacterium tuberculosis and their human host populations. PNAS, 101:4871-4876, 2004.
12. S. Kannan and T. Warnow. Inferring evolutionary history from DNA sequences. SIAM J. Computing, 23(3):713-737, 1994.
13. S. Kannan and T. Warnow. A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. SIAM J. Computing, 26(6):1749-1763, 1997.
14. S. Moran and S. Snir. Convex recoloring of strings and trees. Technical Report CS-2003-13, Technion, November 2003.
15. D. Sankoff. Minimal mutation trees of sequences. SIAM Journal on Applied Mathematics, 28:35-42, 1975.
16. C. Semple and M.A. Steel. Phylogenetics. Oxford University Press, 2003.
17. M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9(1):91-116, 1992.