Open Access · CC BY 4.0
A strengthened bound on the number of states required to characterize maximum parsimony distance
Theoretical Computer Science · 2026-07 · 1080 · 116057
DOI: 10.1016/j.tcs.2026.116057 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Mareike Fischer und 2 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Fischer, M., Kelk, S., & Alferez, S. V. (2026). A strengthened bound on the number of states required to characterize maximum parsimony distance. Theoretical Computer Science, 1080, 116057. https://doi.org/10.1016/j.tcs.2026.116057
Vancouver
Fischer M, Kelk S, Alferez SV. A strengthened bound on the number of states required to characterize maximum parsimony distance. Theoretical Computer Science. 2026;1080:116057. doi:10.1016/j.tcs.2026.116057
BibTeX
@article{Fischer2026,
author = {Fischer, Mareike and Kelk, Steven and Alferez, Sofia Vazquez},
title = {A strengthened bound on the number of states required to characterize maximum parsimony distance},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1080},
pages = {116057},
doi = {10.1016/j.tcs.2026.116057}
}
EUVIMED