Defining phylogenetic networks using ancestral profiles
Rooted phylogenetic networks provide a more complete representation of the ancestral relationship between species than phylogenetic trees when reticulate evolutionary processes are at play. One way to reconstruct a phylogenetic network is to consider its `ancestral profile' (the number of paths...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Bai, Allan Erdos, Peter Semple, Charles Steel, Mike |
description | Rooted phylogenetic networks provide a more complete representation of the
ancestral relationship between species than phylogenetic trees when reticulate
evolutionary processes are at play. One way to reconstruct a phylogenetic
network is to consider its `ancestral profile' (the number of paths from each
ancestral vertex to each leaf). In general, this information does not uniquely
determine the underlying phylogenetic network. A recent paper considered a new
class of phylogenetic networks called `orchard networks' where this uniqueness
was claimed to hold. Here we show that an additional restriction on the
network, that of being `stack-free', is required in order for the original
uniqueness claim to hold. On the other hand, if the additional stack-free
restriction is lifted, we establish an alternative result; namely, there is
uniqueness within the class of orchard networks up to the resolution of
vertices of high in-degree. |
doi_str_mv | 10.48550/arxiv.2012.00109 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2012_00109</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2012_00109</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-a6a6b9bd201e27a57d3ea7d1feb8328a3d890ae7c05c2fabe96b4a6d6da051a43</originalsourceid><addsrcrecordid>eNotj71OwzAUhb0woMIDMJEXaLi2YzseUWkBqVKX7tF1fF2spklkl5a-PWlh-c5wpPPD2BOHsqqVghdMP_FUCuCiBOBg75l5oxD72O-K8evSDTvq6RjbYuJ5SPtcfOerh31L-ZiwK8Y0hNhRfmB3AbtMj_86Y9vVcrv4mK8375-L1_UctbETUDvr_NRIwqAyXhIazwO5Wooapa8tIJkWVCsCOrLaVai99giKYyVn7Pkv9ra8GVM8YLo01wfN7YH8BRb6QkE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Defining phylogenetic networks using ancestral profiles</title><source>arXiv.org</source><creator>Bai, Allan ; Erdos, Peter ; Semple, Charles ; Steel, Mike</creator><creatorcontrib>Bai, Allan ; Erdos, Peter ; Semple, Charles ; Steel, Mike</creatorcontrib><description>Rooted phylogenetic networks provide a more complete representation of the
ancestral relationship between species than phylogenetic trees when reticulate
evolutionary processes are at play. One way to reconstruct a phylogenetic
network is to consider its `ancestral profile' (the number of paths from each
ancestral vertex to each leaf). In general, this information does not uniquely
determine the underlying phylogenetic network. A recent paper considered a new
class of phylogenetic networks called `orchard networks' where this uniqueness
was claimed to hold. Here we show that an additional restriction on the
network, that of being `stack-free', is required in order for the original
uniqueness claim to hold. On the other hand, if the additional stack-free
restriction is lifted, we establish an alternative result; namely, there is
uniqueness within the class of orchard networks up to the resolution of
vertices of high in-degree.</description><identifier>DOI: 10.48550/arxiv.2012.00109</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2020-11</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2012.00109$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2012.00109$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bai, Allan</creatorcontrib><creatorcontrib>Erdos, Peter</creatorcontrib><creatorcontrib>Semple, Charles</creatorcontrib><creatorcontrib>Steel, Mike</creatorcontrib><title>Defining phylogenetic networks using ancestral profiles</title><description>Rooted phylogenetic networks provide a more complete representation of the
ancestral relationship between species than phylogenetic trees when reticulate
evolutionary processes are at play. One way to reconstruct a phylogenetic
network is to consider its `ancestral profile' (the number of paths from each
ancestral vertex to each leaf). In general, this information does not uniquely
determine the underlying phylogenetic network. A recent paper considered a new
class of phylogenetic networks called `orchard networks' where this uniqueness
was claimed to hold. Here we show that an additional restriction on the
network, that of being `stack-free', is required in order for the original
uniqueness claim to hold. On the other hand, if the additional stack-free
restriction is lifted, we establish an alternative result; namely, there is
uniqueness within the class of orchard networks up to the resolution of
vertices of high in-degree.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAUhb0woMIDMJEXaLi2YzseUWkBqVKX7tF1fF2spklkl5a-PWlh-c5wpPPD2BOHsqqVghdMP_FUCuCiBOBg75l5oxD72O-K8evSDTvq6RjbYuJ5SPtcfOerh31L-ZiwK8Y0hNhRfmB3AbtMj_86Y9vVcrv4mK8375-L1_UctbETUDvr_NRIwqAyXhIazwO5Wooapa8tIJkWVCsCOrLaVai99giKYyVn7Pkv9ra8GVM8YLo01wfN7YH8BRb6QkE</recordid><startdate>20201130</startdate><enddate>20201130</enddate><creator>Bai, Allan</creator><creator>Erdos, Peter</creator><creator>Semple, Charles</creator><creator>Steel, Mike</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20201130</creationdate><title>Defining phylogenetic networks using ancestral profiles</title><author>Bai, Allan ; Erdos, Peter ; Semple, Charles ; Steel, Mike</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-a6a6b9bd201e27a57d3ea7d1feb8328a3d890ae7c05c2fabe96b4a6d6da051a43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Bai, Allan</creatorcontrib><creatorcontrib>Erdos, Peter</creatorcontrib><creatorcontrib>Semple, Charles</creatorcontrib><creatorcontrib>Steel, Mike</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bai, Allan</au><au>Erdos, Peter</au><au>Semple, Charles</au><au>Steel, Mike</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Defining phylogenetic networks using ancestral profiles</atitle><date>2020-11-30</date><risdate>2020</risdate><abstract>Rooted phylogenetic networks provide a more complete representation of the
ancestral relationship between species than phylogenetic trees when reticulate
evolutionary processes are at play. One way to reconstruct a phylogenetic
network is to consider its `ancestral profile' (the number of paths from each
ancestral vertex to each leaf). In general, this information does not uniquely
determine the underlying phylogenetic network. A recent paper considered a new
class of phylogenetic networks called `orchard networks' where this uniqueness
was claimed to hold. Here we show that an additional restriction on the
network, that of being `stack-free', is required in order for the original
uniqueness claim to hold. On the other hand, if the additional stack-free
restriction is lifted, we establish an alternative result; namely, there is
uniqueness within the class of orchard networks up to the resolution of
vertices of high in-degree.</abstract><doi>10.48550/arxiv.2012.00109</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2012.00109 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2012_00109 |
source | arXiv.org |
subjects | Mathematics - Combinatorics |
title | Defining phylogenetic networks using ancestral profiles |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T18%3A06%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Defining%20phylogenetic%20networks%20using%20ancestral%20profiles&rft.au=Bai,%20Allan&rft.date=2020-11-30&rft_id=info:doi/10.48550/arxiv.2012.00109&rft_dat=%3Carxiv_GOX%3E2012_00109%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |