A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies
Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters has a perfect phylogeny if and only if every subset of three characters has a perfect phylogeny. They also gave a complete characterization of the sets of three three-state characters that do not have a perfect phylogeny....
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 | Shutters, Brad Fernández-Baca, David |
| description | Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters
has a perfect phylogeny if and only if every subset of three characters has a
perfect phylogeny. They also gave a complete characterization of the sets of
three three-state characters that do not have a perfect phylogeny. However, it
is not clear from their characterization how to find a subset of three
characters that does not have a perfect phylogeny without testing all triples
of characters. In this note, we build upon their result by giving a simple
characterization of when a set of three-state characters does not have a
perfect phylogeny that can be inferred from testing all pairs of characters. |
| doi_str_mv | 10.48550/arxiv.1106.0874 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1106_0874</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1106_0874</sourcerecordid><originalsourceid>FETCH-LOGICAL-a654-a15c64d8212154b005358e85e5b2b3056f0a22581ffcd4943cb2815cdd349d353</originalsourceid><addsrcrecordid>eNotj8lOwzAURb1hgQp7Vsg_kODpBXdZRUxSUSslWxR5eCaW0qRyDKJ8PR1Y3cXVPbqHkDvOSqUB2INJP_G75JxVJdOP6pp8rGgTd_sBad2bZFzGFH9NjtNIp0Bzj_Q9jnFnBrqxc05f7lw1mGcapkTbPiEWTTYZ6RZTQJfptj8M0yeOEecbchXMMOPtfy5I-_zU1q_FevPyVq_WhalAFYaDq5TXggsOyjIGEjRqQLDCSgZVYEYI0DwE59VSSWeFPm68l2rpJcgFub9gz3rdPh0Pp0N30uxOmvIP79RNEQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies</title><source>arXiv.org</source><creator>Shutters, Brad ; Fernández-Baca, David</creator><creatorcontrib>Shutters, Brad ; Fernández-Baca, David</creatorcontrib><description>Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters
has a perfect phylogeny if and only if every subset of three characters has a
perfect phylogeny. They also gave a complete characterization of the sets of
three three-state characters that do not have a perfect phylogeny. However, it
is not clear from their characterization how to find a subset of three
characters that does not have a perfect phylogeny without testing all triples
of characters. In this note, we build upon their result by giving a simple
characterization of when a set of three-state characters does not have a
perfect phylogeny that can be inferred from testing all pairs of characters.</description><identifier>DOI: 10.48550/arxiv.1106.0874</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Discrete Mathematics</subject><creationdate>2011-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.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/1106.0874$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1106.0874$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Shutters, Brad</creatorcontrib><creatorcontrib>Fernández-Baca, David</creatorcontrib><title>A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies</title><description>Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters
has a perfect phylogeny if and only if every subset of three characters has a
perfect phylogeny. They also gave a complete characterization of the sets of
three three-state characters that do not have a perfect phylogeny. However, it
is not clear from their characterization how to find a subset of three
characters that does not have a perfect phylogeny without testing all triples
of characters. In this note, we build upon their result by giving a simple
characterization of when a set of three-state characters does not have a
perfect phylogeny that can be inferred from testing all pairs of characters.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Discrete Mathematics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8lOwzAURb1hgQp7Vsg_kODpBXdZRUxSUSslWxR5eCaW0qRyDKJ8PR1Y3cXVPbqHkDvOSqUB2INJP_G75JxVJdOP6pp8rGgTd_sBad2bZFzGFH9NjtNIp0Bzj_Q9jnFnBrqxc05f7lw1mGcapkTbPiEWTTYZ6RZTQJfptj8M0yeOEecbchXMMOPtfy5I-_zU1q_FevPyVq_WhalAFYaDq5TXggsOyjIGEjRqQLDCSgZVYEYI0DwE59VSSWeFPm68l2rpJcgFub9gz3rdPh0Pp0N30uxOmvIP79RNEQ</recordid><startdate>20110605</startdate><enddate>20110605</enddate><creator>Shutters, Brad</creator><creator>Fernández-Baca, David</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20110605</creationdate><title>A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies</title><author>Shutters, Brad ; Fernández-Baca, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a654-a15c64d8212154b005358e85e5b2b3056f0a22581ffcd4943cb2815cdd349d353</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Discrete Mathematics</topic><toplevel>online_resources</toplevel><creatorcontrib>Shutters, Brad</creatorcontrib><creatorcontrib>Fernández-Baca, David</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shutters, Brad</au><au>Fernández-Baca, David</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies</atitle><date>2011-06-05</date><risdate>2011</risdate><abstract>Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters
has a perfect phylogeny if and only if every subset of three characters has a
perfect phylogeny. They also gave a complete characterization of the sets of
three three-state characters that do not have a perfect phylogeny. However, it
is not clear from their characterization how to find a subset of three
characters that does not have a perfect phylogeny without testing all triples
of characters. In this note, we build upon their result by giving a simple
characterization of when a set of three-state characters does not have a
perfect phylogeny that can be inferred from testing all pairs of characters.</abstract><doi>10.48550/arxiv.1106.0874</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1106.0874 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1106_0874 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics |
| title | A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T09%3A16%3A48IST&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=A%20Simple%20Characterization%20of%20the%20Minimal%20Obstruction%20Sets%20for%20Three-State%20Perfect%20Phylogenies&rft.au=Shutters,%20Brad&rft.date=2011-06-05&rft_id=info:doi/10.48550/arxiv.1106.0874&rft_dat=%3Carxiv_GOX%3E1106_0874%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 |