Towards Sub-Quadratic Time and Space Complexity Solutions for the Dated Tree Reconciliation Problem

Algorithms for Molecular Biology - United Kingdom
doi 10.1186/s13015-016-0077-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Uncertain Quadratic Minimum Spanning Tree Problem

Journal of Communications
Electronic EngineeringElectrical
2014English

The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

Forward-Looking Solutions for the Georgian and South Ossetian Conflict: A Path Towards Reconciliation

Baltic Journal of Law and Politics
LawSociologyPolitical Science
2013English

Extra Space-Time Dimensions: Towards a Solution to the Strong CP-problem

Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy Physics
High Energy PhysicsNuclear
1988English

Minimum Leaf Removal for Reconciliation: Complexity and Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Space, Time and Complexity in Plant Dispersal Ecology

Movement Ecology
EvolutionEcologySystematicsBehavior
2014English

Rawls and Catholicism: Towards Reconciliation?

Journal of Cultural and Religious Studies
2019English

Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for Best Solutions

International Journal of Advanced Computer Science and Applications
Computer Science
2018English

Time-Space Trade-Offs for the Longest Common Substring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy