Skip to main content

Table 1 Time complexities (\(\times \mathcal {O}(1)\)) of the three main elementary operations required by one step of adjacency-constrained clustering (in columns), for three implementation options (in rows), for a problem of size p

From: Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics

 

Find \(\min\)

Insert

Delete \(\min\)

Total

Unordered array

p

1

p

p

Min heap

1

\(\log (p)\)

\(\log (p)\)

\(\log (p)\)

Ordered array

1

p

p

p

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188