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\)InsertDelete \(\min\)Total
Unordered arrayp1pp
Min heap1\(\log (p)\)\(\log (p)\)\(\log (p)\)
Ordered array1ppp