Maximum Covering Subtrees for Phylogenetic Networks

Bibliographic Details
Title:	Maximum Covering Subtrees for Phylogenetic Networks
Authors:	Davidov, Nathan, Hernandez, Amanda, Jian, Justin, McKenna, Patrick, Medlin, K. A., Mojumder, Roadra, Owen, Megan, Quijano, Andrew, Rodriguez, Amanda, John, Katherine St., Thai, Katherine, Uraga, Meliza
Publication Year:	2020
Collection:	Computer Science Quantitative Biology
Subject Terms:	Quantitative Biology - Populations and Evolution, Computer Science - Data Structures and Algorithms
More Details:	Tree-based phylogenetic networks, which may be roughly defined as leaf-labeled networks built by adding arcs only between the original tree edges, have elegant properties for modeling evolutionary histories. We answer an open question of Francis, Semple, and Steel about the complexity of determining how far a phylogenetic network is from being tree-based, including non-binary phylogenetic networks. We show that finding a phylogenetic tree covering the maximum number of nodes in a phylogenetic network can be be computed in polynomial time via an encoding into a minimum-cost maximum flow problem.
Document Type:	Working Paper
DOI:	10.1109/TCBB.2020.3040910
Access URL:	http://arxiv.org/abs/2009.12413
Accession Number:	edsarx.2009.12413
Database:	arXiv

FullText	Text: Availability: 0 CustomLinks: – Url: http://arxiv.org/abs/2009.12413 Name: EDS - Arxiv Category: fullText Text: View this record from Arxiv MouseOverText: View this record from Arxiv – Url: https://resolver.ebsco.com/c/xy5jbn/result?sid=EBSCO:edsarx&genre=article&issn=&ISBN=&volume=&issue=&date=20200925&spage=&pages=&title=Maximum Covering Subtrees for Phylogenetic Networks&atitle=Maximum%20Covering%20Subtrees%20for%20Phylogenetic%20Networks&aulast=Davidov%2C%20Nathan&id=DOI:10.1109/TCBB.2020.3040910 Name: Full Text Finder (for New FTF UI) (s8985755) Category: fullText Text: Find It @ SCU Libraries MouseOverText: Find It @ SCU Libraries
Header	DbId: edsarx DbLabel: arXiv An: edsarx.2009.12413 RelevancyScore: 1008 AccessLevel: 3 PubType: Report PubTypeId: report PreciseRelevancyScore: 1007.72589111328
IllustrationInfo
Items	– Name: Title Label: Title Group: Ti Data: Maximum Covering Subtrees for Phylogenetic Networks – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Davidov%2C+Nathan%22">Davidov, Nathan</searchLink><br /><searchLink fieldCode="AR" term="%22Hernandez%2C+Amanda%22">Hernandez, Amanda</searchLink><br /><searchLink fieldCode="AR" term="%22Jian%2C+Justin%22">Jian, Justin</searchLink><br /><searchLink fieldCode="AR" term="%22McKenna%2C+Patrick%22">McKenna, Patrick</searchLink><br /><searchLink fieldCode="AR" term="%22Medlin%2C+K%2E+A%2E%22">Medlin, K. A.</searchLink><br /><searchLink fieldCode="AR" term="%22Mojumder%2C+Roadra%22">Mojumder, Roadra</searchLink><br /><searchLink fieldCode="AR" term="%22Owen%2C+Megan%22">Owen, Megan</searchLink><br /><searchLink fieldCode="AR" term="%22Quijano%2C+Andrew%22">Quijano, Andrew</searchLink><br /><searchLink fieldCode="AR" term="%22Rodriguez%2C+Amanda%22">Rodriguez, Amanda</searchLink><br /><searchLink fieldCode="AR" term="%22John%2C+Katherine+St%2E%22">John, Katherine St.</searchLink><br /><searchLink fieldCode="AR" term="%22Thai%2C+Katherine%22">Thai, Katherine</searchLink><br /><searchLink fieldCode="AR" term="%22Uraga%2C+Meliza%22">Uraga, Meliza</searchLink> – Name: DatePubCY Label: Publication Year Group: Date Data: 2020 – Name: Subset Label: Collection Group: HoldingsInfo Data: Computer Science<br />Quantitative Biology – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Quantitative+Biology+-+Populations+and+Evolution%22">Quantitative Biology - Populations and Evolution</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+Science+-+Data+Structures+and+Algorithms%22">Computer Science - Data Structures and Algorithms</searchLink> – Name: Abstract Label: Description Group: Ab Data: Tree-based phylogenetic networks, which may be roughly defined as leaf-labeled networks built by adding arcs only between the original tree edges, have elegant properties for modeling evolutionary histories. We answer an open question of Francis, Semple, and Steel about the complexity of determining how far a phylogenetic network is from being tree-based, including non-binary phylogenetic networks. We show that finding a phylogenetic tree covering the maximum number of nodes in a phylogenetic network can be be computed in polynomial time via an encoding into a minimum-cost maximum flow problem. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Working Paper – Name: DOI Label: DOI Group: ID Data: 10.1109/TCBB.2020.3040910 – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="http://arxiv.org/abs/2009.12413" linkWindow="_blank">http://arxiv.org/abs/2009.12413</link> – Name: AN Label: Accession Number Group: ID Data: edsarx.2009.12413
PLink	https://login.libproxy.scu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2009.12413
RecordInfo	BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/TCBB.2020.3040910 Subjects: – SubjectFull: Quantitative Biology - Populations and Evolution Type: general – SubjectFull: Computer Science - Data Structures and Algorithms Type: general Titles: – TitleFull: Maximum Covering Subtrees for Phylogenetic Networks Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Davidov, Nathan – PersonEntity: Name: NameFull: Hernandez, Amanda – PersonEntity: Name: NameFull: Jian, Justin – PersonEntity: Name: NameFull: McKenna, Patrick – PersonEntity: Name: NameFull: Medlin, K. A. – PersonEntity: Name: NameFull: Mojumder, Roadra – PersonEntity: Name: NameFull: Owen, Megan – PersonEntity: Name: NameFull: Quijano, Andrew – PersonEntity: Name: NameFull: Rodriguez, Amanda – PersonEntity: Name: NameFull: John, Katherine St. – PersonEntity: Name: NameFull: Thai, Katherine – PersonEntity: Name: NameFull: Uraga, Meliza IsPartOfRelationships: – BibEntity: Dates: – D: 25 M: 09 Type: published Y: 2020
ResultId	1