Scholarlink

<p>Algebraic techniques in phylogenetics have historically been successful at proving identifiability results and have also led to novel reconstruction algorithms. In this paper, we study the ideal of phylogenetic invariants of the Cavender-Farris-Neyman (CFN) model on a phylogenetic network with the goal of providing a description of the invariants which is useful for network inference. It was previously shown that to characterize the invariants of any level-1 network, it suffices to understand all sunlet networks, which are those consisting of a single cycle with a leaf adjacent to each cycle vertex. We show that the parameterization of an affine open patch of the CFN sunlet model, which intersects the probability simplex, factors through the space of skew-symmetric matrices via Pfaffians. We then show that this affine patch is isomorphic to a determinantal variety and give an explicit Gröbner basis for the associated ideal, which involves only <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\left( {\begin{array}{c}n\\ 2\end{array}}\right) \)</EquationSource> <EquationSource Format="MATHML"><math> <mfenced close=")" open="("> <mrow> <mtable> <mtr> <mtd> <mi>n</mi> </mtd> </mtr> <mtr> <mtd> <mrow> <mrow /> <mn>2</mn> </mrow> </mtd> </mtr> </mtable> </mrow> </mfenced> </math></EquationSource> </InlineEquation> coordinates rather than <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(2^{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mn>2</mn> <mi>n</mi> </msup> </math></EquationSource> </InlineEquation>. Lastly, we show that sunlet networks with at least 6 leaves are identifiable using only these polynomials and run extensive simulations, which show that these polynomials can be used to accurately infer the correct network from DNA sequence data.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Pfaffian Structure of CFN Phylogenetic Networks

  • 期刊论文

  • 发表日期：

    2025年12月24日

查看全文
  • Joseph Cummings,
  • Elizabeth Gross,
  • Benjamin Hollering,
  • Samuel Martin,
  • Ikenna Nometa

摘要

Algebraic techniques in phylogenetics have historically been successful at proving identifiability results and have also led to novel reconstruction algorithms. In this paper, we study the ideal of phylogenetic invariants of the Cavender-Farris-Neyman (CFN) model on a phylogenetic network with the goal of providing a description of the invariants which is useful for network inference. It was previously shown that to characterize the invariants of any level-1 network, it suffices to understand all sunlet networks, which are those consisting of a single cycle with a leaf adjacent to each cycle vertex. We show that the parameterization of an affine open patch of the CFN sunlet model, which intersects the probability simplex, factors through the space of skew-symmetric matrices via Pfaffians. We then show that this affine patch is isomorphic to a determinantal variety and give an explicit Gröbner basis for the associated ideal, which involves only \(\left( {\begin{array}{c}n\\ 2\end{array}}\right) \) n 2 coordinates rather than \(2^{n}\) 2 n . Lastly, we show that sunlet networks with at least 6 leaves are identifiable using only these polynomials and run extensive simulations, which show that these polynomials can be used to accurately infer the correct network from DNA sequence data.