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

[Seqan-dev] Suffix array construction algorithms

<-- thread -->
<-- date -->
  • From: John Reid <j.reid@mail.cryst.bbk.ac.uk>
  • To: SeqAn Development <seqan-dev@lists.fu-berlin.de>
  • Date: Fri, 21 Mar 2014 10:43:10 +0000
  • Reply-to: SeqAn Development <seqan-dev@lists.fu-berlin.de>
  • Subject: [Seqan-dev] Suffix array construction algorithms

I was reading http://bib.oxfordjournals.org/content/15/2/138 and it made
me wonder if there is a roadmap for various suffix array construction
algorithms to be incorporated into SeqAn? In particular SA-IS (refs
below) seems interesting.

Nong G, Zhang S, Chan WH. Linear suffix array construction by almost
pure induced-sorting. In: Proceedings of the19th IEEE Data Compression
Conference (DCC’09). Washington, DC: IEEE Computer Society, 2009, 193–202.

Nong G, Zhang S, Chan WH. Two efficient algorithms for linear time
suffix array construction. IEEE Trans Comput 2011;60(10):1471–84.



<-- thread -->
<-- date -->
  • seqan-dev - March 2014 - 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