1. Berkeley Lab Avatar Berkeley Lab
  2. Untitled
  3. MetaBAT
  4. Issues

Question?

Issue #4 resolved
Former user created an issue

What is the time complexity of MetaBAT tool in term of Big O notation. Is it O(n), o(n), O(nlogn)? Help please.

Comments (1)

  1. Don Kang

    It's basically O(n^2) problem. But MetaBAT has nice heuristics to accelerate the calculations, especially in clustering stage. Refer to the paper.

  2. Log in to comment
Assignee
Berkeley Lab
Type
proposal
Priority
major
Status
resolved
Votes
0
Watchers
1
Jira: the preferred issue tracker for Bitbucket. Join the team!