[Seqan-dev] Time complexity of posGlobalize

[John Reid <j.reid@mail.cryst.bbk.ac.uk>]

Suppose I have an iterator over a suffix array. What is the time 
complexity of calling posGlobalise() on an occurrence the iterator? I'm 
asking because I have the option to store indexes to occurrences as 
global positions or as local positions (pairs of sequence ids, position 
in sequences). I'm guessing the latter is more time efficient but would 
take more storage.

Thanks,
John.