An integrated complexity analysis of problems from computational biology
We perform an Integrated complexity analysis on a number of combinatorial problems arising from the field of computational biology. The classic framework of NP-completeness, algorithmic design techniques for bounded width graphs, and parameterized computational complexity together provide a clear...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English en |
Published: |
2018
|
Subjects: | |
Online Access: | https://dspace.library.uvic.ca//handle/1828/9704 |