dc.contributor.author |
Cordue, P |
en |
dc.contributor.author |
Linz, Simone |
en |
dc.contributor.author |
Semple, C |
en |
dc.date.accessioned |
2015-02-03T23:39:57Z |
en |
dc.date.issued |
2014-10 |
en |
dc.identifier.citation |
Bulletin of Mathematical Biology, 2014, 76 (10), pp. 2664 - 2679 |
en |
dc.identifier.issn |
0092-8240 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/24396 |
en |
dc.description.abstract |
In the last decade, the use of phylogenetic networks to analyze the evolution of species whose past is likely to include reticulation events, such as horizontal gene transfer or hybridization, has gained popularity among evolutionary biologists. Nevertheless, the evolution of a particular gene can generally be described without reticulation events and therefore be represented by a phylogenetic tree. While this is not in contrast to each other, it places emphasis on the necessity of algorithms that analyze and summarize the tree-like information that is contained in a phylogenetic network. We contribute to the toolbox of such algorithms by investigating the question of whether or not a phylogenetic network embeds a tree twice and give a quadratic-time algorithm to solve this problem for a class of networks that is more general than tree-child networks. |
en |
dc.format.medium |
Print-Electronic |
en |
dc.language |
eng |
en |
dc.relation.ispartofseries |
Bulletin of Mathematical Biology |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.springer.com/gp/open-access/authors-rights/self-archiving-policy/2124
http://www.sherpa.ac.uk/romeo/issn/0092-8240/ |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Phylogenetic networks that display a tree twice |
en |
dc.type |
Journal Article |
en |
dc.identifier.doi |
10.1007/s11538-014-0032-x |
en |
pubs.issue |
10 |
en |
pubs.begin-page |
2664 |
en |
pubs.volume |
76 |
en |
dc.description.version |
AM - Accepted Manuscript |
en |
dc.identifier.pmid |
25245396 |
en |
pubs.end-page |
2679 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.subtype |
Article |
en |
pubs.elements-id |
460403 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
dc.identifier.eissn |
1522-9602 |
en |
pubs.record-created-at-source-date |
2015-02-04 |
en |
pubs.dimensions-id |
25245396 |
en |