Login / Signup

Parallel Polynomial-Time Approximation Scheme (PTAS) for Finding Compact Structural Motifs.

Bernard BrockaSharlene YapJhoirene Clemente
Published in: ICBBE (2023)
Keyphrases
  • polynomial time approximation
  • identical machines
  • np hard
  • approximation algorithms
  • structural motifs
  • error bounds
  • bin packing
  • protein sequences
  • lower bound
  • minimum cost