Login / Signup

An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study.

Dan GusfieldDean HickersonSatish Eddhu
Published in: Discret. Appl. Math. (2007)
Keyphrases
  • empirical studies
  • lower bound
  • upper bound
  • empirical analysis
  • small number
  • theoretical framework
  • active learning
  • finite number
  • uci datasets
  • computational complexity
  • computer networks
  • lower and upper bounds