Reconstructing the evolutionary history of natural languages
暂无分享,去创建一个
[1] Sampath Kannan,et al. A robust model for finding optimal evolutionary trees , 1993, Algorithmica.
[2] Amihood Amir,et al. Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms , 1997, SIAM J. Comput..
[3] Cynthia A. Phillips,et al. Constructing evolutionary trees in the presence of polymorphic characters , 1996, STOC '96.
[4] Cynthia A. Phillips,et al. The Asymmetric Median Tree - A New Model for Building Consensus Trees , 1996, Discret. Appl. Math..
[5] David Fernández-Baca,et al. Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs , 1996, Int. J. Found. Comput. Sci..
[6] Sampath Kannan,et al. A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed , 1995, SODA '95.
[7] Sampath Kannan,et al. Computing the local consensus of trees , 1995, SODA '95.
[8] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[9] Mikkel Thorup,et al. Fast comparison of evolutionary trees , 1994, SODA '94.
[10] Fred R. McMorris,et al. Triangulating vertex colored graphs , 1994, SODA '93.
[11] Tandy J. Warnow,et al. Tree compatibility and inferring evolutionary history , 1994, SODA '93.
[12] Tandy J. Warnow,et al. Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree , 1993, Inf. Process. Lett..
[13] J. Kruskal,et al. An Indoeuropean classification : a lexicostatistical experiment , 1992 .
[14] Michael R. Fellows,et al. Two Strikes Against Perfect Phylogeny , 1992, ICALP.
[15] Donald Arthur Ringe. On Calculating the Factor of Chance in Language Comparison , 1992 .
[16] M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .
[17] Donald A. Ringe join. On Calculating the Factor of Chance in Language Comparison , 1992 .
[18] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[19] Sampath Kannan,et al. Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[20] 10 Reconstructing Genetic and Linguistic Trees: Phenetic and Cladistic Approaches , 1987 .
[21] W. H. Day. Computational complexity of inferring phylogenies from dissimilarity matrices. , 1987, Bulletin of mathematical biology.
[22] David S. Johnson,et al. The computational complexity of inferring rooted phylogenies by parsimony , 1986 .
[23] David Sankoff,et al. COMPUTATIONAL COMPLEXITY OF INFERRING PHYLOGENIES BY COMPATIBILITY , 1986 .
[24] Sheila Embleton,et al. Statistics in historical linguistics , 1986 .
[25] W. H. Day. Optimal algorithms for comparing trees with labeled leaves , 1985 .
[26] W. H. Day. Computationally difficult parsimony problems in phylogenetic systematics , 1983 .
[27] J. Felsenstein. Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.
[28] R. Graham,et al. The steiner problem in phylogeny is NP-complete , 1982 .
[29] J. Tischler. Glottochronologie und Lexikostatistik , 1973 .
[30] H. Hoenigswald,et al. Indo-European and Indo-Europeans , 1971 .
[31] H. Hoenigswald,et al. Italie and Celtic Superlatives and the Dialects of Indo-European , 1970 .
[32] Isidore Dyen. The Lexicostatistically Determined Relationship of a Language Group , 1962, International Journal of American Linguistics.
[33] Henry M. Hoenigswald,et al. Language Change and Linguistic Reconstruction , 1960 .
[34] W. P. Lehmann,et al. Die Gliederung des indogermanischen Sprachgebiets , 1954 .
[35] E. H. Sturtevant,et al. A comparative grammar of the Hittite language , 1934 .
[36] A. Meillet,et al. La méthode comparative en linguistique historique , 1925 .