On the number of elements to reorder when updating a suffix array

Journal of Discrete Algorithms

Volumn 11, Issue 1, 2012, Pages 87-99

  Leonard M ^a   Mouchard, L ^a,b   Salson, M ^c  

^a UNIVERSITÉ DE ROUEN   (France)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIV LILLE   (France)

Author keywords

Burrows Wheeler Transform; Complexity; Dynamic data structure; FM index; Longest common prefix; Self index; Suffix array

Indexed keywords

BURROWS WHEELER TRANSFORM; COMPLEXITY; DYNAMIC DATA STRUCTURE; FM-INDEX; LONGEST COMMON PREFIX; SELF-INDEX; SUFFIX ARRAYS;

DATA STRUCTURES;

ALGORITHMS;

EID: 84857049255     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2011.01.002     Document Type: Article

References (23)

1. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Tech. Rep. 124, DEC, Palo Alto, CA, 1994.
2. J.G. Cleary, and I. Witten Data compression using adaptive coding and partial string matching IEEE Trans. Commun. 32 4 1984 396 402 (Pubitemid 14564864)
3. J.G. Cleary, W.J. Teahan, and I. Witten Unbounded length contexts for PPM Comput. J. 40 2/3 1997 67 76
4. J. Fayolle, M. Ward, Analysis of the average depth in a suffix tree under a Markov model, in: International Conference on the Analysis of Algorithms, 2005.
5. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proc. of Foundations of Computer Science (FOCS), 2000.
6. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro Compressed representation of sequences and full-text indexes ACM Trans. Algorithms 3 2007 article 20
7. P. Ferragina, G. Manzini, and S. Muthukrishnan The Burrows-Wheeler transform Theoret. Comput. Sci. 387 3 2007 197 360 (special issue)
8. M. Gallé, P. Peterlongo, and F. Coste In-place update of suffix array while recoding words J. Holub, J. Žďárek, Proceedings of the Prague Stringology Conference 2008 2008 Czech Technical University in Prague Czech Republic
9. G.H. Gonnet, R.A. Baeza-Yates, and T. Snider New indices for text: Pat trees and pat arrays Information Retrieval: Data Structures & Algorithms 1992 66 82
10. B. Haubold, and T. Wiehe How repetitive are genomes? BMC Bioinformatics 7 2006 541+
11. J. Kärkkäinen, P. Sanders, Simple linear work suffix array construction, in: Proc. of International Colloquium on Automata, Languages, and Programming (ICALP), 2003.
12. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park Linear-time longest-common-prefix computation in suffix arrays and its applications Proc. of Combinatorial Pattern Matching (CPM) Lecture Notes in Comput. Sci. vol. 2089 2001
13. P. Ko, S. Aluru, Space efficient linear time construction of suffix arrays, in: Proc. of Combinatorial Pattern Matching (CPM), 2003.
14. T.W. Lam, W.K. Sung, S.L. Tam, C.K. Wong, and S.M. Yiu Compressed indexing and local alignment of DNA Bioinformatics 24 6 2008 791 797 (Pubitemid 351386917)
15. B. Langmead, C. Trapnell, M. Pop, and S.L. Salzberg Ultrafast and memory-efficient alignment of short DNA sequences to the human genome Genome Biology 10 3 2009 R25
16. K. Liolios, K. Mavrommatis, N. Tavernarakis, and N.C. Kyrpides The genome on line database (GOLD) in 2007: status of genomic and metagenomic projects and their associated metadata Nuc. Acid Research 36 2008 475 479 URL http://genomesonline.org
17. U. Manber, G. Myers, Suffix arrays: a new method for on-line string searches, in: Proc. of Symposium on Discrete Algorithms (SODA), 1990.
18. G. Manzini, Two space saving tricks for linear time LCP array computation, in: Proc. 9th Scandinavian Workshop on Algorithm Theory, vol. 3111, 2004.
19. G. Manzini, and P. Ferragina Engineering a lightweight suffix array construction algorithm Algorithmica 40 1 2004 33 50 (Pubitemid 40871656)
20. S.J. Puglisi, W.F. Smyth, and A. Turpin A taxonomy of suffix array construction algorithms ACM Comp. Surv. 39 2 2007 1 31
21. M. Salson, T. Lecroq, M. Léonard, and L. Mouchard A four-stage algorithm for updating a Burrows-Wheeler Transform Theoret. Comput. Sci. 410 43 2009 4350 4359
22. M. Salson, T. Lecroq, M. Léonard, and L. Mouchard Dynamic extended suffix array J. Discrete Algorithms 8 2010 241 257
23. J. Seward, On the performance of BWT sorting algorithms, in: Proc. of Data Compression Conference (DCC), 2000.