Perfect phylogenies via the Minimum Uncovering Branching Problem: Efficiently Solvable Cases
- DOI
- 10.1109/tcbbio.2025.3580476
- Published
- 2025-09
- Container
- IEEE Transactions on Computational Biology and Bioinformatics
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1109/tcbbio.2025.3580476,
title = {Perfect phylogenies via the Minimum Uncovering Branching Problem: Efficiently Solvable Cases},
author = {Narmina Baghirova and Esther Galby and Martin Milanič},
year = {2025},
journal = {IEEE Transactions on Computational Biology and Bioinformatics},
doi = {10.1109/tcbbio.2025.3580476},
url = {https://doi.org/10.1109/tcbbio.2025.3580476}
}RIS
TY - JOUR TI - Perfect phylogenies via the Minimum Uncovering Branching Problem: Efficiently Solvable Cases AU - Narmina Baghirova AU - Esther Galby AU - Martin Milanič PY - 2025 JO - IEEE Transactions on Computational Biology and Bioinformatics DO - 10.1109/tcbbio.2025.3580476 UR - https://doi.org/10.1109/tcbbio.2025.3580476 ER -
APA
Baghirova, N., Galby, E., & Milanič, M. (2025). Perfect phylogenies via the Minimum Uncovering Branching Problem: Efficiently Solvable Cases. IEEE Transactions on Computational Biology and Bioinformatics. https://doi.org/10.1109/tcbbio.2025.3580476
Source records
- crossref · retrieved 2026-11-10T11:09:46.512Z