Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees

doi 10.1142/9781860947995_0012
Full Text
Abstract

Available in full text

Date
Authors
Publisher

PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO.

Related search

Computing the All-Pairs Longest Chains in the Plane

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Computing the Set of All the Distant Horizons of a Terrain

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2005English

Computing Confidence Scores for All Sub Parse Trees

2008English

Computing All Pairs (Λ,μ) Such That Λ Is a Double Eigenvalue of A+μB

SIAM Journal on Matrix Analysis and Applications
Analysis
2011English

Quartet Decomposition Server: A Platform for Analyzing Phylogenetic Trees

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2012English

An Optimal Algorithm for Computing All Subtree Repeats in Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

On Families of Weakly Cross-Intersecting Set-Pairs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Decompositions of a Set Into Disjoint Pairs

Fundamenta Mathematicae
Number TheoryAlgebra
1955English

Computing the Diameter of a Point Set

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy