Time-space trade-offs for longest common extensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7354 LNCS, Issue , 2012, Pages 293-305

  Bille, Philip ^a   Gørtz, Inge Li ^a   Sach, Benjamin ^b   Vildhøj, Hjalte Wedel ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE STRING MATCHING; COMPACT DATA STRUCTURE; COMPUTATIONAL BOTTLENECKS; LONGEST COMMON EXTENSIONS; PREPROCESS; QUERY TIME; TIME-SPACE;

DATA STRUCTURES; PATTERN MATCHING;

COMMERCE;

EID: 84863107608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31265-6_24     Document Type: Conference Paper

References (27)

1. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18 (1975)
2. Allouche, J., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoret. Comput. Sci. 292(1), 9-31 (2003)
3. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257-275 (2004)
4. Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica 14(4), 355-366 (1995)
5. Colbourn, C.J., Ling, A.C.: Quorums from difference covers. Inf. Process. Lett. 75(1-2), 9-12 (2000)
6. Cole, R., Hariharan, R.: Approximate String Matching: A Simpler Faster Algorithm. SIAM J. Comput. 31(6), 1761-1782 (2002)
7. Dietzfelbinger, M., Meyer auf der Heide, F.: A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 6-19. Springer, Heidelberg (1990)
8. Fischer, J., Heun, V.: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36-48. Springer, Heidelberg (2006)
9. Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology, Cambridge (1997)
10. Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69, 525-546 (2004)
11. Ga̧sieniec, L., Kolpakov, R., Potapov, I.: Space efficient search for maximal repetitions. Theoret. Comput. Sci. 339(1), 35-48 (2005)
12. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338-355 (1984)
13. Ilie, L., Navarro, G., Tinta, L.: The longest common extension problem revisited and applications to approximate string searching. J. of Discrete Algorithms 8, 418-428 (2010)
14. Jeuring, J.: The Derivation of On-Line Algorithms, with an Application to Finding Palindromes. Algorithmica 11(2), 146-184 (1994)
15. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918-936 (2006)
16. Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249-260 (1987)
17. Kolpakov, R., Kucherov, G.: Searching for Gapped Palindromes. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 18-30. Springer, Heidelberg (2008)
18. Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557-582 (1998)
19. Landau, G.M., Schmidt, J.P.: An Algorithm for Approximate Tandem Repeats. J. Comput. Biol. 8(1), 1-18 (2001)
20. Landau, G.M., Vishkin, U.: Fast Parallel and Serial Approximate String Matching. J. Algorithms 10, 157-169 (1989)
21. Lu, L., Jia, H., Dröge, P., Li, J.: The human genome-wide distribution of DNA palindromes. Funct. Integr. Genomics 7(3), 221-227 (2007)
22. Main, M.G., Lorentz, R.J.: An O (n log n) algorithm for finding all repetitions in a string. J. Algorithms 5(3), 422-432 (1984)
23. Manacher, G.: A New Linear-Time "On-Line" Algorithm for Finding the Smallest Initial Palindrome of a String. J. ACM 22(3), 346-351 (1975)
24. Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., Hashimoto, K.: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theoret. Comput. Sci. 410(8-10), 900-913 (2009)
25. Myers, E.W.: An O(ND) difference algorithm and its variations. Algorithmica 1(2), 251-266 (1986)
26. Puglisi, S.J., Turpin, A.: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 124-135. Springer, Heidelberg (2008)
27. Ružić, M.: Uniform deterministic dictionaries. ACM Trans. Algorithms 4, 1-23 (2008)