Login / Signup

Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability.

Gang WuMing-Yang KaoGuohui LinJia-Huai You
Published in: Algorithms Mol. Biol. (2008)
Keyphrases
  • success probability
  • special case
  • computational complexity
  • worst case
  • approximation algorithms
  • data sets
  • learning algorithm
  • np hard
  • dynamic programming
  • noisy data
  • expected cost
  • low snr
  • noisy observations