Complexity of pattern discovery

k sequences, n helices and strands

• extension/repeated matching: O(k*nn)

• maximal clique O((nk/ck)!), ck >= 1

Previous slide

Next slide

Back to first slide

View graphic version