Perfect phylogenetic networks with recombination

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

8 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationProceedings of the 2001 ACM Symposium on Applied Computing, SAC 2001
PublisherAssociation for Computing Machinery
Pages46-50
ISBN (print)1581132875, 9781581132878
Publication statusPublished - 1 Mar 2001

Publication series

NameProceedings of the ACM Symposium on Applied Computing

Conference

Title2001 ACM Symposium on Applied Computing, SAC 2001
PlaceUnited States
CityLas Vegas
Period11 - 14 March 2001

Abstract

The perfect phylogen y problem is a classical problem in evolutionary tree construction. In this paper, we propose a new model called phylogenetic netw ork with recombination that tak es recombination events into account. We show that the problem of finding a perfect phylogenetic netw ork with the minimum number of recombination events is NP-hard; we also present an eficient polynomial time algorithm for an interesting restricted version of the problem.

Bibliographic Note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Citation Format(s)

Perfect phylogenetic networks with recombination. / Wang, Lusheng; Zhang, Kaizhong; Zhang, Louxin.
Proceedings of the 2001 ACM Symposium on Applied Computing, SAC 2001. Association for Computing Machinery, 2001. p. 46-50 (Proceedings of the ACM Symposium on Applied Computing).

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review