The Maximum Agreement of Two Nested Phylogenetic Networks

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30551-4_51
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Ancestral Compatibility of Two Phylogenetic Trees With Nested Taxa

Journal of Mathematical Biology
AgriculturalApplied MathematicsSimulationModelingBiological Sciences
2006English

Discovering Frequent Agreement Subtrees From Phylogenetic Data

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
2008English

Figure 2: Maximum Likelihood Phylogenetic Tree.

English

Leaf-Reconstructibility of Phylogenetic Networks

SIAM Journal on Discrete Mathematics
Mathematics
2018English

Strategies for Phylogenetic Reconstruction - For the Maximum Parsimony Problem

2016English

A Space of Phylogenetic Networks

SIAM Journal on Applied Algebra and Geometry
2017English

Managed Agreement: Generalizing Two Fundamental Distributed Agreement Problems

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2007English

Agreement Dynamics on Small-World Networks

Europhysics Letters
AstronomyPhysics
2006English

Comparison of Tree-Child Phylogenetic Networks

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy