The DOI matches its Crossref record.
Perfect Phylogenetic Networks with Recombination
Abstract
The perfect phylogeny problem is a classical problem in evolutionary tree construction. In this paper, we propose a new model called phylogenetic network with recombination that takes recombination events into account. We show that the problem of finding a perfect phylogenetic network with the minimum number of recombination events is NP-hard; we also present an efficient polynomial time algorithm for an interesting restricted version of the problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Horizontal gene transfer, genome innovation and evolution
Gogarten, J. P., & Townsend, J. P. (2005) · Nature Reviews Microbiology · doi:10.1038/nrmicro1204 · Cited by 1,020
A method for genome-wide genealogy estimation for thousands of samples
Speidel, L., Forest, M., Shi, S., & Myers, S. R. (2019) · Nature Genetics · doi:10.1038/s41588-019-0484-x · Cited by 480
Genome-Wide Inference of Ancestral Recombination Graphs
Rasmussen, M. D., Hubisz, M. J., Gronau, I., & Siepel, A. (2014) · PLoS Genetics · doi:10.1371/journal.pgen.1004342 · Cited by 371
Inferring whole-genome histories in large population datasets
Kelleher, J., Wong, Y., Wohns, A. W., Fadil, C., Albers, P. K., & McVean, G. (2019) · Nature Genetics · doi:10.1038/s41588-019-0483-y · Cited by 313
Constructing Minimal Ancestral Recombination Graphs
Song, Y. S., & Hein, J. (2005) · Journal of Computational Biology · doi:10.1089/cmb.2005.12.147 · Cited by 130
Metadata
- Authors
- Wang, L., Zhang, K., & Zhang, L.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 2001-02
- Volume
- 8
- Issue
- 1
- Pages
- 69-78
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2054547415
- Cited by
- 198
- References
- 0
- FWCI
- 2.06
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Perfect Phylogenetic Networks with Recombination. https://app.cochat.ai/papers/10.1089/106652701300099119
- The paper
- Wang, L., Zhang, K., & Zhang, L. (2001). Perfect Phylogenetic Networks with Recombination. Journal of Computational Biology. https://doi.org/10.1089/106652701300099119
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.