FU Logo
  • Startseite
  • Kontakt
  • Impressum
  • Home
  • Listenauswahl
  • Anleitungen

Re: [Seqan-dev] Time complexity of posGlobalize

<-- thread -->
<-- date -->
  • From: John Reid <j.reid@mail.cryst.bbk.ac.uk>
  • To: SeqAn Development <seqan-dev@lists.fu-berlin.de>
  • Date: Wed, 27 Jul 2011 12:31:48 +0100
  • Reply-to: SeqAn Development <seqan-dev@lists.fu-berlin.de>
  • Subject: Re: [Seqan-dev] Time complexity of posGlobalize

On 26/07/11 07:17, Weese, David wrote:
Hi John,

posGlobalize needs in either case constant time. posLocalize takes constant time only for pairs. Otherwise (for global positions = integers) it takes O(m log m) where m is the number of sequences.
And yes, global positions help to save memory. But you can configure the type used in the position tables by overloading SAValue for your index. With Packed Pairs you specify the number of bits used for seqno and seqofs.
That sounds interesting. I'm not quite sure where in the documentation I should look to see what how I should overload SAValue. Is there documentation on this?

Thanks,
John.



<-- thread -->
<-- date -->
  • Follow-Ups:
    • Re: [Seqan-dev] Time complexity of posGlobalize
      • From: John Reid <j.reid@mail.cryst.bbk.ac.uk>
  • References:
    • [Seqan-dev] Time complexity of posGlobalize
      • From: John Reid <j.reid@mail.cryst.bbk.ac.uk>
    • Re: [Seqan-dev] Time complexity of posGlobalize
      • From: "Weese, David" <weese@campus.fu-berlin.de>
  • seqan-dev - July 2011 - Archives indexes sorted by:
    [ thread ] [ subject ] [ author ] [ date ]
  • Complete archive of the seqan-dev mailing list
  • More info on this list...

Hilfe

  • FAQ
  • Dienstbeschreibung
  • ZEDAT Beratung
  • postmaster@lists.fu-berlin.de

Service-Navigation

  • Startseite
  • Listenauswahl

Einrichtung Mailingliste

  • ZEDAT-Portal
  • Mailinglisten Portal