CINXE.COM

最大簡約法 - 维基百科,自由的百科全书

<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available" lang="zh" dir="ltr"> <head> <meta charset="UTF-8"> <title>最大簡約法 - 维基百科,自由的百科全书</title> <script>(function(){var className="client-js vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available";var cookie=document.cookie.match(/(?:^|; )zhwikimwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"zh", "wgMonthNames":["","1月","2月","3月","4月","5月","6月","7月","8月","9月","10月","11月","12月"],"wgRequestId":"5cf1bafe-3e3e-474b-85fc-a0706810ca19","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"最大簡約法","wgTitle":"最大簡約法","wgCurRevisionId":71375302,"wgRevisionId":71375302,"wgArticleId":667597,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["含有过时参数的引用的页面","含有英語的條目","有未列明来源语句的条目","生物信息學","系统发生学"],"wgPageViewLanguage":"zh","wgPageContentLanguage":"zh","wgPageContentModel":"wikitext","wgRelevantPageName":"最大簡約法","wgRelevantArticleId":667597,"wgUserVariant":"zh","wgIsProbablyEditable":true,"wgRelevantPageIsProbablyEditable":true,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgNoticeProject":"wikipedia","wgCiteReferencePreviewsActive":true, "wgMediaViewerOnClick":true,"wgMediaViewerEnabledByDefault":true,"wgPopupsFlags":0,"wgVisualEditor":{"pageLanguageCode":"zh","pageLanguageDir":"ltr","pageVariantFallbacks":["zh-hans","zh-hant","zh-cn","zh-tw","zh-hk","zh-sg","zh-mo","zh-my"]},"wgMFDisplayWikibaseDescriptions":{"search":true,"watchlist":true,"tagline":true,"nearby":true},"wgWMESchemaEditAttemptStepOversample":false,"wgWMEPageLength":30000,"wgRelatedArticlesCompat":[],"wgCentralAuthMobileDomain":false,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q1805805","wgCheckUserClientHintsHeadersJsApi":["brands","architecture","bitness","fullVersionList","mobile","model","platform","platformVersion"],"GEHomepageSuggestedEditsEnableTopics":true,"wgGETopicsMatchModeEnabled":false,"wgGEStructuredTaskRejectionReasonTextInputEnabled":false,"wgGELevelingUpEnabledForUser":false};RLSTATE={ "ext.gadget.large-font":"ready","ext.globalCssJs.user.styles":"ready","site.styles":"ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","ext.cite.styles":"ready","ext.math.styles":"ready","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready","jquery.makeCollapsible.styles":"ready","ext.wikimediamessages.styles":"ready","ext.visualEditor.desktopArticleTarget.noscript":"ready","ext.uls.interlanguage":"ready","wikibase.client.init":"ready","ext.wikimediaBadges":"ready"};RLPAGEMODULES=["ext.cite.ux-enhancements","mediawiki.page.media","site","mediawiki.page.ready","jquery.makeCollapsible","mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.gadget.edit0","ext.gadget.WikiMiniAtlas","ext.gadget.UnihanTooltips","ext.gadget.Difflink","ext.gadget.pseudonamespace-UI","ext.gadget.SpecialWikitext","ext.gadget.switcher","ext.gadget.VariantAlly", "ext.gadget.AdvancedSiteNotices","ext.gadget.hideConversionTab","ext.gadget.internalLinkHelper-altcolor","ext.gadget.noteTA","ext.gadget.NavFrame","ext.gadget.collapsibleTables","ext.gadget.scrollUpButton","ext.urlShortener.toolbar","ext.centralauth.centralautologin","mmv.bootstrap","ext.popups","ext.visualEditor.desktopArticleTarget.init","ext.visualEditor.targetLoader","ext.echo.centralauth","ext.eventLogging","ext.wikimediaEvents","ext.navigationTiming","ext.uls.interface","ext.cx.eventlogging.campaigns","ext.cx.uls.quick.actions","wikibase.client.vector-2022","ext.checkUser.clientHints","ext.growthExperiments.SuggestedEditSession","wikibase.sidebar.tracking"];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=zh&amp;modules=ext.cite.styles%7Cext.math.styles%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.wikimediaBadges%7Cext.wikimediamessages.styles%7Cjquery.makeCollapsible.styles%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&amp;only=styles&amp;skin=vector-2022"> <script async="" src="/w/load.php?lang=zh&amp;modules=startup&amp;only=scripts&amp;raw=1&amp;skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=zh&amp;modules=ext.gadget.large-font&amp;only=styles&amp;skin=vector-2022"> <link rel="stylesheet" href="/w/load.php?lang=zh&amp;modules=site.styles&amp;only=styles&amp;skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.4"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta name="viewport" content="width=1120"> <meta property="og:title" content="最大簡約法 - 维基百科,自由的百科全书"> <meta property="og:type" content="website"> <link rel="preconnect" href="//upload.wikimedia.org"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//zh.m.wikipedia.org/wiki/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" type="application/x-wiki" title="编辑本页" href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit"> <link rel="apple-touch-icon" href="/static/apple-touch/wikipedia.png"> <link rel="icon" href="/static/favicon/wikipedia.ico"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Wikipedia (zh)"> <link rel="EditURI" type="application/rsd+xml" href="//zh.wikipedia.org/w/api.php?action=rsd"> <link rel="canonical" href="https://zh.wikipedia.org/wiki/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh" href="https://zh.wikipedia.org/wiki/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hans" href="https://zh.wikipedia.org/zh-hans/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hans-CN" href="https://zh.wikipedia.org/zh-cn/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hans-MY" href="https://zh.wikipedia.org/zh-my/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hans-SG" href="https://zh.wikipedia.org/zh-sg/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hant" href="https://zh.wikipedia.org/zh-hant/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hant-HK" href="https://zh.wikipedia.org/zh-hk/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hant-MO" href="https://zh.wikipedia.org/zh-mo/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="zh-Hant-TW" href="https://zh.wikipedia.org/zh-tw/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="alternate" hreflang="x-default" href="https://zh.wikipedia.org/wiki/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"> <link rel="license" href="https://creativecommons.org/licenses/by-sa/4.0/deed.zh"> <link rel="alternate" type="application/atom+xml" title="Wikipedia的Atom feed" href="/w/index.php?title=Special:%E6%9C%80%E8%BF%91%E6%9B%B4%E6%94%B9&amp;feed=atom"> <link rel="dns-prefetch" href="//meta.wikimedia.org" /> <link rel="dns-prefetch" href="//login.wikimedia.org"> </head> <body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject mw-editable page-最大簡約法 rootpage-最大簡約法 skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">跳转到内容</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="站点"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="主菜单" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-menu mw-ui-icon-wikimedia-menu"></span> <span class="vector-dropdown-label-text">主菜单</span> </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">主菜单</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">移至侧栏</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">隐藏</button> </div> <div id="p-navigation" class="vector-menu mw-portlet mw-portlet-navigation" > <div class="vector-menu-heading"> 导航 </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-mainpage-description" class="mw-list-item"><a href="/wiki/Wikipedia:%E9%A6%96%E9%A1%B5" title="访问首页[z]" accesskey="z"><span>首页</span></a></li><li id="n-indexpage" class="mw-list-item"><a href="/wiki/Wikipedia:%E5%88%86%E7%B1%BB%E7%B4%A2%E5%BC%95" title="以分类索引搜寻中文维基百科"><span>分类索引</span></a></li><li id="n-Featured_content" class="mw-list-item"><a href="/wiki/Portal:%E7%89%B9%E8%89%B2%E5%85%A7%E5%AE%B9" title="查看中文维基百科的特色内容"><span>特色内容</span></a></li><li id="n-currentevents" class="mw-list-item"><a href="/wiki/Portal:%E6%96%B0%E8%81%9E%E5%8B%95%E6%85%8B" title="提供当前新闻事件的背景资料"><span>新闻动态</span></a></li><li id="n-recentchanges" class="mw-list-item"><a href="/wiki/Special:%E6%9C%80%E8%BF%91%E6%9B%B4%E6%94%B9" title="列出维基百科中的最近修改[r]" accesskey="r"><span>最近更改</span></a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:%E9%9A%8F%E6%9C%BA%E9%A1%B5%E9%9D%A2" title="随机载入一个页面[x]" accesskey="x"><span>随机条目</span></a></li> </ul> </div> </div> <div id="p-help" class="vector-menu mw-portlet mw-portlet-help" > <div class="vector-menu-heading"> 帮助 </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-help" class="mw-list-item"><a href="/wiki/Help:%E7%9B%AE%E5%BD%95" title="寻求帮助"><span>帮助</span></a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Wikipedia:%E7%A4%BE%E7%BE%A4%E9%A6%96%E9%A1%B5" title="关于本计划、你可以做什么、应该如何做"><span>维基社群</span></a></li><li id="n-policy" class="mw-list-item"><a href="/wiki/Wikipedia:%E6%96%B9%E9%87%9D%E8%88%87%E6%8C%87%E5%BC%95" title="查看维基百科的方针和指引"><span>方针与指引</span></a></li><li id="n-villagepump" class="mw-list-item"><a href="/wiki/Wikipedia:%E4%BA%92%E5%8A%A9%E5%AE%A2%E6%A0%88" title="参与维基百科社群的讨论"><span>互助客栈</span></a></li><li id="n-Information_desk" class="mw-list-item"><a href="/wiki/Wikipedia:%E7%9F%A5%E8%AF%86%E9%97%AE%E7%AD%94" title="解答任何与维基百科无关的问题的地方"><span>知识问答</span></a></li><li id="n-conversion" class="mw-list-item"><a href="/wiki/Wikipedia:%E5%AD%97%E8%AF%8D%E8%BD%AC%E6%8D%A2" title="提出字词转换请求"><span>字词转换</span></a></li><li id="n-IRC" class="mw-list-item"><a href="/wiki/Wikipedia:IRC%E8%81%8A%E5%A4%A9%E9%A2%91%E9%81%93"><span>IRC即时聊天</span></a></li><li id="n-contact" class="mw-list-item"><a href="/wiki/Wikipedia:%E8%81%94%E7%BB%9C%E6%88%91%E4%BB%AC" title="如何联络维基百科"><span>联络我们</span></a></li><li id="n-about" class="mw-list-item"><a href="/wiki/Wikipedia:%E5%85%B3%E4%BA%8E" title="查看维基百科的简介"><span>关于维基百科</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Wikipedia:%E9%A6%96%E9%A1%B5" class="mw-logo"> <img class="mw-logo-icon" src="/static/images/icons/wikipedia.png" alt="" aria-hidden="true" height="50" width="50"> <span class="mw-logo-container skin-invert"> <img class="mw-logo-wordmark" alt="维基百科" src="/static/images/mobile/copyright/wikipedia-wordmark-zh.svg" style="width: 6.5625em; height: 1.375em;"> <img class="mw-logo-tagline" alt="自由的百科全书" src="/static/images/mobile/copyright/wikipedia-tagline-zh.svg" width="103" height="14" style="width: 6.4375em; height: 0.875em;"> </span> </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Special:%E6%90%9C%E7%B4%A2" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="搜索维基百科[f]" accesskey="f"><span class="vector-icon mw-ui-icon-search mw-ui-icon-wikimedia-search"></span> <span>搜索</span> </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="搜索维基百科" aria-label="搜索维基百科" autocapitalize="sentences" title="搜索维基百科[f]" accesskey="f" id="searchInput" > <span class="cdx-text-input__icon cdx-text-input__start-icon"></span> </div> <input type="hidden" name="title" value="Special:搜索"> </div> <button class="cdx-button cdx-search-input__end-button">搜索</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="个人工具"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="外观"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="更改页面字体大小、宽度和颜色的外观" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="外观" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-appearance mw-ui-icon-wikimedia-appearance"></span> <span class="vector-dropdown-label-text">外观</span> </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="https://donate.wikimedia.org/?utm_source=donate&amp;utm_medium=sidebar&amp;utm_campaign=spontaneous&amp;uselang=zh-hans" class=""><span>资助维基百科</span></a> </li> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:%E5%88%9B%E5%BB%BA%E8%B4%A6%E6%88%B7&amp;returnto=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" title="我们推荐您创建账号并登录,但这不是强制性的" class=""><span>创建账号</span></a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:%E7%94%A8%E6%88%B7%E7%99%BB%E5%BD%95&amp;returnto=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" title="建议你登录,尽管并非必须。[o]" accesskey="o" class=""><span>登录</span></a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="更多选项" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="个人工具" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-ellipsis mw-ui-icon-wikimedia-ellipsis"></span> <span class="vector-dropdown-label-text">个人工具</span> </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="用户菜单" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport" class="user-links-collapsible-item mw-list-item"><a href="https://donate.wikimedia.org/?utm_source=donate&amp;utm_medium=sidebar&amp;utm_campaign=spontaneous&amp;uselang=zh-hans"><span>资助维基百科</span></a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:%E5%88%9B%E5%BB%BA%E8%B4%A6%E6%88%B7&amp;returnto=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" title="我们推荐您创建账号并登录,但这不是强制性的"><span class="vector-icon mw-ui-icon-userAdd mw-ui-icon-wikimedia-userAdd"></span> <span>创建账号</span></a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:%E7%94%A8%E6%88%B7%E7%99%BB%E5%BD%95&amp;returnto=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" title="建议你登录,尽管并非必须。[o]" accesskey="o"><span class="vector-icon mw-ui-icon-logIn mw-ui-icon-wikimedia-logIn"></span> <span>登录</span></a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> 未登录编辑者的页面 <a href="/wiki/Help:%E6%96%B0%E6%89%8B%E5%85%A5%E9%97%A8" aria-label="了解有关编辑的更多信息"><span>了解详情</span></a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Special:%E6%88%91%E7%9A%84%E8%B4%A1%E7%8C%AE" title="来自此IP地址的编辑列表[y]" accesskey="y"><span>贡献</span></a></li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Special:%E6%88%91%E7%9A%84%E8%AE%A8%E8%AE%BA%E9%A1%B5" title="对于来自此IP地址编辑的讨论[n]" accesskey="n"><span>讨论</span></a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"><!-- CentralNotice --></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="站点"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="目录" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">目录</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">移至侧栏</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">隐藏</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">序言</div> </a> </li> <li id="toc-發展歷史" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#發展歷史"> <div class="vector-toc-text"> <span class="vector-toc-numb">1</span> <span>發展歷史</span> </div> </a> <ul id="toc-發展歷史-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-理論背景" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#理論背景"> <div class="vector-toc-text"> <span class="vector-toc-numb">2</span> <span>理論背景</span> </div> </a> <ul id="toc-理論背景-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-特徵資料" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#特徵資料"> <div class="vector-toc-text"> <span class="vector-toc-numb">3</span> <span>特徵資料</span> </div> </a> <button aria-controls="toc-特徵資料-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> <span class="vector-icon mw-ui-icon-wikimedia-expand"></span> <span>开关特徵資料子章节</span> </button> <ul id="toc-特徵資料-sublist" class="vector-toc-list"> <li id="toc-無序與有序特徵" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#無序與有序特徵"> <div class="vector-toc-text"> <span class="vector-toc-numb">3.1</span> <span>無序與有序特徵</span> </div> </a> <ul id="toc-無序與有序特徵-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-特徵或狀態的權重" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#特徵或狀態的權重"> <div class="vector-toc-text"> <span class="vector-toc-numb">3.2</span> <span>特徵或狀態的權重</span> </div> </a> <ul id="toc-特徵或狀態的權重-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-未知狀態" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#未知狀態"> <div class="vector-toc-text"> <span class="vector-toc-numb">3.3</span> <span>未知狀態</span> </div> </a> <ul id="toc-未知狀態-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-類群的抽樣" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#類群的抽樣"> <div class="vector-toc-text"> <span class="vector-toc-numb">4</span> <span>類群的抽樣</span> </div> </a> <ul id="toc-類群的抽樣-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-分析方法" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#分析方法"> <div class="vector-toc-text"> <span class="vector-toc-numb">5</span> <span>分析方法</span> </div> </a> <button aria-controls="toc-分析方法-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> <span class="vector-icon mw-ui-icon-wikimedia-expand"></span> <span>开关分析方法子章节</span> </button> <ul id="toc-分析方法-sublist" class="vector-toc-list"> <li id="toc-演算法" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#演算法"> <div class="vector-toc-text"> <span class="vector-toc-numb">5.1</span> <span>演算法</span> </div> </a> <ul id="toc-演算法-sublist" class="vector-toc-list"> <li id="toc-Fitch演算法" class="vector-toc-list-item vector-toc-level-3"> <a class="vector-toc-link" href="#Fitch演算法"> <div class="vector-toc-text"> <span class="vector-toc-numb">5.1.1</span> <span>Fitch演算法</span> </div> </a> <ul id="toc-Fitch演算法-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-適合大規模類群的演算法" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#適合大規模類群的演算法"> <div class="vector-toc-text"> <span class="vector-toc-numb">5.2</span> <span>適合大規模類群的演算法</span> </div> </a> <ul id="toc-適合大規模類群的演算法-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-最大簡約法在親緣分析上的問題" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#最大簡約法在親緣分析上的問題"> <div class="vector-toc-text"> <span class="vector-toc-numb">6</span> <span>最大簡約法在親緣分析上的問題</span> </div> </a> <ul id="toc-最大簡約法在親緣分析上的問題-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-批評" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#批評"> <div class="vector-toc-text"> <span class="vector-toc-numb">7</span> <span>批評</span> </div> </a> <ul id="toc-批評-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-參見" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#參見"> <div class="vector-toc-text"> <span class="vector-toc-numb">8</span> <span>參見</span> </div> </a> <ul id="toc-參見-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-參考文獻" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#參考文獻"> <div class="vector-toc-text"> <span class="vector-toc-numb">9</span> <span>參考文獻</span> </div> </a> <ul id="toc-參考文獻-sublist" class="vector-toc-list"> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="目录" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="开关目录" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-listBullet mw-ui-icon-wikimedia-listBullet"></span> <span class="vector-dropdown-label-text">开关目录</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading"><span class="mw-page-title-main">最大簡約法</span></h1> <div id="p-lang-btn" class="vector-dropdown mw-portlet mw-portlet-lang" > <input type="checkbox" id="p-lang-btn-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-lang-btn" class="vector-dropdown-checkbox mw-interlanguage-selector" aria-label="前往另一种语言写成的文章。8种语言可用" > <label id="p-lang-btn-label" for="p-lang-btn-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--action-progressive mw-portlet-lang-heading-8" aria-hidden="true" ><span class="vector-icon mw-ui-icon-language-progressive mw-ui-icon-wikimedia-language-progressive"></span> <span class="vector-dropdown-label-text">8种语言</span> </label> <div class="vector-dropdown-content"> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-ca mw-list-item"><a href="https://ca.wikipedia.org/wiki/M%C3%A0xima_parsim%C3%B2nia" title="Màxima parsimònia – 加泰罗尼亚语" lang="ca" hreflang="ca" data-title="Màxima parsimònia" data-language-autonym="Català" data-language-local-name="加泰罗尼亚语" class="interlanguage-link-target"><span>Català</span></a></li><li class="interlanguage-link interwiki-de mw-list-item"><a href="https://de.wikipedia.org/wiki/Maximum_parsimony" title="Maximum parsimony – 德语" lang="de" hreflang="de" data-title="Maximum parsimony" data-language-autonym="Deutsch" data-language-local-name="德语" class="interlanguage-link-target"><span>Deutsch</span></a></li><li class="interlanguage-link interwiki-en mw-list-item"><a href="https://en.wikipedia.org/wiki/Maximum_parsimony_(phylogenetics)" title="Maximum parsimony (phylogenetics) – 英语" lang="en" hreflang="en" data-title="Maximum parsimony (phylogenetics)" data-language-autonym="English" data-language-local-name="英语" class="interlanguage-link-target"><span>English</span></a></li><li class="interlanguage-link interwiki-fa mw-list-item"><a href="https://fa.wikipedia.org/wiki/%D8%A8%DB%8C%D8%B4%D8%AA%D8%B1%DB%8C%D9%86_%D8%A8%D9%87%DB%8C%D9%86%DA%AF%DB%8C_(%D8%AA%D8%A8%D8%A7%D8%B1%D8%B2%D8%A7%DB%8C%DB%8C)" title="بیشترین بهینگی (تبارزایی) – 波斯语" lang="fa" hreflang="fa" data-title="بیشترین بهینگی (تبارزایی)" data-language-autonym="فارسی" data-language-local-name="波斯语" class="interlanguage-link-target"><span>فارسی</span></a></li><li class="interlanguage-link interwiki-fr mw-list-item"><a href="https://fr.wikipedia.org/wiki/Maximum_de_parcimonie" title="Maximum de parcimonie – 法语" lang="fr" hreflang="fr" data-title="Maximum de parcimonie" data-language-autonym="Français" data-language-local-name="法语" class="interlanguage-link-target"><span>Français</span></a></li><li class="interlanguage-link interwiki-ja mw-list-item"><a href="https://ja.wikipedia.org/wiki/%E6%9C%80%E5%A4%A7%E7%AF%80%E7%B4%84%E6%B3%95" title="最大節約法 – 日语" lang="ja" hreflang="ja" data-title="最大節約法" data-language-autonym="日本語" data-language-local-name="日语" class="interlanguage-link-target"><span>日本語</span></a></li><li class="interlanguage-link interwiki-pl mw-list-item"><a href="https://pl.wikipedia.org/wiki/Metoda_najwi%C4%99kszej_parsymonii" title="Metoda największej parsymonii – 波兰语" lang="pl" hreflang="pl" data-title="Metoda największej parsymonii" data-language-autonym="Polski" data-language-local-name="波兰语" class="interlanguage-link-target"><span>Polski</span></a></li><li class="interlanguage-link interwiki-pt mw-list-item"><a href="https://pt.wikipedia.org/wiki/M%C3%A1xima_parcim%C3%B4nia" title="Máxima parcimônia – 葡萄牙语" lang="pt" hreflang="pt" data-title="Máxima parcimônia" data-language-autonym="Português" data-language-local-name="葡萄牙语" class="interlanguage-link-target"><span>Português</span></a></li> </ul> <div class="after-portlet after-portlet-lang"><span class="wb-langlinks-edit wb-langlinks-link"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q1805805#sitelinks-wikipedia" title="编辑跨语言链接" class="wbc-editpage">编辑链接</a></span></div> </div> </div> </div> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="命名空间"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-main" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" title="浏览条目正文[c]" accesskey="c"><span>条目</span></a></li><li id="ca-talk" class="vector-tab-noicon mw-list-item"><a href="/wiki/Talk:%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" rel="discussion" title="关于此页面的讨论[t]" accesskey="t"><span>讨论</span></a></li> </ul> </div> </div> <div id="vector-variants-dropdown" class="vector-dropdown " > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="更改语言变体" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">不转换</span> </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-varlang-0" class="selected ca-variants-zh mw-list-item"><a href="/zh/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh" hreflang="zh"><span>不转换</span></a></li><li id="ca-varlang-1" class="ca-variants-zh-Hans mw-list-item"><a href="/zh-hans/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hans" hreflang="zh-Hans"><span>简体</span></a></li><li id="ca-varlang-2" class="ca-variants-zh-Hant mw-list-item"><a href="/zh-hant/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hant" hreflang="zh-Hant"><span>繁體</span></a></li><li id="ca-varlang-3" class="ca-variants-zh-Hans-CN mw-list-item"><a href="/zh-cn/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hans-CN" hreflang="zh-Hans-CN"><span>大陆简体</span></a></li><li id="ca-varlang-4" class="ca-variants-zh-Hant-HK mw-list-item"><a href="/zh-hk/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hant-HK" hreflang="zh-Hant-HK"><span>香港繁體</span></a></li><li id="ca-varlang-5" class="ca-variants-zh-Hant-MO mw-list-item"><a href="/zh-mo/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hant-MO" hreflang="zh-Hant-MO"><span>澳門繁體</span></a></li><li id="ca-varlang-6" class="ca-variants-zh-Hans-MY mw-list-item"><a href="/zh-my/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hans-MY" hreflang="zh-Hans-MY"><span>大马简体</span></a></li><li id="ca-varlang-7" class="ca-variants-zh-Hans-SG mw-list-item"><a href="/zh-sg/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hans-SG" hreflang="zh-Hans-SG"><span>新加坡简体</span></a></li><li id="ca-varlang-8" class="ca-variants-zh-Hant-TW mw-list-item"><a href="/zh-tw/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" lang="zh-Hant-TW" hreflang="zh-Hant-TW"><span>臺灣正體</span></a></li> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="查看"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"><span>阅读</span></a></li><li id="ca-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit" title="编辑该页面[e]" accesskey="e"><span>编辑</span></a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=history" title="本页面的早前版本。[h]" accesskey="h"><span>查看历史</span></a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="页面工具"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="工具" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">工具</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">工具</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">移至侧栏</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">隐藏</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions emptyPortlet vector-has-collapsible-items" title="更多选项" > <div class="vector-menu-heading"> 操作 </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95"><span>阅读</span></a></li><li id="ca-more-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit" title="编辑该页面[e]" accesskey="e"><span>编辑</span></a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=history"><span>查看历史</span></a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> 常规 </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Special:%E9%93%BE%E5%85%A5%E9%A1%B5%E9%9D%A2/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" title="列出所有与本页相链的页面[j]" accesskey="j"><span>链入页面</span></a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:%E9%93%BE%E5%87%BA%E6%9B%B4%E6%94%B9/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95" rel="nofollow" title="页面链出所有页面的更改[k]" accesskey="k"><span>相关更改</span></a></li><li id="t-upload" class="mw-list-item"><a href="/wiki/Project:%E4%B8%8A%E4%BC%A0" title="上传图像或多媒体文件[u]" accesskey="u"><span>上传文件</span></a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Special:%E7%89%B9%E6%AE%8A%E9%A1%B5%E9%9D%A2" title="全部特殊页面的列表[q]" accesskey="q"><span>特殊页面</span></a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;oldid=71375302" title="此页面该修订版本的固定链接"><span>固定链接</span></a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=info" title="关于此页面的更多信息"><span>页面信息</span></a></li><li id="t-cite" class="mw-list-item"><a href="/w/index.php?title=Special:%E5%BC%95%E7%94%A8%E6%AD%A4%E9%A1%B5%E9%9D%A2&amp;page=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;id=71375302&amp;wpFormIdentifier=titleform" title="有关如何引用此页面的信息"><span>引用此页</span></a></li><li id="t-urlshortener" class="mw-list-item"><a href="/w/index.php?title=Special:URL%E7%BC%A9%E7%9F%AD%E7%A8%8B%E5%BA%8F&amp;url=https%3A%2F%2Fzh.wikipedia.org%2Fwiki%2F%25E6%259C%2580%25E5%25A4%25A7%25E7%25B0%25A1%25E7%25B4%2584%25E6%25B3%2595"><span>获取短链接</span></a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Special:QrCode&amp;url=https%3A%2F%2Fzh.wikipedia.org%2Fwiki%2F%25E6%259C%2580%25E5%25A4%25A7%25E7%25B0%25A1%25E7%25B4%2584%25E6%25B3%2595"><span>下载二维码</span></a></li> </ul> </div> </div> <div id="p-electronpdfservice-sidebar-portlet-heading" class="vector-menu mw-portlet mw-portlet-electronpdfservice-sidebar-portlet-heading" > <div class="vector-menu-heading"> 打印/导出 </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="electron-print_pdf" class="mw-list-item"><a href="/w/index.php?title=Special:DownloadAsPdf&amp;page=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=show-download-screen"><span>下载为PDF</span></a></li><li id="t-print" class="mw-list-item"><a href="javascript:print();" rel="alternate" title="本页面的可打印版本[p]" accesskey="p"><span>打印页面</span></a></li> </ul> </div> </div> <div id="p-wikibase-otherprojects" class="vector-menu mw-portlet mw-portlet-wikibase-otherprojects" > <div class="vector-menu-heading"> 在其他项目中 </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q1805805" title="链接到连接的数据仓库项目[g]" accesskey="g"><span>维基数据项目</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="页面工具"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="外观"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">外观</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">移至侧栏</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">隐藏</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <div class="mw-indicators"> </div> <div id="siteSub" class="noprint">维基百科,自由的百科全书</div> </div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <div id="mw-content-text" class="mw-body-content"><div class="mw-content-ltr mw-parser-output" lang="zh" dir="ltr"><p><b>最大簡約法</b>(英語:<span lang="en"><b>Maximum parsimony</b></span>)是一種常使用於<a href="/wiki/%E7%B3%BB%E7%B5%B1%E7%99%BC%E7%94%9F%E5%AD%B8" class="mw-redirect" title="系統發生學">系統發生學</a>計算的方式,可用來根據分子序列的變異程度,來分析<a href="/wiki/%E7%94%9F%E7%89%A9" title="生物">生物</a>之間的<a href="/wiki/%E6%BC%94%E5%8C%96" title="演化">演化</a>關係,進而建構出<a href="/wiki/%E6%BC%94%E5%8C%96%E6%A8%B9" class="mw-redirect" title="演化樹">演化樹</a>。 </p><p>「簡約」一般有「經濟的」或「儉省的」之義,但在生物學中,「簡約法」是屬於<a href="/wiki/%E7%84%A1%E6%AF%8D%E6%95%B8%E7%B5%B1%E8%A8%88" title="無母數統計">無母數統計</a>的一種統計方法以估計<a href="/w/index.php?title=%E8%A6%AA%E7%B7%A3%E9%97%9C%E4%BF%82&amp;action=edit&amp;redlink=1" class="new" title="親緣關係(页面不存在)">親緣關係</a>。以最大簡約法建構的親緣關係樹是以演化過程具有最少次變化為前提,表示現存資料在過去的演化過程應由最少次步驟所形成。這項概念由<a href="/w/index.php?title=Walter_M._Fitch&amp;action=edit&amp;redlink=1" class="new" title="Walter M. Fitch(页面不存在)">Walter M. Fitch</a>在1971年所提出。<sup id="cite_ref-Fitch_1-0" class="reference"><a href="#cite_note-Fitch-1"><span class="cite-bracket">&#91;</span>1<span class="cite-bracket">&#93;</span></a></sup>. </p><p>雖然演化過程並非必定由最少次步驟所形成,但普遍上認為較簡約的步驟比起較繁複的步驟在演化過程中更容易發生。因此,「簡約」的概念仍是建構親緣關係的重要標準。<sup id="cite_ref-logic_2-0" class="reference"><a href="#cite_note-logic-2"><span class="cite-bracket">&#91;</span>2<span class="cite-bracket">&#93;</span></a></sup> </p><p>在最大簡約法的概念下,所需變化次數最少的一棵演化樹是最好的結果。不過由於<a href="/wiki/%E8%B6%A8%E5%90%8C%E6%BC%94%E5%8C%96" class="mw-redirect" title="趨同演化">趨同演化</a>現象的存在,最大簡約法有時會使得原本不同起源的生物被歸為相近生物。一般而言,最大簡約法較利於分析物種間關係較近時的情況。 </p> <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="發展歷史"><span id=".E7.99.BC.E5.B1.95.E6.AD.B7.E5.8F.B2"></span>發展歷史</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=1" title="编辑章节:發展歷史"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>於1950年代,<a href="/wiki/%E9%9B%BB%E5%AD%90%E8%A8%88%E7%AE%97%E6%A9%9F" class="mw-redirect" title="電子計算機">電子計算機</a>開始在學術界間流行,使得<a href="/wiki/%E7%94%9F%E7%89%A9%E5%AD%A6%E5%AE%B6" title="生物学家">生物學家</a>有機會利用電子計算機分析資料量龐大的<a href="/wiki/%E7%B3%BB%E7%B5%B1%E7%99%BC%E7%94%9F%E5%AD%B8" class="mw-redirect" title="系統發生學">系統發生學</a>問題。於1957年,兩位<a href="/wiki/%E6%98%86%E8%9F%B2%E5%AD%B8%E5%AE%B6" class="mw-redirect" title="昆蟲學家">昆蟲學家</a>,Charles D. Michener與Robert R. Sokal,所發發表的論文中以數學的角度討論如何對不同類別的生物進行<a href="/wiki/%E5%88%86%E9%A1%9E%E5%AD%B8" class="mw-redirect" title="分類學">分類學</a>工作,並跨及系統發生學的概念。<sup id="cite_ref-michener-and-sokal_3-0" class="reference"><a href="#cite_note-michener-and-sokal-3"><span class="cite-bracket">&#91;</span>3<span class="cite-bracket">&#93;</span></a></sup>隨後,Robert R. Sokal與Peter H. A. Sneath在1963年出版的著作《Principles of Numerical Taxonomy》中報導了多項分類學在數學上的分析方法及實例,並提出分類學應以系統發生學為基礎的概念。該著作亦被數學家、統計學家及精神測定學家視為重要學術基礎。在同一時代,<a href="/wiki/%E5%88%86%E5%AD%90%E7%94%9F%E7%89%A9%E5%AD%B8" class="mw-redirect" title="分子生物學">分子生物學</a>在方法上亦有重要發展,例如測定蛋白質序列,而提供了系統發生學者嶄新的分析材料來源。 </p><p>於1963年,Luigi L. Cavalli-Sforza與Anthony W. F. Edwards在研討會中首次以「parsimony」的字眼描述他們用來分析<a href="/wiki/%E4%BA%BA%E9%A1%9E" title="人類">人類</a>中不同族群的親緣關係,並在1965年的出版文章中以該親緣分析的結果繪製成人類不同族群的基因型在世界地圖上分化的路徑。<sup id="cite_ref-4" class="reference"><a href="#cite_note-4"><span class="cite-bracket">&#91;</span>4<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-5" class="reference"><a href="#cite_note-5"><span class="cite-bracket">&#91;</span>5<span class="cite-bracket">&#93;</span></a></sup>然而,這些文章雖引出簡約法的概念,並沒有提出簡約法的<a href="/wiki/%E6%BC%94%E7%AE%97%E6%B3%95" class="mw-redirect" title="演算法">演算方式</a>。 </p><p>Joseph Camin與Robert R. Sokal於1965年發表的文章中首次報導基於簡約法的演算法。<sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">&#91;</span>6<span class="cite-bracket">&#93;</span></a></sup>在這篇文章中,作者們明確指出簡約法的意涵: </p> <table class="cquote pullquote" role="presentation" style="margin:auto; display:table; border-collapse: collapse; border: none; background-color: transparent; color: inherit;width: auto;"> <tbody><tr> <td class="skin-invert" style="width: 20px; vertical-align: top; border: none; color: #B2B7F2; font-size: 40px; font-family: &#39;Times New Roman&#39;, Times, serif; font-weight: bold; line-height: .6em; text-align: left; padding: 10px; text-orientation: upright">“ </td> <td style="vertical-align: top; border: none; padding: 4px 10px;">……我們提出此研究方法的正確性的依據是:大自然確實是以簡約為前提……(<span lang="en">... the correctness of our approach depends on the assumption that nature is, indeed, parsimounious,...</span>) </td> <td class="skin-invert" style="width: 20px; vertical-align: bottom; border: none; color: #B2B7F2; font-size: 40px; font-family: &#39;Times New Roman&#39;, Times, serif; font-weight: bold; line-height: .6em; text-align: right; padding: 10px; text-orientation: upright">” </td></tr> </tbody></table> <p>隨後,Roland Bartcher於1966年以<a href="/wiki/FORTRAN" class="mw-redirect" title="FORTRAN">FORTRAN</a>程式語言實作了此演算法。<sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">&#91;</span>7<span class="cite-bracket">&#93;</span></a></sup>至1966年,R. V. Eck與M. O. Dayhoff的著作中報導了針對<a href="/wiki/%E8%9B%8B%E7%99%BD%E8%B3%AA" class="mw-redirect" title="蛋白質">蛋白質</a>的<a href="/wiki/%E8%83%BA%E5%9F%BA%E9%85%B8" class="mw-redirect" title="胺基酸">胺基酸</a>序列為對象的簡約法演算法。<sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">&#91;</span>8<span class="cite-bracket">&#93;</span></a></sup>。 </p><p>簡約法的概念及其演算法雖然在1957至1966年被多位學者提出,但造成普及是源自Walter M. Fitch與Emanuel Margoliash在1967年所發表的文章。<sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">&#91;</span>9<span class="cite-bracket">&#93;</span></a></sup>該文章中引入了<a href="/wiki/%E6%9D%83%E9%87%8D" title="权重">權重</a>及<a href="/w/index.php?title=%E5%88%86%E5%AD%90%E6%99%82%E9%90%98&amp;action=edit&amp;redlink=1" class="new" title="分子時鐘(页面不存在)">分子時鐘</a>的概念。隨後,Walter M. Fitch發表了針對<a href="/wiki/DNA" class="mw-redirect" title="DNA">DNA</a>序列的演算法,成為最著名的演算法。<sup id="cite_ref-logic_2-1" class="reference"><a href="#cite_note-logic-2"><span class="cite-bracket">&#91;</span>2<span class="cite-bracket">&#93;</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="理論背景"><span id=".E7.90.86.E8.AB.96.E8.83.8C.E6.99.AF"></span>理論背景</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=2" title="编辑章节:理論背景"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>簡約法利用<a href="/wiki/%E7%B3%BB%E7%B5%B1%E7%99%BC%E7%94%9F%E5%AD%B8" class="mw-redirect" title="系統發生學">系統發生學</a>上的<a href="/wiki/%E9%9B%A2%E6%95%A3" class="mw-disambig" title="離散">離散資料</a>作為特徵所構成的<a href="/wiki/%E7%9F%A9%E9%99%A3" class="mw-redirect" title="矩陣">矩陣</a>估計一個或多個最佳的<a href="/wiki/%E7%B3%BB%E7%B5%B1%E7%99%BC%E7%94%9F%E6%A8%B9" title="系統發生樹">系統發生樹</a>,而這些資料來源可能是有遺傳關係的多個<a href="/wiki/%E7%89%A9%E7%A8%AE" class="mw-redirect" title="物種">物種</a>或多個<a href="/wiki/%E7%A8%AE%E7%BE%A4" class="mw-redirect" title="種群">族群</a>,之後最大簡約法在可能的親緣樹中挑選需最少步驟可形成者,視為最佳的親緣關係樹。最大簡約法可使用於分析大多數的系統發生資料,但在近年由於其它方法的興起,目前較常使用於<a href="/wiki/%E5%BD%A2%E6%85%8B%E5%AD%B8_(%E7%94%9F%E7%89%A9%E5%AD%B8)" class="mw-redirect" title="形態學 (生物學)">形態</a>資料而非核酸或蛋白質與分子序列資料。 </p><p>估計系統發生樹並不是一件簡單的事。在給定一群分類群之後則可產生非常多種系統發生樹,例如,10個物種按排列可以構成超過2,000,000種<a href="/w/index.php?title=%E7%84%A1%E6%A0%B9%E6%A8%B9&amp;action=edit&amp;redlink=1" class="new" title="無根樹(页面不存在)">無根樹</a>。在諸多可能的親緣樹中,必須藉由特定標準以選出與資料最相符者。然而,資料往往並不能由簡單的演算法所分析。理想上預期某個演化特徵(例如<a href="/wiki/%E8%A1%A8%E5%9E%8B" class="mw-redirect" title="表型">表型</a>或<a href="/wiki/%E7%AD%89%E4%BD%8D%E5%9F%BA%E5%9B%A0" title="等位基因">等位基因</a>)在演化中勢必經歷呈由一分二、由二分四的過程,所以可以推論共享有相同特徵的分類群之親緣關係較相近,而與不具有此特徵的分類群之親緣關係較遠(在該特徵並不存在於共同祖先的前提下;即<span class="ilh-all" data-orig-title="Symplesiomorphy" data-lang-code="en" data-lang-name="英语" data-foreign-title="Symplesiomorphy"><span class="ilh-page"><a href="/w/index.php?title=Symplesiomorphy&amp;action=edit&amp;redlink=1" class="new" title="Symplesiomorphy(页面不存在)">Symplesiomorphy</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Symplesiomorphy" class="extiw" title="en:Symplesiomorphy"><span lang="en" dir="auto">Symplesiomorphy</span></a></span>)</span></span>)。在這個概念下,我們可以預期蝙蝠與猴的親緣關係較近而蝙蝠與魚則較遠,因為蝙蝠與猴共享有體毛的相同特徵。然而,我們並不能說蝙蝠與猴的親緣關係較近而蝙蝠與鯨魚則較遠,因為我們以三者的共同祖先具有體毛特徵為前提。 </p><p>然而,演化過程有諸多現象,包括<a href="/wiki/%E8%B6%A8%E5%90%8C%E6%BC%94%E5%8C%96" class="mw-redirect" title="趨同演化">趨同演化</a>、<a href="/wiki/%E5%B9%B3%E8%A1%8C%E6%BC%94%E5%8C%96" title="平行演化">平行演化</a>與<a href="/w/index.php?title=%E7%A5%96%E5%BE%B5%E9%87%8D%E7%8F%BE&amp;action=edit&amp;redlink=1" class="new" title="祖徵重現(页面不存在)">祖徵重現</a>(<span lang="en">evolutionary reversal</span>),也就是多個非同源物種發生相同特徵(<span lang="en">homoplasy</span>)的現象,使得以上述概念估計親緣關係樹時發生偏差。由於諸多原因,二個物種可能發生相同特徵但並非源自於他們的共同祖先。假如我們視這項相同特徵為二物種關係相近的證據,則會重建一個錯誤的親緣關係樹。此外,具有趨同特徵的親緣資料可能因取用不同部份資料進行分析而估計出結果非常不同的親緣關係樹。因此,估計親緣關係樹的方法必須藉由選取最符合所有資料的親緣關係樹以解決上述衝突(即使有少部份資料仍支持錯誤結論)。簡約法常被錯誤地以「趨同並不常發生」為前題。事實上,趨同演化所產生的特徵在最大簡約法上仍有分析價值,而普遍存在的趨同特徵並不能系統性地影響以簡約法為基礎的分析結果。 <sup id="cite_ref-10" class="reference"><a href="#cite_note-10"><span class="cite-bracket">&#91;</span>10<span class="cite-bracket">&#93;</span></a></sup> </p><p>與親緣關係樹不相符的資料並不能簡單地視為「雜訊」,而可能在親緣關係樹的某些部份提供了親緣關係之訊號。在上述蝙蝠、猴與鯨魚的例子中,不具有體毛特徵的鯨魚反應出哺乳動物始祖可能不具有體毛(即<span lang="en">homoplastic</span>)。這暗示著體毛這項特徵可能在蝙蝠與猴的共同祖先發生,但鯨魚的祖先早在體毛特徵發生之前即分化至其它支系。然而,<a href="/wiki/%E9%AF%A8%E7%9B%AE" class="mw-redirect" title="鯨目">鯨目</a>的物種在演化史上確實失去體毛而非直接繼承自無體毛的祖先。究竟如何決定最佳的親緣關係樹,包括找出與親緣關係樹不相符的資料,是一項複雜的過程。最大簡約法即是被設計成解決這項困難的研究方法。 </p> <div class="mw-heading mw-heading2"><h2 id="特徵資料"><span id=".E7.89.B9.E5.BE.B5.E8.B3.87.E6.96.99"></span>特徵資料</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=3" title="编辑章节:特徵資料"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>最大簡約法所需要輸入的資料是多個分類群或族群的「特徵」。雖然對親緣特徵並沒有絕對的定義,但實務上常以某項屬性作為特徵,例如動物的體長。屬性可以是與<a href="/wiki/%E5%BD%A2%E6%85%8B%E5%AD%B8_(%E7%94%9F%E7%89%A9%E5%AD%B8)" class="mw-redirect" title="形態學 (生物學)">形態</a>、<a href="/wiki/%E5%88%86%E5%AD%90" title="分子">分子</a>、<a href="/wiki/%E9%81%BA%E5%82%B3" title="遺傳">遺傳</a>、<a href="/wiki/%E7%94%9F%E7%90%86" class="mw-redirect" title="生理">生理</a>或<a href="/wiki/%E8%A1%8C%E7%82%BA" title="行為">動物行為學</a>相關的,但以能夠呈現<a href="/wiki/%E5%9F%BA%E5%9B%A0%E5%9E%8B" title="基因型">遺傳變異</a>為原則。至於選用的屬性是否可被直接遺傳(如<a href="/wiki/%E5%9F%BA%E5%9B%A0" title="基因">基因</a>)或被間接遺傳(如<a href="/wiki/%E8%A1%8C%E7%82%BA" title="行為">動物行為學</a>)則尚無定論。 </p><p>每一項特徵必須被分類為<a href="/wiki/%E9%9B%A2%E6%95%A3" class="mw-disambig" title="離散">離散</a>的變數,稱為<a href="/w/index.php?title=%E7%89%B9%E5%BE%B5%E7%8B%80%E6%85%8B&amp;action=edit&amp;redlink=1" class="new" title="特徵狀態(页面不存在)">特徵狀態</a>。特徵狀態經常以描述詞呈現,例如「眼睛顏色」這項特徵的特徵狀態可以是「藍色」及「棕色」等描述詞。特徵可以具有二種以上的狀態。僅具有一種狀態的特徵因為缺乏呈現變異的資訊,所以在最大簡約法並沒有功用且常被事先排除。 </p><p>對特徵賦予某個狀態在系統發生分析上並不是絕對科學的,並且常常具有爭議。例如在上述眼睛顏色的例子中,如何明確地賦予某個體具有「淡褐色」眼睛的特徵狀態是不確定的:應分類作淡褐色、綠色或藍色?在通常情況下,相似特徵被賦予相同的特徵狀態,所以可以將淡褐色與綠色賦予相同狀態(因為二者皆為淺色),或是採用更多的狀態來同時描述同一個特徵。由此可知,對特徵賦予某個狀態可能模凌兩可而存在爭議。 </p><p>這些模凌兩可的特徵狀態是造成使用特徵資料進行系統分類分析發生錯誤的主要原因。在上述眼睛顏色的例子中,「有無眼睛」也是一個可能的特徵,但不具有眼睛的個體即無法被賦予「眼睛顏色」的狀態而造成空缺值。在這種情況下,實務上使用「<code>?</code>」、「<code>X</code>」或「<code>-</code>」等符號以表示未知的特徵狀態。目前最大簡約法將這些未知的特徵狀態的發生原因一律視為「對分析不具特定效果」,也就是說,分析過程對於某個「<code>?</code>」資料視為基於最大簡約下最可能的某一項狀態。 </p><p>遺傳資料,例如核酸或蛋白質序列,對這些基於特徵的系統分析方法(包括最大概似法)是合適的,因為核酸或蛋白質序列本身即為離散資料。例如在<a href="/wiki/%E6%A0%B8%E9%85%B8%E5%BA%8F%E5%88%97" title="核酸序列">核酸序列</a>中,特定位點只可能是<a href="/wiki/%E8%85%BA%E5%98%8C%E5%91%A4" title="腺嘌呤">腺嘌呤</a>、<a href="/wiki/%E8%83%9E%E5%98%A7%E5%95%B6" title="胞嘧啶">胞嘧啶</a>、<a href="/wiki/%E9%B3%A5%E5%98%8C%E5%91%A4" title="鳥嘌呤">鳥嘌呤</a>、<a href="/wiki/%E8%83%B8%E8%85%BA%E5%98%A7%E5%95%B6" title="胸腺嘧啶">胸腺嘧啶</a>、<a href="/wiki/%E5%B0%BF%E5%98%A7%E5%95%B6" title="尿嘧啶">尿嘧啶</a>或排比後的<a href="/w/index.php?title=%E5%BA%8F%E5%88%97%E7%A9%BA%E7%BC%BA&amp;action=edit&amp;redlink=1" class="new" title="序列空缺(页面不存在)">序列空缺</a>(常記為「<code>-</code>」);例如在<a href="/wiki/%E8%9B%8B%E7%99%BD%E8%B4%A8%E5%BA%8F%E5%88%97" class="mw-redirect" title="蛋白质序列">蛋白質序列</a>中,每一個位點必為一個<a href="/wiki/%E6%A8%99%E6%BA%96%E6%B0%A8%E5%9F%BA%E9%85%B8%E5%88%97%E8%A1%A8" class="mw-redirect" title="標準氨基酸列表">基本胺基酸</a>或序列空缺。在這些情況下,對特徵賦予某個狀態幾乎沒有模凌兩可的可能情形,除非定序方法無法明確顯示何種狀態或序列排比存在爭議。序列空缺有時也被視為一種特徵,不過應對它賦予如何狀態則尚無共識。 </p> <div class="mw-heading mw-heading3"><h3 id="無序與有序特徵"><span id=".E7.84.A1.E5.BA.8F.E8.88.87.E6.9C.89.E5.BA.8F.E7.89.B9.E5.BE.B5"></span>無序與有序特徵</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=4" title="编辑章节:無序與有序特徵"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>特徵可以是無序或有序的。對二元特徵(如有或無)而言,無序或有序沒太大差別。對多狀態特徵而言,無序特徵可被視為「差異皆相等」,即在演化上狀態間轉換所需步驟數完全相同且不存在或不需要任何過渡狀態。對多狀態的有序特徵而言,狀態間轉換需要特定的過程且需要存在過渡狀態。換句話說,不同特定狀態間轉換所需要的步驟是不同的。如上述眼睛顏色的例子,若以無序特徵考量眼睛顏色這項特徵,則眼睛顏色在四種顏色間的轉換是相同距離的;若以有序特徵考量眼睛顏色特徵,則可能有「棕—淺褐—綠—藍」的順序,使得由棕色轉變至綠色有2個步驟而由棕色轉變至藍色有3個步驟,且淺褐色是棕色轉變至綠色的過渡狀態。 </p><p>對有序特徵賦予狀態是否有效或適當是存在爭議的。當狀態的順序存在明顯邏級、狀態的順序可在<a href="/wiki/%E5%80%8B%E9%AB%94%E7%99%BC%E7%94%9F%E5%AD%B8" title="個體發生學">個體發生學</a>上驗證、或存在演化過程的明顯趨勢時,對有序特徵賦予狀態是相對容易的。然而,有些專家拒絕對採用有序特徵,因為有序特徵乃基於不可能完全被驗證的演化歷史。 </p> <div class="mw-heading mw-heading3"><h3 id="特徵或狀態的權重"><span id=".E7.89.B9.E5.BE.B5.E6.88.96.E7.8B.80.E6.85.8B.E7.9A.84.E6.AC.8A.E9.87.8D"></span>特徵或狀態的權重</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=5" title="编辑章节:特徵或狀態的權重"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>特徵是可以被賦予不同的權重,使得在方法上認定某些特徵與真正的演化過程有較大或較小的關聯性。我們可以對在演化上容易反映演化歷史的特徵給予較大的權重而使該特徵轉換時需要更多的步驟。過去對特徵賦予不同的權重有許多討論。目前大多數人採用權重全相等(即放棄權重)的方式進行分析,但仍採用權重的情況仍十分常見。例如,<a href="/wiki/%E7%AD%89%E4%BD%8D%E5%9F%BA%E5%9B%A0%E9%A2%91%E7%8E%87" title="等位基因频率">等位基因频率</a>資料常是比例資料且被設定為低權重的有序資料。又例如核酸序列中的第三位鹼基由於多不影響對特定胺基酸的配對,所以容易形成中性的變異,故應給予較低的權重以免對估計真實的系統發生樹造成干擾。 </p><p>除了特徵間可賦予不同權重,同特徵內的不同狀態亦可賦予不同的權重。這種情況常發生在<a href="/wiki/%E6%A0%B8%E9%85%B8%E5%BA%8F%E5%88%97" title="核酸序列">核酸序列資料</a>上,因為核酸轉換機率並非全然相等。某些核酸轉換的機率較低(例如A-C、A-T、G-C、G-T等)故可賦予較高的權重以表示需較多的步驟方可產生這些變化。 </p> <div class="mw-heading mw-heading3"><h3 id="未知狀態"><span id=".E6.9C.AA.E7.9F.A5.E7.8B.80.E6.85.8B"></span>未知狀態</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=6" title="编辑章节:未知狀態"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>有些系統發生學者偏好保留大量的未知狀態(以「<code>?</code>」符號記)以表示無法得知狀態、懷疑狀態的真實性、或是視該特徵乃非同源物種的相同特徵(<span lang="en">homoplasy</span>)。理論上與模擬研究已指出這種保留大量未知狀態的方式並不能改善結果反而犧牲了分析的正確性。<style data-mw-deduplicate="TemplateStyles:r83946278">.mw-parser-output .template-facttext{background-color:var(--background-color-neutral,#eaecf0);color:inherit;margin:-.3em 0;padding:.3em 0}</style><sup class="noprint Template-Fact"><a href="/wiki/Wikipedia:%E5%88%97%E6%98%8E%E6%9D%A5%E6%BA%90" title="Wikipedia:列明来源"><span style="white-space: nowrap;" title="来源请求。">&#91;來源請求&#93;</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="類群的抽樣"><span id=".E9.A1.9E.E7.BE.A4.E7.9A.84.E6.8A.BD.E6.A8.A3"></span>類群的抽樣</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=7" title="编辑章节:類群的抽樣"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>簡約法分析(或任何親緣樹分析)所需要的時間與多少<a href="/wiki/%E5%88%86%E9%A1%9E%E5%96%AE%E5%85%83" title="分類單元">類群</a>被納入是呈比例關係的。此外,由於在分析中納入較多的類群必增加親緣關係樹的分支,故納入大量類群的分析將存在許多不確定性。由於收集資料有時間和金錢的限制,所以大多數的分析只採用某分類群內的部份可收集的子類群。事實上,某些學者主張僅納入4個類群(產生有意義之無根樹的最少類群數)即可達成一個正確的親緣分析,而納入越多的特徵比納入越多的類群更有價值。因此,納入多少類群作為分析資料仍未有共識且存在爭議。 </p><p>無論以實務、理論及模擬的角度切入,已有許多研究指出納入足夠的類群具有高度重要性。這些研究大多數可總結一個現象:系統分析資料是一個特徵數乘以類群數的矩陣,故增加一倍的類群數與增加一倍的特徵數對該矩陣大小的貢獻量是相同的。此外,增加一個類群即使每一個特徵皆納入一個新的樣本,但更重要的是,這通常也納入了特徵狀態的「組合」。這些特徵狀態的組合不僅可決定該類群應位於親緣樹的哪個分支,也可能因改變了對特徵變化的估計而修正原本存在類群之間的親緣關係。 </p><p>簡約法最大的弱點是容易產生<a href="/wiki/%E9%95%B7%E6%9E%9D%E5%90%B8%E5%BC%95%E6%95%88%E6%87%89" title="長枝吸引效應">長枝吸引效應</a>(<span lang="en">long-branch attraction</span>),而這經常在取樣的類群數不足之下發生(尤其是僅採用4個類群的情況下)。在這種情況下,僅藉由增加納入分析的特徵數量並無法有效地增加分析結果的正確性。若新納入分析的不是特徵而是類群,則往往可以去除長支吸引效應(尤其是化石資料)並有效地增加估計特徵在類群間的變化之正確性。由於目前已了解增加類群對分析具有重要的正向影響,採用數百個類群但僅納入千計的特徵仍可能產生正確性高的的分析結果。<link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r83946278"><sup class="noprint Template-Fact"><a href="/wiki/Wikipedia:%E5%88%97%E6%98%8E%E6%9D%A5%E6%BA%90" title="Wikipedia:列明来源"><span style="white-space: nowrap;" title="来源请求。">&#91;來源請求&#93;</span></a></sup> </p><p>雖然許多研究已指出增加類群數的重要性,但如何選擇採樣的策略仍需要更多研究。由於電腦的運算能力不斷進步以及<a href="/wiki/%E5%AE%9A%E5%BA%8F" class="mw-disambig" title="定序">定序</a>的成本降低,有越來越多的親緣分析納入以百計的類群,且納入的特徵數也持續增加。 </p> <div class="mw-heading mw-heading2"><h2 id="分析方法"><span id=".E5.88.86.E6.9E.90.E6.96.B9.E6.B3.95"></span>分析方法</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=8" title="编辑章节:分析方法"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Maximal_parsimony_unroot_tree.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/d/d1/Maximal_parsimony_unroot_tree.svg/220px-Maximal_parsimony_unroot_tree.svg.png" decoding="async" width="220" height="216" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/d/d1/Maximal_parsimony_unroot_tree.svg/330px-Maximal_parsimony_unroot_tree.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/d/d1/Maximal_parsimony_unroot_tree.svg/440px-Maximal_parsimony_unroot_tree.svg.png 2x" data-file-width="582" data-file-height="571" /></a><figcaption>最大簡約法挑選無根親緣樹的例子。在4個類群的資料可排列產生3個不同樹形的最大簡約無根樹,其中具有最少步驟的無根樹為最大簡約法所偏好。</figcaption></figure> <p>最大簡約法的概念非常直接:對所有可能的親緣關係樹計算其簡約程度(如特徵轉換的次數),並選取最簡約的樹(如特徵轉換的次數最少者)為最佳的親緣關係樹。 </p><p>親緣關係樹的簡約程度乃藉由一個簡單的<a href="/wiki/%E6%BC%94%E7%AE%97%E6%B3%95" class="mw-redirect" title="演算法">演算法</a>推估演化過程中特徵發生轉變的「步驟」。所謂一個步驟是指某個特徵的狀態發生轉變(即成為另一個狀態)。在有序特徵中,同一個特徵內的狀態發生變化可能包括多個步驟。無論如何,這些步驟的結果被視為可以解釋現有資料的特徵分布。簡單來說,我們認為現有資料的特徵是由演化過程中特徵轉變步驟的結果。按排列組合產生諸多不同樹型的可能親緣關係樹,並以演算法推估每種樹型中最簡約(即最少次狀態轉變)的特徵轉變歷史。最終,在諸多可能的親緣關係樹之中,最大簡約法所偏好的是具有最少步驟的親緣關係樹。 </p><p>簡約法分析基本上產生點估計,缺乏任何形式的<a href="/wiki/%E7%BD%AE%E4%BF%A1%E5%8C%BA%E9%97%B4" class="mw-redirect" title="置信区间">信賴區間</a>,這一點常被批評。已有幾種方法可以用來評估支持度。 </p><p><a class="external text" href="https://en.wikipedia.org/wiki/Resampling_(statistics)#Jackknife">刀切法</a> (<a rel="nofollow" class="external text" href="//web.archive.org/web/20210324224803/http://en.wikipedia.org/wiki/Resampling_(statistics)#Jackknife">页面存档备份</a>,存于<a href="/wiki/%E4%BA%92%E8%81%94%E7%BD%91%E6%A1%A3%E6%A1%88%E9%A6%86" title="互联网档案馆">互联网档案馆</a>)(<span lang="en">Jackknifing</span>)和<a href="/wiki/%E8%87%AA%E5%8A%A9%E6%B3%95" title="自助法">自助法</a>(<span lang="en">Bootstrapping</span>),為統計上重新抽樣的步驟,已被應用於簡約法分析。刀切法重新抽樣的過程採取抽後不放回(即抽樣對象最多只會被抽一次),抽樣對象可以是特徵或<a href="/wiki/%E5%88%86%E9%A1%9E%E5%96%AE%E5%85%83" title="分類單元">分類單元</a>。但如果抽樣對象為分類單元,之後的解釋會很複雜,因為我們感興趣的是樹形,而比較包含不同分類單元的樹的差異並不易懂。自助法採取抽後放回(即抽樣對象可被多次抽取),抽樣對象只有特徵,因為加入重複的分類單元至數據中並不會改變簡約法分析的結果。分析親緣關係時,自助法很常被使用。這兩種方法均可藉由大量重複抽樣的過程擾動原始數據。「自助百分比」(而非P值)用來評估支持度。 </p><p>另一種估計支持度的方法為<a href="/w/index.php?title=%E5%B8%83%E9%9B%B7%E9%BB%98%E7%88%BE%E6%94%AF%E6%8C%81%E5%BA%A6&amp;action=edit&amp;redlink=1" class="new" title="布雷默爾支持度(页面不存在)">布雷默爾支持度</a>(<span lang="en">Bremer support</span>),即<a href="/w/index.php?title=%E8%A1%B0%E9%80%80%E6%8C%87%E6%95%B8&amp;action=edit&amp;redlink=1" class="new" title="衰退指數(页面不存在)">衰退指數</a>(<span lang="en">decay index</span>)(嚴格而言它並非一個指數)。其值常常很低(典型上為1或2步),但常和自助支百分比成比例。然而,衰退指數的值並不易懂,且常被反對自助法的作者接受(雖然許多型態系統分類學家,尤其是古生物學家,常常兩種值皆發表)。 </p> <div class="mw-heading mw-heading3"><h3 id="演算法"><span id=".E6.BC.94.E7.AE.97.E6.B3.95"></span>演算法</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=9" title="编辑章节:演算法"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>藉由特定的演算法可以估計特徵轉變在親緣關係樹上的過程,其中最著名的是由<a href="/w/index.php?title=Walter_M._Fitch&amp;action=edit&amp;redlink=1" class="new" title="Walter M. Fitch(页面不存在)">Walter M. Fitch</a>所提出,但該演算法僅適用於較少類群之分析。大規模類群須藉由其它演算法,以僅計算部份可產生最大簡約程度之親緣關係樹的方式求解。 </p> <div class="mw-heading mw-heading4"><h4 id="Fitch演算法"><span id="Fitch.E6.BC.94.E7.AE.97.E6.B3.95"></span>Fitch演算法</h4><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=10" title="编辑章节:Fitch演算法"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Fitch_algorithm_rooted_tree.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/a/a2/Fitch_algorithm_rooted_tree.svg/220px-Fitch_algorithm_rooted_tree.svg.png" decoding="async" width="220" height="357" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/a/a2/Fitch_algorithm_rooted_tree.svg/330px-Fitch_algorithm_rooted_tree.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/a/a2/Fitch_algorithm_rooted_tree.svg/440px-Fitch_algorithm_rooted_tree.svg.png 2x" data-file-width="528" data-file-height="857" /></a><figcaption>以Fitch演算法計算有根樹的簡約程度之範例。</figcaption></figure> <p>Fitch演算法源自於<a href="/w/index.php?title=Walter_M._Fitch&amp;action=edit&amp;redlink=1" class="new" title="Walter M. Fitch(页面不存在)">Walter M. Fitch</a>在1971年所提出的概念,其內容是根據每個特定的特徵由現有二姊妹類群或支系之狀態以<a href="/wiki/%E4%BA%A4%E9%9B%86" title="交集">交集</a>的方式估計上游<a href="/wiki/%E7%AF%80%E9%BB%9E" class="mw-redirect mw-disambig" title="節點">節點</a>的可能狀態;若該交集為<a href="/wiki/%E7%A9%BA%E9%9B%86%E5%90%88" class="mw-redirect" title="空集合">空集合</a>則以<a href="/wiki/%E8%81%AF%E9%9B%86" class="mw-redirect" title="聯集">聯集</a>取代交集並累加簡約分數。<sup id="cite_ref-logic_2-2" class="reference"><a href="#cite_note-logic-2"><span class="cite-bracket">&#91;</span>2<span class="cite-bracket">&#93;</span></a></sup> </p><p>Fitch演算法可以一般化地表示成:在一個具有<i>n</i>個類群的親緣關係樹<i>T</i>中,某個特徵<i>c</i>具有<i>k</i>個可能狀態之,並將某節點<i>v</i>的狀態記為<i>c</i>(<i>v</i>),則對每個外部節點(即末端節點)的狀態之集合 </p> <dl><dd><i>S</i>(<i>v</i>) = {<i>c</i>(<i>v</i>)}</dd></dl> <p>而對每個具有<i>u</i>及<i>w</i>子代節點的內部節點的狀態之集合 </p> <dl><dd><span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle S(v)={\begin{cases}S(u)\cap S(w),&amp;S(u)\cap S(w)\neq \varnothing \\S(u)\cup S(w),&amp;S(u)\cap S(w)=\varnothing \end{cases}}}"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mi>S</mi> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mrow class="MJX-TeXAtom-ORD"> <mrow> <mo>{</mo> <mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"> <mtr> <mtd> <mi>S</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> <mo>&#x2229;<!-- ∩ --></mo> <mi>S</mi> <mo stretchy="false">(</mo> <mi>w</mi> <mo stretchy="false">)</mo> <mo>,</mo> </mtd> <mtd> <mi>S</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> <mo>&#x2229;<!-- ∩ --></mo> <mi>S</mi> <mo stretchy="false">(</mo> <mi>w</mi> <mo stretchy="false">)</mo> <mo>&#x2260;<!-- ≠ --></mo> <mi class="MJX-variant">&#x2205;<!-- ∅ --></mi> </mtd> </mtr> <mtr> <mtd> <mi>S</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> <mo>&#x222A;<!-- ∪ --></mo> <mi>S</mi> <mo stretchy="false">(</mo> <mi>w</mi> <mo stretchy="false">)</mo> <mo>,</mo> </mtd> <mtd> <mi>S</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> <mo>&#x2229;<!-- ∩ --></mo> <mi>S</mi> <mo stretchy="false">(</mo> <mi>w</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi class="MJX-variant">&#x2205;<!-- ∅ --></mi> </mtd> </mtr> </mtable> <mo fence="true" stretchy="true" symmetric="true"></mo> </mrow> </mrow> </mstyle> </mrow> <annotation encoding="application/x-tex">{\displaystyle S(v)={\begin{cases}S(u)\cap S(w),&amp;S(u)\cap S(w)\neq \varnothing \\S(u)\cup S(w),&amp;S(u)\cap S(w)=\varnothing \end{cases}}}</annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/451f60265da8bceb6d55d25d7cc4ba20080b93ad" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.505ex; width:42.292ex; height:6.176ex;" alt="{\displaystyle S(v)={\begin{cases}S(u)\cap S(w),&amp;S(u)\cap S(w)\neq \varnothing \\S(u)\cup S(w),&amp;S(u)\cap S(w)=\varnothing \end{cases}}}"></span></dd></dl> <p>在起初賦予簡約分數<i>z</i> = 0,再逐一對每個節點<i>v</i>估計<i>S</i>(<i>v</i>)。每當 </p> <dl><dd><span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle S(v)=S(u)\cap S(w)=\varnothing }"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mi>S</mi> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi>S</mi> <mo stretchy="false">(</mo> <mi>u</mi> <mo stretchy="false">)</mo> <mo>&#x2229;<!-- ∩ --></mo> <mi>S</mi> <mo stretchy="false">(</mo> <mi>w</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi class="MJX-variant">&#x2205;<!-- ∅ --></mi> </mstyle> </mrow> <annotation encoding="application/x-tex">{\displaystyle S(v)=S(u)\cap S(w)=\varnothing }</annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/883255f6ae82396cfc4d9b48ebc2d82508659979" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:24.635ex; height:2.843ex;" alt="{\displaystyle S(v)=S(u)\cap S(w)=\varnothing }"></span></dd></dl> <p>則<i>z</i>&#160;:= <i>z</i> + 1。 在估計每個節點後,最終<i>z</i>即為該親緣關係樹發生狀態轉變的總次數。 </p> <div class="mw-heading mw-heading3"><h3 id="適合大規模類群的演算法"><span id=".E9.81.A9.E5.90.88.E5.A4.A7.E8.A6.8F.E6.A8.A1.E9.A1.9E.E7.BE.A4.E7.9A.84.E6.BC.94.E7.AE.97.E6.B3.95"></span>適合大規模類群的演算法</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=11" title="编辑章节:適合大規模類群的演算法"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>當愈分析的類群規模很大時,簡約法會遭遇到<a href="/wiki/NP%E5%9B%B0%E9%9A%BE" title="NP困难">NP困难</a>。下列為試圖解決此問題的幾種方法: </p> <dl><dt>枝條綑紮法(<span lang="en">Branch and Bound</span>)</dt> <dd>由Hendy and Penny於1982年所提出。<sup id="cite_ref-11" class="reference"><a href="#cite_note-11"><span class="cite-bracket">&#91;</span>11<span class="cite-bracket">&#93;</span></a></sup>此演算法考慮<a href="/w/index.php?title=%E7%84%A1%E6%A0%B9%E6%A8%B9&amp;action=edit&amp;redlink=1" class="new" title="無根樹(页面不存在)">無根樹</a>,先將三個<a href="/wiki/%E5%88%86%E9%A1%9E%E5%96%AE%E5%85%83" title="分類單元">分類單元</a>構成一棵無根樹,計算需要幾步才可以解釋這棵樹所有的位點。然後估計再增加一物種所需最少的改變次數。此估計值為增加新物種的所有位點改變的總和。在運算過程中,將保留估計值最小的樹形。</dd> <dt>最近鄰交換(<span lang="en">Nearest neighbor interchange, NNI</span>)</dt> <dd>最近鄰交換重新排列樹形的方法為解散子樹(<span lang="en">subtree</span>)的連接關係來形成不同的樹形。利用<a href="/wiki/%E7%88%AC%E5%B1%B1%E7%AE%97%E6%B3%95" title="爬山算法">爬山演算法</a>(<span lang="en">hill-climbing algorithms</span>),永遠將最好的鄰居移置一起,直到沒有更好的鄰居存在。</dd> <dt>子樹刪除-再接法(<span lang="en">Subtree pruning and regrafting, SPR</span>)</dt> <dd>由Maddison於1991年所提出。<sup id="cite_ref-12" class="reference"><a href="#cite_note-12"><span class="cite-bracket">&#91;</span>12<span class="cite-bracket">&#93;</span></a></sup>將一子樹從原始樹上移除,再將子樹插回原始樹上其他的位置,以產生新的樹形。</dd> <dt>子樹切斷-重連法(<span lang="en">Tree Bisection and Reconnection, TBR</span>)</dt> <dd>將子樹從母樹的內節點(<span lang="en">interior node</span>)上拆除,然後嘗試創造出所有可能將子樹和母樹的連接方法。這個方法常產生更多種連接的方法,故有更高的機會找到較好的樹。</dd></dl> <div class="mw-heading mw-heading2"><h2 id="最大簡約法在親緣分析上的問題"><span id=".E6.9C.80.E5.A4.A7.E7.B0.A1.E7.B4.84.E6.B3.95.E5.9C.A8.E8.A6.AA.E7.B7.A3.E5.88.86.E6.9E.90.E4.B8.8A.E7.9A.84.E5.95.8F.E9.A1.8C"></span>最大簡約法在親緣分析上的問題</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=12" title="编辑章节:最大簡約法在親緣分析上的問題"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>最大簡約法是一種非常簡單的方法,也因此使其被廣為使用。然而,它並沒有<span class="ilh-all" data-orig-title="統計一致性" data-lang-code="en" data-lang-name="英语" data-foreign-title="Consistency_(statistics)"><span class="ilh-page"><a href="/w/index.php?title=%E7%B5%B1%E8%A8%88%E4%B8%80%E8%87%B4%E6%80%A7&amp;action=edit&amp;redlink=1" class="new" title="統計一致性(页面不存在)">統計一致性</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Consistency_(statistics)" class="extiw" title="en:Consistency (statistics)"><span lang="en" dir="auto">Consistency_(statistics)</span></a></span>)</span></span>(<span lang="en">statistically consistent</span>)。也就是說,當給予足夠的數據時,它不保證能產生具有高或然率的真正的樹。一致性,這裡指的是增加更多的數據後,將會單調收斂於正確答案,是一種任何<a href="/w/index.php?title=%E7%B5%B1%E8%A8%88%E6%96%B9%E6%B3%95&amp;action=edit&amp;redlink=1" class="new" title="統計方法(页面不存在)">統計方法</a>均有的令人滿意的特性。如<span class="ilh-all" data-orig-title="Joseph Felsenstein" data-lang-code="en" data-lang-name="英语" data-foreign-title="Joseph Felsenstein"><span class="ilh-page"><a href="/w/index.php?title=Joseph_Felsenstein&amp;action=edit&amp;redlink=1" class="new" title="Joseph Felsenstein(页面不存在)">Joseph Felsenstein</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Joseph_Felsenstein" class="extiw" title="en:Joseph Felsenstein"><span lang="en" dir="auto">Joseph Felsenstein</span></a></span>)</span></span>在1987年證明,<sup id="cite_ref-13" class="reference"><a href="#cite_note-13"><span class="cite-bracket">&#91;</span>13<span class="cite-bracket">&#93;</span></a></sup>最大簡約法在一致的條件下可以是不一致的。這種已知會發生的情形被稱為<a href="/wiki/%E9%95%B7%E6%9E%9D%E5%90%B8%E5%BC%95%E6%95%88%E6%87%89" title="長枝吸引效應">長枝吸引效應</a>。舉例來說,有兩個物種(A和C)具有長枝(有高度的鹼基置換率),而另外兩個物種(B和C)具有短枝。A和B是從共同祖先分化而來,C和D亦是。 </p><p>為了簡單起見,假設我們考慮單一的二元特徵(它可以是+或-)。由於從B到D的距離短,在所有情況下,絕大多數會判定B和D是相同的。在此我們假設此兩者均為+ (+和-可被任意分配和置換)。在此情況下,有四個其它的可能性。A和C可以均為+,在這種情況下,所有的分類群均相同,且所有的樹均具有相同的長度。A可為+C可為-,在這種情況下,僅有一個特徵不相同,我們不能學到任何東西,所有的樹均具有相同長度。同樣地,A可為-C可為+。剩下唯一的可能為A和C均為-。然而,在這種情況下,我們將A和C分成一組,並將B和D分為一組。因此,當我們有一個這種類型的樹時,我們收集愈多數據(如研究更多特徵),愈傾向得到錯誤的樹。 </p><p>SAW(以Siddal和Whiting命名)是一個簡單且有效的方法來測定樹形是否有受長枝吸引影響。若懷疑一對分類群(A和B)發生長枝吸引,只需移除分類群A (「鋸」除此分枝) 並重新執行分析。然後以相同方法移除B,再次執行分析。如果兩者中有任一分類群出現在不同的分枝點,即具有長枝吸引的證據。由於在分析時僅放入一長枝,此長枝不可能會吸引其他分類群,若處理間分類群的位置為一致的,則表示沒有長枝吸引的問題。<sup id="cite_ref-14" class="reference"><a href="#cite_note-14"><span class="cite-bracket">&#91;</span>14<span class="cite-bracket">&#93;</span></a></sup> </p><p>估計親緣關係有幾種其他的方法可供選擇,包含<a href="/wiki/%E6%9C%80%E5%A4%A7%E4%BC%BC%E7%84%B6%E6%B3%95" class="mw-redirect" title="最大似然法">最大似然法</a>、<a class="external text" href="https://en.wikipedia.org/wiki/Bayesian_inference_in_phylogeny">貝葉斯親緣關係推論</a> (<a rel="nofollow" class="external text" href="//web.archive.org/web/20201127015724/http://en.wikipedia.org/wiki/Bayesian_inference_in_phylogeny">页面存档备份</a>,存于<a href="/wiki/%E4%BA%92%E8%81%94%E7%BD%91%E6%A1%A3%E6%A1%88%E9%A6%86" title="互联网档案馆">互联网档案馆</a>)、<a href="/wiki/%E8%BF%91%E9%84%B0%E7%B5%90%E5%90%88%E6%B3%95" class="mw-redirect" title="近鄰結合法">近鄰結合法</a>,和<a href="/w/index.php?title=%E9%9B%99%E5%8F%89%E6%A8%B9%E6%BC%94%E7%AE%97%E6%B3%95&amp;action=edit&amp;redlink=1" class="new" title="雙叉樹演算法(页面不存在)">雙叉樹演算法</a>(<span lang="en">quartet methods</span>)。其中,前兩者均使用<a href="/wiki/%E4%BC%BC%E7%84%B6%E5%87%BD%E6%95%B0" title="似然函数">似然函數</a>,並且,若使用得當,理論上可避免長枝吸引。此兩種方法均為<a href="/w/index.php?title=%E5%8F%83%E6%95%B8%E7%9A%84&amp;action=edit&amp;redlink=1" class="new" title="參數的(页面不存在)">參數的</a>,表示其依賴一個明確的特徵演化模型。其已被證明,對於一些次佳的模型,這些方法亦可以是不一致的。<link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r83946278"><sup class="noprint Template-Fact"><a href="/wiki/Wikipedia:%E5%88%97%E6%98%8E%E6%9D%A5%E6%BA%90" title="Wikipedia:列明来源"><span style="white-space: nowrap;" title="来源请求。">&#91;來源請求&#93;</span></a></sup> </p><p>最大簡約法的另一個問題為尋找最簡約的樹是一個<a href="/wiki/NP%E5%9B%B0%E9%9A%BE" title="NP困难">NP困难</a>問題<sup id="cite_ref-15" class="reference"><a href="#cite_note-15"><span class="cite-bracket">&#91;</span>15<span class="cite-bracket">&#93;</span></a></sup>。目前唯一可用、有效的解決方法為,給予一個任意的巨大分類群,利用探索方法不保證最簡約的樹會被重新找到。這些方法使用<a href="/wiki/%E7%88%AC%E5%B1%B1%E7%AE%97%E6%B3%95" title="爬山算法">爬山演算法</a>(<span lang="en">hill-climbing algorithms</span>)逐漸接近最佳的樹。然而,其已被證明可以有次佳解的「樹島」,且分析可以被困在這些<span class="ilh-all" data-orig-title="局部最佳" data-lang-code="en/Local_optima" data-lang-name="" data-foreign-title="局部最佳"><span class="ilh-page"><a href="/w/index.php?title=%E5%B1%80%E9%83%A8%E6%9C%80%E4%BD%B3&amp;action=edit&amp;redlink=1" class="new" title="局部最佳(页面不存在)">局部最佳</a></span><span class="noprint ilh-comment">(<span class="ilh-lang"></span><span class="ilh-colon">:</span><span class="ilh-link"><a href="/w/index.php?title=En/Local_optima:%E5%B1%80%E9%83%A8%E6%9C%80%E4%BD%B3&amp;action=edit&amp;redlink=1" class="new" title="En/Local optima:局部最佳(页面不存在)"><span lang="en/Local_optima" dir="auto">局部最佳</span></a></span>)</span></span>(<span lang="en">local optima</span>)處。因此,需要複雜的、靈活的探索方法,來確保樹空間已經被充分探索。一些探索方法可供選擇,包括<span class="ilh-all" data-orig-title="最近鄰交換" data-lang-code="en" data-lang-name="英语" data-foreign-title="Nearest_neighbor_interchange"><span class="ilh-page"><a href="/w/index.php?title=%E6%9C%80%E8%BF%91%E9%84%B0%E4%BA%A4%E6%8F%9B&amp;action=edit&amp;redlink=1" class="new" title="最近鄰交換(页面不存在)">最近鄰交換</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Nearest_neighbor_interchange" class="extiw" title="en:Nearest neighbor interchange"><span lang="en" dir="auto">Nearest_neighbor_interchange</span></a></span>)</span></span>(<span lang="en">Nearest Neighbor Interchange, NNI</span>)、<span class="ilh-all" data-orig-title="子樹切斷-重連法" data-lang-code="en" data-lang-name="英语" data-foreign-title="Nearest_neighbor_interchange"><span class="ilh-page"><a href="/w/index.php?title=%E5%AD%90%E6%A8%B9%E5%88%87%E6%96%B7-%E9%87%8D%E9%80%A3%E6%B3%95&amp;action=edit&amp;redlink=1" class="new" title="子樹切斷-重連法(页面不存在)">子樹切斷-重連法</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Nearest_neighbor_interchange" class="extiw" title="en:Nearest neighbor interchange"><span lang="en" dir="auto">Nearest_neighbor_interchange</span></a></span>)</span></span>(<span lang="en">Tree Bisection and Reconnection, TBR</span>),及<a href="/w/index.php?title=Phylogenetic_ratchet&amp;action=edit&amp;redlink=1" class="new" title="Phylogenetic ratchet(页面不存在)">phylogenetic ratchet</a>。這個問題並非最大簡約法獨有,任何利用到最佳標準的方法均面臨相同的問題,且沒有簡單的解決方法。 </p> <div class="mw-heading mw-heading2"><h2 id="批評"><span id=".E6.89.B9.E8.A9.95"></span>批評</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=13" title="编辑章节:批評"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>最大簡約法曾被斷言其最主要的問題,尤其在<a href="/wiki/%E5%8F%A4%E7%94%9F%E7%89%A9%E5%AD%B8" class="mw-redirect" title="古生物學">古生物學</a>,是其假設兩物種要在相同位置共享相同核甘酸的唯一方法為此兩者需有血緣關係。這宣告簡約法假設所有相似性均為<a href="/wiki/%E5%90%8C%E6%BA%90" title="同源">同源</a> (其他解釋則為荒謬的,如主張兩物種也許沒有血緣關係)。但顯然並非如此: 當以特徵的任何型式為基礎來估計親緣關係時,簡約法是利用尋找最佳親緣關係樹來測試相似性的同源性。 </p><p>舉例來說,鳥和蝙蝠擁有翅膀,而鱷魚和人類則無。若這是唯一可用的數據,最大簡約法會傾向將鱷魚和人類分在同一組,鳥和蝙蝠分在同一組(其他<a href="/wiki/%E7%B3%BB%E7%B5%B1%E7%99%BC%E7%94%9F%E5%AD%B8" class="mw-redirect" title="系統發生學">親緣關係</a>推論的方法亦同)。但根據更多數據而非單一特徵(翅膀),我們相信實際上比起鳥或鱷魚,人類和蝙蝠的關係較近。若分析中包含額外的數據,就算僅是微小的片段,如骨骼結構、<a href="/wiki/%E8%BB%9F%E7%B5%84%E7%B9%94" title="軟組織">軟組織</a>形態、皮膜、行為、遺傳…等,鳥和蝙蝠依據翅膀所產生之微小的親緣關係訊號,會被支持(人類、蝙蝠)(鳥、鱷魚)的數據壓倒。 </p><p>簡約法常被認為不適合用來推論親緣關係,因為「演化並非最簡約的」。在多數情況下,明確的替代假說並沒有被提出,若沒替代假說可用,任何統計方法均傾向沒有假說。此外,也不清楚若句子「演化為簡約」為真,代表什麼意義。這可能意味著歷史上發生特徵的改變的次數,可能比用簡約法所估計出來的次數多。由於簡約法以發生最少次特徵改變來解釋樹,所以此情況極有可能發生。然而,曾有模擬的研究顯示,測試已知的<a href="/wiki/In_vitro" title="In vitro">體外培養(in vitro)</a>病毒之親緣關係,多數情況並非最簡約。簡約法利用特徵改變次數來挑選最佳的樹,。只要特徵改變在樹上是隨機分布的(一個合理的虛無預期),則結果不應有偏差。實際上,此方法很健全: 利用最大簡約法來選樹具有最小的偏差。 </p><p>做一個比喻:根據一開始估計的工作成本來選擇承包商,但實際完成的成本很可能會高於初始的估價。儘管如此,選擇提供最低估價的承包商,理論上應該可獲得最終成本為最低的結果。這是因為,在沒有其他數據時,我們會假設所有承包商均具有相同的成本超支風險。實際上,不良的經營手法也許會使此結果產生偏差;在系統發生中亦同,某些特殊的親緣關係問題(如<a href="/wiki/%E9%95%B7%E6%9E%9D%E5%90%B8%E5%BC%95%E6%95%88%E6%87%89" title="長枝吸引效應">長枝吸引效應</a>,如上所述)可能會造成偏差。然而,在這兩個例子中,基於估計本身,也無法描述結果是否將會產生偏差,或偏差的程度。簡約法亦同,在缺乏和其他證據比較的狀況下,無法明確描述數據是否會造成誤導。 </p><p>按照同樣的思路,簡約法以哲學的角度認為發生演化改變是罕見的,或趨同(收斂和逆轉)在演化的過程中是少有的。這並非完全正確:簡約法認為經歷最少次收斂和逆轉過程的樹為最佳的,但這可能是相對大量趨同事件所產生的結果。更恰當的說法為簡約法假設數據中暗指只有最少次的改變。如上述,我們不需認定這是唯一發生的變化,只是當沒有證據時,簡單地不去推斷有發生改變。簡單來說,「簡約法是做最少的假設,而非假設趨同演化發生的次數是最少的」。 </p><p>簡約法的概念也和<a href="/wiki/%E5%A5%A7%E5%8D%A1%E5%A7%86%E5%89%83%E5%88%80" class="mw-redirect" title="奧卡姆剃刀">奧卡姆剃刀</a>的概念( 即「最簡單的解釋是最好的」)一致。簡約法偏好的解答,需要最少數的未經證實的假設和不被支持的結論。這在科學上是很常見的方法,尤其是當處理系統如此複雜如同拒絕簡單模型。簡約法不必然要產生一個「簡單」的假設。事實上,如同一般規則,多數特徵是如此複雜,故沒有真正「簡單」的解決方法。 </p> <div class="mw-heading mw-heading2"><h2 id="參見"><span id=".E5.8F.83.E8.A6.8B"></span>參見</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=14" title="编辑章节:參見"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a href="/wiki/%E5%B9%B3%E7%A9%A9%E4%BD%9C%E7%94%A8%E9%87%8F%E5%8E%9F%E7%90%86" class="mw-redirect" title="平穩作用量原理">平穩作用量原理</a></li></ul> <div class="mw-heading mw-heading2"><h2 id="參考文獻"><span id=".E5.8F.83.E8.80.83.E6.96.87.E7.8D.BB"></span>參考文獻</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;action=edit&amp;section=15" title="编辑章节:參考文獻"><span>编辑</span></a><span class="mw-editsection-bracket">]</span></span></div> <div class="reflist columns references-column-count references-column-count-2" style="-moz-column-count: 2; -webkit-column-count: 2; column-count: 2; list-style-type: decimal;"> <ol class="references"> <li id="cite_note-Fitch-1"><span class="mw-cite-backlink"><b><a href="#cite_ref-Fitch_1-0">^</a></b></span> <span class="reference-text"><cite class="citation journal">Walter M. Fitch. <a rel="nofollow" class="external text" href="http://www.jstor.org/stable/2412116">Toward defining the course of evolution: minimum change for a specified tree topology</a>. Systematic Zoology. December 1971, <b>20</b> (4): 406–416 <span class="reference-accessdate"> &#91;<span class="nowrap">2013-01-13</span>&#93;</span>. (原始内容<a rel="nofollow" class="external text" href="https://web.archive.org/web/20210629002931/https://www.jstor.org/stable/2412116">存档</a>于2021-06-29).</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=Toward+defining+the+course+of+evolution%3A+minimum+change+for+a+specified+tree+topology&amp;rft.au=Walter+M.+Fitch&amp;rft.date=1971-12&amp;rft.genre=article&amp;rft.issue=4&amp;rft.jtitle=Systematic+Zoology&amp;rft.pages=406-416&amp;rft.volume=20&amp;rft_id=http%3A%2F%2Fwww.jstor.org%2Fstable%2F2412116&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span></span> </li> <li id="cite_note-logic-2"><span class="mw-cite-backlink">^ <a href="#cite_ref-logic_2-0"><sup><b>2.0</b></sup></a> <a href="#cite_ref-logic_2-1"><sup><b>2.1</b></sup></a> <a href="#cite_ref-logic_2-2"><sup><b>2.2</b></sup></a></span> <span class="reference-text"><cite class="citation book">E. T. Jaynes, edited by G. Larry Bretthorst. <a rel="nofollow" class="external text" href="http://www.cambridge.org/9780521592710">Probability Theory: The Logic of Science</a>. Cambridge, United Kingdom: Cambridge University Press, Cambridge. 2003. <a href="/wiki/Special:%E7%BD%91%E7%BB%9C%E4%B9%A6%E6%BA%90/9780521592710" title="Special:网络书源/9780521592710"><span title="国际标准书号">ISBN</span>&#160;9780521592710</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.au=E.+T.+Jaynes%2C+edited+by+G.+Larry+Bretthorst&amp;rft.btitle=Probability+Theory%3A+The+Logic+of+Science&amp;rft.date=2003&amp;rft.genre=book&amp;rft.isbn=9780521592710&amp;rft.place=Cambridge%2C+United+Kingdom&amp;rft.pub=Cambridge+University+Press%2C+Cambridge&amp;rft_id=http%3A%2F%2Fwww.cambridge.org%2F9780521592710&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook" class="Z3988"><span style="display:none;">&#160;</span></span></span> </li> <li id="cite_note-michener-and-sokal-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-michener-and-sokal_3-0">^</a></b></span> <span class="reference-text"><cite class="citation journal">Michener, Charles D. and Sokal, Robert R. <a rel="nofollow" class="external text" href="http://www.jstor.org/discover/10.2307/2406046?uid=309521131&amp;uid=3739216&amp;uid=2129&amp;uid=2&amp;uid=70&amp;uid=3&amp;uid=36117&amp;uid=67&amp;uid=62&amp;uid=5909896&amp;sid=21101664660417">A Quantitative Approach to a Problem in Classification</a>. Evolution. Jan 1957, <b>11</b> (2): 130–162.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=A+Quantitative+Approach+to+a+Problem+in+Classification&amp;rft.au=Michener%2C+Charles+D.+and+Sokal%2C+Robert+R.&amp;rft.date=1957-01&amp;rft.genre=article&amp;rft.issue=2&amp;rft.jtitle=Evolution&amp;rft.pages=130-162&amp;rft.volume=11&amp;rft_id=http%3A%2F%2Fwww.jstor.org%2Fdiscover%2F10.2307%2F2406046%3Fuid%3D309521131%26uid%3D3739216%26uid%3D2129%26uid%3D2%26uid%3D70%26uid%3D3%26uid%3D36117%26uid%3D67%26uid%3D62%26uid%3D5909896%26sid%3D21101664660417&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span></span> </li> <li id="cite_note-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-4">^</a></b></span> <span class="reference-text">Edwards, A.W.F., and L.L. Cavalli-Sforza. 1964. Reconstruction of evolutionary trees. pp. 67–76 in Phenetic and Phylogenetic Classification, ed. V. H. Heywood and J. McNeill. Systematics Association pub. no. 6, London.</span> </li> <li id="cite_note-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-5">^</a></b></span> <span class="reference-text">Cavalli-Sforza, L.L. and A.W.F. Edwards. 1965. Analysis of human evolution. pp. 923–933 in Genetics Today. Proceedings of the XI International Congress of Genetics, The Hague, The Netherlands, September 1963, volume 3, ed. S. J. Geerts, Pergamon Press, Oxford.</span> </li> <li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text">Camin, J. H., and R. R. Sokal. 1965. A method for deducing branching sequences in phylogeny. Evolution 19: 311-326. </span> </li> <li id="cite_note-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-7">^</a></b></span> <span class="reference-text">Bartcher, R. L. (1966). Fortran IV program for estimation of cladistic relationships using the IBM 7040. Lawrence, Kan.: University of Kansas.</span> </li> <li id="cite_note-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-8">^</a></b></span> <span class="reference-text">Eck, R. V. and M. O. Dayhoff. 1966. Atlas of Protein Sequence and Structure. National Biomedical Research Foundation, Silver Springs, Maryland.</span> </li> <li id="cite_note-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-9">^</a></b></span> <span class="reference-text">Fitch and Margoliash 1967. Fitch WM &amp; Margoliash E (1967) Construction of phylogenetic trees. Science 155:279 284.</span> </li> <li id="cite_note-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-10">^</a></b></span> <span class="reference-text"><cite class="citation journal">Elliott Sober. Parsimony in Systematics: Philosophical Issues. Annual Review of Ecology and Systematics. November 1983, <b>14</b>: 335–357. <a rel="nofollow" class="external text" href="https://doi.org/10.1146%2Fannurev.es.14.110183.002003"><span title="數位物件識別號">doi:10.1146/annurev.es.14.110183.002003</span></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=Parsimony+in+Systematics%3A+Philosophical+Issues&amp;rft.au=Elliott+Sober&amp;rft.date=1983-11&amp;rft.genre=article&amp;rft.jtitle=Annual+Review+of+Ecology+and+Systematics&amp;rft.pages=335-357&amp;rft.volume=14&amp;rft_id=info%3Adoi%2F10.1146%2Fannurev.es.14.110183.002003&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span></span> </li> <li id="cite_note-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-11">^</a></b></span> <span class="reference-text"><cite class="citation journal">M. D. Hendy; D. Penny. Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences. 1982, <b>60</b>: 133–142.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=Branch+and+bound+algorithms+to+determine+minimal+evolutionary+trees&amp;rft.au=M.+D.+Hendy&amp;rft.date=1982&amp;rft.genre=article&amp;rft.jtitle=Mathematical+Biosciences&amp;rft.pages=133-142&amp;rft.volume=60&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span> <span style="display:none;font-size:100%" class="error citation-comment">引文使用过时参数<code style="color:inherit; border:inherit; padding:inherit;">coauthors</code> (<a href="/wiki/Help:%E5%BC%95%E6%96%87%E6%A0%BC%E5%BC%8F1%E9%94%99%E8%AF%AF#deprecated_params" title="Help:引文格式1错误">帮助</a>)</span></span> </li> <li id="cite_note-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-12">^</a></b></span> <span class="reference-text"><cite class="citation journal">D. R. Maddison. The discovery and importance of multiple islands of most-parsimonious trees. Systematic Zoology. 1991, <b>40</b>: 315–328.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=The+discovery+and+importance+of+multiple+islands+of+most-parsimonious+trees&amp;rft.au=D.+R.+Maddison&amp;rft.date=1991&amp;rft.genre=article&amp;rft.jtitle=Systematic+Zoology&amp;rft.pages=315-328&amp;rft.volume=40&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span></span> </li> <li id="cite_note-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-13">^</a></b></span> <span class="reference-text"><cite class="citation journal">Joseph Felsenstein. Cases in which Parsimony or Compatibility Methods Will be Positively Misleading. Systematic Zoology. 1978年12月, <b>27</b> (4): 401–410.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=Cases+in+which+Parsimony+or+Compatibility+Methods+Will+be+Positively+Misleading&amp;rft.au=Joseph+Felsenstein&amp;rft.date=1978-12&amp;rft.genre=article&amp;rft.issue=4&amp;rft.jtitle=Systematic+Zoology&amp;rft.pages=401-410&amp;rft.volume=27&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span></span> </li> <li id="cite_note-14"><span class="mw-cite-backlink"><b><a href="#cite_ref-14">^</a></b></span> <span class="reference-text"><cite class="citation journal">Mark E. Siddall; Michael F. Whiting. Long-Branch Abstractions. Cladistics. 1999, <b>15</b>: 9–24.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=Long-Branch+Abstractions&amp;rft.au=Mark+E.+Siddall&amp;rft.date=1999&amp;rft.genre=article&amp;rft.jtitle=Cladistics&amp;rft.pages=9-24&amp;rft.volume=15&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span> <span style="display:none;font-size:100%" class="error citation-comment">引文使用过时参数<code style="color:inherit; border:inherit; padding:inherit;">coauthors</code> (<a href="/wiki/Help:%E5%BC%95%E6%96%87%E6%A0%BC%E5%BC%8F1%E9%94%99%E8%AF%AF#deprecated_params" title="Help:引文格式1错误">帮助</a>)</span></span> </li> <li id="cite_note-15"><span class="mw-cite-backlink"><b><a href="#cite_ref-15">^</a></b></span> <span class="reference-text"><cite class="citation journal">William H. E. Day. <a rel="nofollow" class="external text" href="https://archive.org/details/sim_bulletin-of-mathematical-biology_1987_49_4/page/461">Computational complexity of inferring phylogenies from dissimilarity matrices</a>. Bulletin of Mathematical Biology. 1987, <b>49</b> (4): 461–467.</cite><span title="ctx_ver=Z39.88-2004&amp;rfr_id=info%3Asid%2Fzh.wikipedia.org%3A%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;rft.atitle=Computational+complexity+of+inferring+phylogenies+from+dissimilarity+matrices&amp;rft.au=William+H.+E.+Day&amp;rft.date=1987&amp;rft.genre=article&amp;rft.issue=4&amp;rft.jtitle=Bulletin+of+Mathematical+Biology&amp;rft.pages=461-467&amp;rft.volume=49&amp;rft_id=https%3A%2F%2Farchive.org%2Fdetails%2Fsim_bulletin-of-mathematical-biology_1987_49_4%2Fpage%2F461&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal" class="Z3988"><span style="display:none;">&#160;</span></span></span> </li> </ol></div> <div class="navbox-styles"><style data-mw-deduplicate="TemplateStyles:r84265675">.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:" :"}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist-pipe dd::after,.mw-parser-output .hlist-pipe li::after{content:" | ";font-weight:normal}.mw-parser-output .hlist-hyphen dd::after,.mw-parser-output .hlist-hyphen li::after{content:" - ";font-weight:normal}.mw-parser-output .hlist-comma dd::after,.mw-parser-output .hlist-comma li::after{content:"、";font-weight:normal}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:"("counter(listitem)"\a0 "}.mw-parser-output ul.cslist,.mw-parser-output ul.sslist{margin:0;padding:0;display:inline-block;list-style:none}.mw-parser-output .cslist li,.mw-parser-output .sslist li{margin:0;display:inline-block}.mw-parser-output .cslist li::after{content:","}.mw-parser-output .sslist li::after{content:";"}.mw-parser-output .cslist li:last-child::after,.mw-parser-output .sslist li:last-child::after{content:none}</style><style data-mw-deduplicate="TemplateStyles:r84261037">.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{text-align:center;padding-left:1em;padding-right:1em}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf;position:relative}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em;width:auto;padding-left:0.2em;position:absolute;left:1em}.mw-parser-output .navbox .mw-collapsible-toggle{margin-left:0.5em;position:absolute;right:1em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}</style></div><div role="navigation" class="navbox" aria-labelledby="-&amp;#123;A&amp;#124;zh-hans:系统发生;_zh-hk:系統發生;_zh-tw:親緣關係;&amp;#125;-學" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="collapsible-title navbox-title" colspan="2"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r84265675"><style data-mw-deduplicate="TemplateStyles:r84244141">.mw-parser-output .navbar{display:inline;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:110%;margin:0 8em}.mw-parser-output .navbar-ct-mini{font-size:110%;margin:0 5em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}</style><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="Template:系统发生学"><abbr title="查看该模板">查</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="Template talk:系统发生学"><abbr title="讨论该模板">论</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:%E7%BC%96%E8%BE%91%E9%A1%B5%E9%9D%A2/Template:%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="Special:编辑页面/Template:系统发生学"><abbr title="编辑该模板">编</abbr></a></li></ul></div><div id="-&amp;#123;A&amp;#124;zh-hans:系统发生;_zh-hk:系統發生;_zh-tw:親緣關係;&amp;#125;-學" style="font-size:110%;margin:0 5em"><a href="/wiki/%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="系统发生学">系统发生學</a></div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">相关领域</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0px"><div style="padding:0em 0.25em"> <ul><li><span class="ilh-all" data-orig-title="计算系统发生学" data-lang-code="en" data-lang-name="英语" data-foreign-title="Computational phylogenetics"><span class="ilh-page"><a href="/w/index.php?title=%E8%AE%A1%E7%AE%97%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6&amp;action=edit&amp;redlink=1" class="new" title="计算系统发生学(页面不存在)">计算系统发生学</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Computational_phylogenetics" class="extiw" title="en:Computational phylogenetics"><span lang="en" dir="auto">Computational phylogenetics</span></a></span>)</span></span></li> <li><a href="/wiki/%E5%88%86%E5%AD%90%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="分子系统发生学">分子系统发生学</a></li> <li><a href="/wiki/%E6%94%AF%E5%BA%8F%E5%88%86%E9%A1%9E%E5%AD%B8" title="支序分類學">支序系統學</a></li> <li><a href="/wiki/%E7%94%9F%E7%89%A9%E5%88%86%E7%B1%BB%E5%AD%A6" title="生物分类学">生物分类学</a></li> <li><a href="/wiki/%E7%B3%BB%E7%B5%B1%E5%88%86%E9%A1%9E%E5%AD%B8" title="系統分類學">系統分類學</a></li> <li><span class="ilh-all" data-orig-title="演化分类学" data-lang-code="en" data-lang-name="英语" data-foreign-title="Evolutionary taxonomy"><span class="ilh-page"><a href="/w/index.php?title=%E6%BC%94%E5%8C%96%E5%88%86%E7%B1%BB%E5%AD%A6&amp;action=edit&amp;redlink=1" class="new" title="演化分类学(页面不存在)">演化分类学</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Evolutionary_taxonomy" class="extiw" title="en:Evolutionary taxonomy"><span lang="en" dir="auto">Evolutionary taxonomy</span></a></span>)</span></span></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">基本概念</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0px"><div style="padding:0em 0.25em"> <ul><li><a href="/wiki/%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="系统发生学">系統發生</a>(<span class="ilh-all" data-orig-title="分支發生" data-lang-code="en" data-lang-name="英语" data-foreign-title="Cladogenesis"><span class="ilh-page"><a href="/w/index.php?title=%E5%88%86%E6%94%AF%E7%99%BC%E7%94%9F&amp;action=edit&amp;redlink=1" class="new" title="分支發生(页面不存在)">分支發生</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Cladogenesis" class="extiw" title="en:Cladogenesis"><span lang="en" dir="auto">Cladogenesis</span></a></span>)</span></span>)</li> <li><a href="/wiki/%E7%B3%BB%E7%B5%B1%E7%99%BC%E7%94%9F%E6%A8%B9" title="系統發生樹">系統發生樹</a>(<a href="/wiki/%E6%94%AF%E5%BA%8F%E5%9B%BE" title="支序图">支序图</a>)</li> <li><a href="/wiki/%E6%BC%94%E5%8C%96%E7%B6%B2%E8%B7%AF" title="演化網路">演化網路</a></li> <li><a href="/wiki/%E9%95%B7%E6%9E%9D%E5%90%B8%E5%BC%95%E6%95%88%E6%87%89" title="長枝吸引效應">長枝吸引效應</a></li> <li><a href="/wiki/%E6%BC%94%E5%8C%96%E6%94%AF" title="演化支">演化支</a>和<span class="ilh-all" data-orig-title="演化级" data-lang-code="en" data-lang-name="英语" data-foreign-title="Evolutionary grade"><span class="ilh-page"><a href="/w/index.php?title=%E6%BC%94%E5%8C%96%E7%BA%A7&amp;action=edit&amp;redlink=1" class="new" title="演化级(页面不存在)">演化级</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Evolutionary_grade" class="extiw" title="en:Evolutionary grade"><span lang="en" dir="auto">Evolutionary grade</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="谱系 (演化)" data-lang-code="en" data-lang-name="英语" data-foreign-title="Lineage (evolution)"><span class="ilh-page"><a href="/w/index.php?title=%E8%B0%B1%E7%B3%BB_(%E6%BC%94%E5%8C%96)&amp;action=edit&amp;redlink=1" class="new" title="谱系 (演化)(页面不存在)">谱系</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Lineage_(evolution)" class="extiw" title="en:Lineage (evolution)"><span lang="en" dir="auto">Lineage (evolution)</span></a></span>)</span></span>(<span class="ilh-all" data-orig-title="幽灵谱系" data-lang-code="en" data-lang-name="英语" data-foreign-title="Ghost lineage"><span class="ilh-page"><a href="/w/index.php?title=%E5%B9%BD%E7%81%B5%E8%B0%B1%E7%B3%BB&amp;action=edit&amp;redlink=1" class="new" title="幽灵谱系(页面不存在)">幽灵谱系</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Ghost_lineage" class="extiw" title="en:Ghost lineage"><span lang="en" dir="auto">Ghost lineage</span></a></span>)</span></span>)</li> <li><span class="ilh-all" data-orig-title="幽灵种群" data-lang-code="en" data-lang-name="英语" data-foreign-title="Ghost population"><span class="ilh-page"><a href="/w/index.php?title=%E5%B9%BD%E7%81%B5%E7%A7%8D%E7%BE%A4&amp;action=edit&amp;redlink=1" class="new" title="幽灵种群(页面不存在)">幽靈种群</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Ghost_population" class="extiw" title="en:Ghost population"><span lang="en" dir="auto">Ghost population</span></a></span>)</span></span></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">推理方法</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0px"><div style="padding:0em 0.25em"> <ul><li><a class="mw-selflink selflink">最大簡約法</a></li> <li>概率法(<a href="/wiki/%E6%9C%80%E5%A4%A7%E4%BC%BC%E7%84%B6%E4%BC%B0%E8%AE%A1" title="最大似然估计">最大似然估计</a></li> <li><a href="/wiki/%E8%B4%9D%E5%8F%B6%E6%96%AF%E6%B3%95" title="贝叶斯法">贝叶斯法</a>)</li> <li><span class="ilh-all" data-orig-title="系统发生中的距离矩阵" data-lang-code="en" data-lang-name="英语" data-foreign-title="Distance matrices in phylogeny"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E4%B8%AD%E7%9A%84%E8%B7%9D%E7%A6%BB%E7%9F%A9%E9%98%B5&amp;action=edit&amp;redlink=1" class="new" title="系统发生中的距离矩阵(页面不存在)">距離矩陣法</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Distance_matrices_in_phylogeny" class="extiw" title="en:Distance matrices in phylogeny"><span lang="en" dir="auto">Distance matrices in phylogeny</span></a></span>)</span></span>(<a href="/wiki/%E9%82%BB%E6%8E%A5%E6%B3%95" title="邻接法">邻接法</a></li> <li><span class="ilh-all" data-orig-title="不加權算術平均連鎖法" data-lang-code="en" data-lang-name="英语" data-foreign-title="UPGMA"><span class="ilh-page"><a href="/w/index.php?title=%E4%B8%8D%E5%8A%A0%E6%AC%8A%E7%AE%97%E8%A1%93%E5%B9%B3%E5%9D%87%E9%80%A3%E9%8E%96%E6%B3%95&amp;action=edit&amp;redlink=1" class="new" title="不加權算術平均連鎖法(页面不存在)">不加權算術平均連鎖法</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/UPGMA" class="extiw" title="en:UPGMA"><span lang="en" dir="auto">UPGMA</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="系统发生中的最小二乘法推理" data-lang-code="en" data-lang-name="英语" data-foreign-title="Least squares inference in phylogeny"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E4%B8%AD%E7%9A%84%E6%9C%80%E5%B0%8F%E4%BA%8C%E4%B9%98%E6%B3%95%E6%8E%A8%E7%90%86&amp;action=edit&amp;redlink=1" class="new" title="系统发生中的最小二乘法推理(页面不存在)">最小二乘法</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Least_squares_inference_in_phylogeny" class="extiw" title="en:Least squares inference in phylogeny"><span lang="en" dir="auto">Least squares inference in phylogeny</span></a></span>)</span></span>)</li> <li><span class="ilh-all" data-orig-title="三元分析" data-lang-code="en" data-lang-name="英语" data-foreign-title="Three-taxon analysis"><span class="ilh-page"><a href="/w/index.php?title=%E4%B8%89%E5%85%83%E5%88%86%E6%9E%90&amp;action=edit&amp;redlink=1" class="new" title="三元分析(页面不存在)">三元分析</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Three-taxon_analysis" class="extiw" title="en:Three-taxon analysis"><span lang="en" dir="auto">Three-taxon analysis</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="親緣包圍法" data-lang-code="en" data-lang-name="英语" data-foreign-title="Phylogenetic bracketing"><span class="ilh-page"><a href="/w/index.php?title=%E8%A6%AA%E7%B7%A3%E5%8C%85%E5%9C%8D%E6%B3%95&amp;action=edit&amp;redlink=1" class="new" title="親緣包圍法(页面不存在)">系统发生包圍法</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Phylogenetic_bracketing" class="extiw" title="en:Phylogenetic bracketing"><span lang="en" dir="auto">Phylogenetic bracketing</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="系统发生和解" data-lang-code="en" data-lang-name="英语" data-foreign-title="Phylogenetic reconciliation"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%92%8C%E8%A7%A3&amp;action=edit&amp;redlink=1" class="new" title="系统发生和解(页面不存在)">系统发生和解</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Phylogenetic_reconciliation" class="extiw" title="en:Phylogenetic reconciliation"><span lang="en" dir="auto">Phylogenetic reconciliation</span></a></span>)</span></span></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">前沿课题</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0px"><div style="padding:0em 0.25em"> <ul><li><span class="ilh-all" data-orig-title="生物谱系命名法" data-lang-code="en" data-lang-name="英语" data-foreign-title="Phylogenetic nomenclature"><span class="ilh-page"><a href="/w/index.php?title=%E7%94%9F%E7%89%A9%E8%B0%B1%E7%B3%BB%E5%91%BD%E5%90%8D%E6%B3%95&amp;action=edit&amp;redlink=1" class="new" title="生物谱系命名法(页面不存在)">生物谱系命名法</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Phylogenetic_nomenclature" class="extiw" title="en:Phylogenetic nomenclature"><span lang="en" dir="auto">Phylogenetic nomenclature</span></a></span>)</span></span>(《<span class="ilh-all" data-orig-title="国际系统发生命名法规" data-lang-code="en" data-lang-name="英语" data-foreign-title="PhyloCode"><span class="ilh-page"><a href="/w/index.php?title=%E5%9B%BD%E9%99%85%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%91%BD%E5%90%8D%E6%B3%95%E8%A7%84&amp;action=edit&amp;redlink=1" class="new" title="国际系统发生命名法规(页面不存在)">国际系统发生命名法规</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/PhyloCode" class="extiw" title="en:PhyloCode"><span lang="en" dir="auto">PhyloCode</span></a></span>)</span></span>》)</li> <li><a href="/wiki/DNA%E6%9D%A1%E5%BD%A2%E7%A0%81" title="DNA条形码">DNA&#8202;条形码</a></li> <li><span class="ilh-all" data-orig-title="系统发生比较方法" data-lang-code="en" data-lang-name="英语" data-foreign-title="Phylogenetic comparative methods"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E6%AF%94%E8%BE%83%E6%96%B9%E6%B3%95&amp;action=edit&amp;redlink=1" class="new" title="系统发生比较方法(页面不存在)">系统发生比较方法</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Phylogenetic_comparative_methods" class="extiw" title="en:Phylogenetic comparative methods"><span lang="en" dir="auto">Phylogenetic comparative methods</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="系统发生生态位保守性" data-lang-code="en" data-lang-name="英语" data-foreign-title="Phylogenetic niche conservatism"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E7%94%9F%E6%80%81%E4%BD%8D%E4%BF%9D%E5%AE%88%E6%80%A7&amp;action=edit&amp;redlink=1" class="new" title="系统发生生态位保守性(页面不存在)">系统发生生态位保守性</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Phylogenetic_niche_conservatism" class="extiw" title="en:Phylogenetic niche conservatism"><span lang="en" dir="auto">Phylogenetic niche conservatism</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="系统发生信号" data-lang-code="en" data-lang-name="英语" data-foreign-title="Phylogenetic signal"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E4%BF%A1%E5%8F%B7&amp;action=edit&amp;redlink=1" class="new" title="系统发生信号(页面不存在)">系統發生信號</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Phylogenetic_signal" class="extiw" title="en:Phylogenetic signal"><span lang="en" dir="auto">Phylogenetic signal</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="系统发生软件列表" data-lang-code="en" data-lang-name="英语" data-foreign-title="List of phylogenetics software"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E8%BD%AF%E4%BB%B6%E5%88%97%E8%A1%A8&amp;action=edit&amp;redlink=1" class="new" title="系统发生软件列表(页面不存在)">系统发生软件</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/List_of_phylogenetics_software" class="extiw" title="en:List of phylogenetics software"><span lang="en" dir="auto">List of phylogenetics software</span></a></span>)</span></span></li> <li><span class="ilh-all" data-orig-title="系统发生基因组学" data-lang-code="en" data-lang-name="英语" data-foreign-title="Phylogenomics"><span class="ilh-page"><a href="/w/index.php?title=%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%9F%BA%E5%9B%A0%E7%BB%84%E5%AD%A6&amp;action=edit&amp;redlink=1" class="new" title="系统发生基因组学(页面不存在)">系统发生基因组学</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Phylogenomics" class="extiw" title="en:Phylogenomics"><span lang="en" dir="auto">Phylogenomics</span></a></span>)</span></span></li> <li><a href="/wiki/%E8%A6%AA%E7%B7%A3%E5%9C%B0%E7%90%86%E5%AD%B8" title="親緣地理學">系统发生生物地理学</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">類群特徵</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0px"><div style="padding:0em 0.25em"> <ul><li><span class="ilh-all" data-orig-title="原始 (系统发生学)" data-lang-code="en" data-lang-name="英语" data-foreign-title="Primitive (phylogenetics)"><span class="ilh-page"><a href="/w/index.php?title=%E5%8E%9F%E5%A7%8B_(%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6)&amp;action=edit&amp;redlink=1" class="new" title="原始 (系统发生学)(页面不存在)">原始特徵</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Primitive_(phylogenetics)" class="extiw" title="en:Primitive (phylogenetics)"><span lang="en" dir="auto">Primitive (phylogenetics)</span></a></span>)</span></span>(<span class="ilh-all" data-orig-title="祖徵" data-lang-code="en" data-lang-name="英语" data-foreign-title="Plesiomorphy and symplesiomorphy"><span class="ilh-page"><a href="/w/index.php?title=%E7%A5%96%E5%BE%B5&amp;action=edit&amp;redlink=1" class="new" title="祖徵(页面不存在)">祖徵/共有祖徵</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Plesiomorphy_and_symplesiomorphy" class="extiw" title="en:Plesiomorphy and symplesiomorphy"><span lang="en" dir="auto">Plesiomorphy and symplesiomorphy</span></a></span>)</span></span>)</li> <li>衍生特徵(<a href="/wiki/%E5%85%B1%E6%9C%89%E8%A1%8D%E5%BE%B5" title="共有衍徵">衍徵/共有衍徵</a></li> <li><span class="ilh-all" data-orig-title="自有衍徵" data-lang-code="en" data-lang-name="英语" data-foreign-title="Autapomorphy"><span class="ilh-page"><a href="/w/index.php?title=%E8%87%AA%E6%9C%89%E8%A1%8D%E5%BE%B5&amp;action=edit&amp;redlink=1" class="new" title="自有衍徵(页面不存在)">自有衍徵</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Autapomorphy" class="extiw" title="en:Autapomorphy"><span lang="en" dir="auto">Autapomorphy</span></a></span>)</span></span>)</li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">類群性質</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0px"><div style="padding:0em 0.25em"> <ul><li><a href="/wiki/%E5%8D%95%E7%B3%BB" title="单系">单系群</a></li> <li><a href="/wiki/%E4%B8%A6%E7%B3%BB%E7%BE%A4" title="並系群">並系群</a></li> <li><a href="/wiki/%E5%A4%9A%E7%B3%BB%E7%BE%A4" title="多系群">多系群(複系群)</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">其他術語</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0px"><div style="padding:0em 0.25em"> <ul><li><a href="/wiki/%E5%86%A0%E7%BE%A4" title="冠群">冠群/幹群/泛群(總群)</a></li> <li><a href="/wiki/%E5%A7%90%E5%A6%B9%E7%BE%A4" title="姐妹群">姐妹群(姊妹群)</a></li> <li><a href="/wiki/%E5%A4%96%E7%BE%A4" title="外群">外群</a></li> <li><a href="/wiki/%E5%9F%BA%E7%BE%A4" title="基群">基群</a></li> <li><span class="ilh-all" data-orig-title="超樹" data-lang-code="en" data-lang-name="英语" data-foreign-title="Supertree"><span class="ilh-page"><a href="/w/index.php?title=%E8%B6%85%E6%A8%B9&amp;action=edit&amp;redlink=1" class="new" title="超樹(页面不存在)">超樹</a></span><span class="noprint ilh-comment">(<span class="ilh-lang">英语</span><span class="ilh-colon">:</span><span class="ilh-link"><a href="https://en.wikipedia.org/wiki/Supertree" class="extiw" title="en:Supertree"><span lang="en" dir="auto">Supertree</span></a></span>)</span></span></li></ul> </div></td></tr><tr><td class="navbox-abovebelow" colspan="2" style="font-weight:bold;"><div> <ul><li><span typeof="mw:File"><span><img src="//upload.wikimedia.org/wikipedia/commons/thumb/e/e0/Symbol_question.svg/16px-Symbol_question.svg.png" decoding="async" width="16" height="16" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/e/e0/Symbol_question.svg/23px-Symbol_question.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/e/e0/Symbol_question.svg/31px-Symbol_question.svg.png 2x" data-file-width="180" data-file-height="185" /></span></span>&#160;<a href="/wiki/Category:%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="Category:系统发生学">相關頁面</a></li> <li><span typeof="mw:File"><span title="共享资源页面"><img alt="共享资源页面" src="//upload.wikimedia.org/wikipedia/commons/thumb/4/4a/Commons-logo.svg/12px-Commons-logo.svg.png" decoding="async" width="12" height="16" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/4/4a/Commons-logo.svg/18px-Commons-logo.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/4/4a/Commons-logo.svg/24px-Commons-logo.svg.png 2x" data-file-width="1024" data-file-height="1376" /></span></span>&#160;<a href="https://commons.wikimedia.org/wiki/Category:Phylogenetics" class="extiw" title="commons:Category:Phylogenetics">共享資源</a></li></ul> </div></td></tr></tbody></table></div> <!-- NewPP limit report Parsed by mw‐api‐int.codfw.main‐648bd44df8‐7l4md Cached time: 20241116024253 Cache expiry: 2592000 Reduced expiry: false Complications: [show‐toc] CPU time usage: 0.742 seconds Real time usage: 0.916 seconds Preprocessor visited node count: 8792/1000000 Post‐expand include size: 111638/2097152 bytes Template argument size: 8500/2097152 bytes Highest expansion depth: 27/100 Expensive parser function count: 31/500 Unstrip recursion depth: 0/20 Unstrip post‐expand size: 22868/5000000 bytes Lua time usage: 0.352/10.000 seconds Lua memory usage: 24984883/52428800 bytes Number of Wikibase entities loaded: 0/400 --> <!-- Transclusion expansion time report (%,ms,calls,template) 100.00% 744.658 1 -total 27.99% 208.441 23 Template:Lang 25.62% 190.808 23 Template:Category_handler 24.61% 183.270 1 Template:系统发生学 24.27% 180.727 1 Template:Navbox 19.68% 146.567 1 Template:Lang-en 16.62% 123.795 23 Template:Category_handler/numbered 14.92% 111.091 23 Template:Namespace_detect 13.50% 100.505 1 Template:Reflist 12.80% 95.286 23 Template:Str_mid --> <!-- Saved in parser cache with key zhwiki:pcache:idhash:667597-0!canonical!zh and timestamp 20241116024253 and revision id 71375302. Rendering was triggered because: api-parse --> </div><!--esi <esi:include src="/esitest-fa8a495983347898/content" /> --><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">检索自“<a dir="ltr" href="https://zh.wikipedia.org/w/index.php?title=最大簡約法&amp;oldid=71375302">https://zh.wikipedia.org/w/index.php?title=最大簡約法&amp;oldid=71375302</a>”</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Special:%E9%A1%B5%E9%9D%A2%E5%88%86%E7%B1%BB" title="Special:页面分类">分类</a>:​<ul><li><a href="/wiki/Category:%E7%94%9F%E7%89%A9%E4%BF%A1%E6%81%AF%E5%AD%B8" title="Category:生物信息學">生物信息學</a></li><li><a href="/wiki/Category:%E7%B3%BB%E7%BB%9F%E5%8F%91%E7%94%9F%E5%AD%A6" title="Category:系统发生学">系统发生学</a></li></ul></div><div id="mw-hidden-catlinks" class="mw-hidden-catlinks mw-hidden-cats-hidden">隐藏分类:​<ul><li><a href="/wiki/Category:%E5%90%AB%E6%9C%89%E8%BF%87%E6%97%B6%E5%8F%82%E6%95%B0%E7%9A%84%E5%BC%95%E7%94%A8%E7%9A%84%E9%A1%B5%E9%9D%A2" title="Category:含有过时参数的引用的页面">含有过时参数的引用的页面</a></li><li><a href="/wiki/Category:%E5%90%AB%E6%9C%89%E8%8B%B1%E8%AA%9E%E7%9A%84%E6%A2%9D%E7%9B%AE" title="Category:含有英語的條目">含有英語的條目</a></li><li><a href="/wiki/Category:%E6%9C%89%E6%9C%AA%E5%88%97%E6%98%8E%E6%9D%A5%E6%BA%90%E8%AF%AD%E5%8F%A5%E7%9A%84%E6%9D%A1%E7%9B%AE" title="Category:有未列明来源语句的条目">有未列明来源语句的条目</a></li></ul></div></div> </div> </main> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> 本页面最后修订于2022年4月29日 (星期五) 06:15。</li> <li id="footer-info-copyright">本站的全部文字在<a rel="nofollow" class="external text" href="//creativecommons.org/licenses/by-sa/4.0/deed.zh">知识共享 署名-相同方式共享 4.0协议</a>之条款下提供,附加条款亦可能应用。(请参阅<a class="external text" href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use">使用条款</a>)<br /> Wikipedia&#174;和维基百科标志是<a rel="nofollow" class="external text" href="https://wikimediafoundation.org/zh">维基媒体基金会</a>的注册商标;维基&#8482;是维基媒体基金会的商标。<br /> 维基媒体基金会是按美国国內稅收法501(c)(3)登记的<a class="external text" href="https://donate.wikimedia.org/wiki/Special:MyLanguage/Tax_deductibility">非营利慈善机构</a>。<br /></li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">隐私政策</a></li> <li id="footer-places-about"><a href="/wiki/Wikipedia:%E5%85%B3%E4%BA%8E">关于维基百科</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Wikipedia:%E5%85%8D%E8%B4%A3%E5%A3%B0%E6%98%8E">免责声明</a></li> <li id="footer-places-wm-codeofconduct"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct">行为准则</a></li> <li id="footer-places-developers"><a href="https://developer.wikimedia.org">开发者</a></li> <li id="footer-places-statslink"><a href="https://stats.wikimedia.org/#/zh.wikipedia.org">统计</a></li> <li id="footer-places-cookiestatement"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement">Cookie声明</a></li> <li id="footer-places-mobileview"><a href="//zh.m.wikipedia.org/w/index.php?title=%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95&amp;mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">手机版视图</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-copyrightico"><a href="https://wikimediafoundation.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/static/images/footer/wikimedia-button.svg" width="84" height="29" alt="Wikimedia Foundation" loading="lazy"></a></li> <li id="footer-poweredbyico"><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/w/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a></li> </ul> </footer> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw-web.codfw.main-f69cdc8f6-sf2cc","wgBackendResponseTime":228,"wgPageParseReport":{"limitreport":{"cputime":"0.742","walltime":"0.916","ppvisitednodes":{"value":8792,"limit":1000000},"postexpandincludesize":{"value":111638,"limit":2097152},"templateargumentsize":{"value":8500,"limit":2097152},"expansiondepth":{"value":27,"limit":100},"expensivefunctioncount":{"value":31,"limit":500},"unstrip-depth":{"value":0,"limit":20},"unstrip-size":{"value":22868,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 744.658 1 -total"," 27.99% 208.441 23 Template:Lang"," 25.62% 190.808 23 Template:Category_handler"," 24.61% 183.270 1 Template:系统发生学"," 24.27% 180.727 1 Template:Navbox"," 19.68% 146.567 1 Template:Lang-en"," 16.62% 123.795 23 Template:Category_handler/numbered"," 14.92% 111.091 23 Template:Namespace_detect"," 13.50% 100.505 1 Template:Reflist"," 12.80% 95.286 23 Template:Str_mid"]},"scribunto":{"limitreport-timeusage":{"value":"0.352","limit":"10.000"},"limitreport-memusage":{"value":24984883,"limit":52428800}},"cachereport":{"origin":"mw-api-int.codfw.main-648bd44df8-7l4md","timestamp":"20241116024253","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"\u6700\u5927\u7c21\u7d04\u6cd5","url":"https:\/\/zh.wikipedia.org\/wiki\/%E6%9C%80%E5%A4%A7%E7%B0%A1%E7%B4%84%E6%B3%95","sameAs":"http:\/\/www.wikidata.org\/entity\/Q1805805","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q1805805","author":{"@type":"Organization","name":"\u7ef4\u57fa\u5a92\u4f53\u9879\u76ee\u8d21\u732e\u8005"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2007-11-30T10:35:30Z","dateModified":"2022-04-29T06:15:05Z","headline":"\u751f\u7269\u5b78\u4e0a\u7528\u65bc\u69cb\u5efa\u7cfb\u7d71\u767c\u751f\u6a39\u7684\u4e00\u7a2e\u65b9\u6cd5"}</script> </body> </html>

Pages: 1 2 3 4 5 6 7 8 9 10