- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
CreatingPhylogenic Language Trees.ppt
CreatingPhylogenic Language Trees Michele Fretta Saint Michael’s College Colchester, Vermont Phylogenic Trees Trees are a useful way to visualize the connections between things. The methods we will use here are often used in biological genetics. Language Trees We will construct tree graphs which model the relationships between the words of 12 languages. Warning! The trees in this presentation are examples only. The data they are based on is not statistically significant. In (language) trees, it is assumed that a genetic relationship implies an evolutionary relationship Suppose we have data of words from several different languages. How can we use the data to construct a visual representation of the relationships among them (i.e., a tree)? Branch and Bound Method Sample Cognate Table Cognates are words in two different languages which have similar sound and meaning. Cognate Matrix Sample “1” indicates that there is a cognate between the two languages “0” indicates that there is no cognate. Pair-wise Percentage Similarity Then, we use the cognate matrices to find the percentage of similarity between each pair of languages. Group and average. Building the tree, group by group Kruskal’s Algorithm Method Parsimony trees are based on the assumption that the least number of evolutionary steps is the most likely. We will construct a graph which represents all possible language relationships, And we will use a greedy algorithm in order to find the shortest (most likely) relationships. Pair-wise Cognate Percentages Begin with our matrix of cognate percentages: The Complete Graph Implementing Kruskal’s Algorithm Our Minimum Spanning Tree Modifying the Tree Remember the tree with Latin? Latin is an internal vertex because it is an ancestor. Some of the vertices in our minimal spanning tree are internal vertices, but we want them all to be leaves This is because leaves will represent present-day languages, which we are working with in this case. Modifying the Tree
您可能关注的文档
- Assessing the Impact of Candidate Gene Variation on Quanti.ppt
- AuthorWANG Yong-gui, JIA ZhenDept of Software Liaoning .ppt
- Bayesian Network.ppt
- BPenglish.ppt
- Chapter 04.ppt
- Chapter 14.ppt
- Chapter 19 Industrial environmental management and .ppt
- Chapter 4.ppt
- Chapter 6 Securities law.ppt
- Chapter 7 电子商业的导向-顾客关系管理与资料探勘.ppt
- C语言综合编程训练.ppt
- DEV200 .NET Framework概述张炜 weizha@microsoft..ppt
- Discrete mathematics Discrete i.e. no continuousSet theory, .ppt
- DNA Technology Revolution in Evolution.ppt
- eGov_Project_Case_StudyDurban05.ppt
- ErrCorrection-ICUDL.ppt
- Evaluating IR systemssearch engines.ppt
- Experience of Rabobank.ppt
- Form One.ppt
- Free Powerpoint Templates.ppt
文档评论(0)