标题
Parsimony optimization of phylogenetic networks
作者
关键词
-
出版物
CLADISTICS
Volume 39, Issue 5, Pages 456-474
出版商
Wiley
发表日期
2023-07-19
DOI
10.1111/cla.12552
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- NetRAX: accurate and fast maximum likelihood phylogenetic network inference
- (2022) Sarah Lutteropp et al. BIOINFORMATICS
- Treewidth-based algorithms for the small parsimony problem on networks
- (2022) Celine Scornavacca et al. Algorithms for Molecular Biology
- Inferring Phylogenetic Networks Using PhyloNet
- (2018) Dingqiao Wen et al. SYSTEMATIC BIOLOGY
- Revising the Bantu tree
- (2018) Peter M. Whiteley et al. CLADISTICS
- Improved Maximum Parsimony Models for Phylogenetic Networks
- (2017) Leo Van Iersel et al. SYSTEMATIC BIOLOGY
- In the light of deep coalescence: revisiting trees within networks
- (2016) Jiafan Zhu et al. BMC BIOINFORMATICS
- Phylogenetic network analysis as a parsimony optimization problem
- (2015) Ward C Wheeler BMC BIOINFORMATICS
- On Computing the Maximum Parsimony Score of a Phylogenetic Network
- (2015) Mareike Fischer et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- Phylogenetic Networks that Display a Tree Twice
- (2014) Paul Cordue et al. BULLETIN OF MATHEMATICAL BIOLOGY
- Historical linguistics as a sequence optimization problem: the evolution and biogeography of Uto-Aztecan languages
- (2014) Ward C. Wheeler et al. CLADISTICS
- Exactly Computing the Parsimony Scores on Phylogenetic Networks Using Dynamic Programming
- (2014) Lavanya Kannan et al. JOURNAL OF COMPUTATIONAL BIOLOGY
- Into the deep: A phylogenetic approach to the bivalve subclass Protobranchia
- (2013) Prashant P. Sharma et al. MOLECULAR PHYLOGENETICS AND EVOLUTION
- Counting Trees in a Phylogenetic Network Is \#P-Complete
- (2013) Simone Linz et al. SIAM JOURNAL ON COMPUTING
- Maximum Parsimony on Phylogenetic networks
- (2012) Lavanya Kannan et al. Algorithms for Molecular Biology
- The tree alignment problem
- (2012) Andrés Varón et al. BMC BIOINFORMATICS
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started