Trees in the Presence of Polymorphic Characters
暂无分享,去创建一个
Maria Luisa Bonet | S. Yooseph | T. Warnow | M. L. Bonet | Cynthia Phillipst | C. Phillipst | Shibu Yooseph
[1] David Fernández-Baca,et al. Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs , 1996, Int. J. Found. Comput. Sci..
[2] R. Cann. The history and geography of human genes , 1995, The Journal of Asian Studies.
[3] Fred R. McMorris,et al. Triangulating vertex colored graphs , 1994, SODA '93.
[4] David Fernández-Baca,et al. A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[5] Tandy Warnow,et al. Constructing phylogenetic trees efficiently using compatibility criteria , 1993 .
[6] Alejandro A. Schäffer,et al. Triangulating Three-Colored Graphs in Linear Time and Linear Space , 1993, SIAM J. Discret. Math..
[7] Michael R. Fellows,et al. Two Strikes Against Perfect Phylogeny , 1992, ICALP.
[8] Mike Steel,et al. Convex tree realizations of partitions , 1992 .
[9] Ton Kloks,et al. A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs , 1992, J. Algorithms.
[10] Sampath Kannan,et al. Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[11] Masatoshi Nei,et al. Human Polymorphic Genes: World Distribution , 1988 .
[12] M. Nei. Molecular Evolutionary Genetics , 1987 .
[13] David S. Johnson,et al. The computational complexity of inferring rooted phylogenies by parsimony , 1986 .
[14] David Sankoff,et al. COMPUTATIONAL COMPLEXITY OF INFERRING PHYLOGENIES BY COMPATIBILITY , 1986 .
[15] Andrzej Proskurowski,et al. Separating subgraphs in k-trees: Cables and caterpillars , 1984, Discret. Math..
[16] W. H. Day. Computationally difficult parsimony problems in phylogenetic systematics , 1983 .
[17] Joseph Felsenstein,et al. Alternative Methods of Phylogenetic Inference and their Interrelationship , 1979 .
[18] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[19] G. Estabrook,et al. An idealized concept of the true cladistic character , 1975 .
[20] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..
[21] G. Estabrook,et al. Cladistic Methodology: A Discussion of the Theoretical Basis for the Induction of Evolutionary History , 1972 .
[22] Walter J. Lequesne. Further Studies Based on the Uniquely Derived Character Concept , 1972 .
[23] W. J. Quesne,et al. A Method of Selection of Characters in Numerical Taxonomy , 1969 .
[24] M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .
[25] Dan Gusfield,et al. Efficient algorithms for inferring evolutionary trees , 1991, Networks.
[26] D. Sankoff,et al. Locating the vertices of a Steiner tree in arbitrary space , 1975 .
[27] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.