Optimal prefix and suffix queries on texts

Information Processing Letters

Volumn 108, Issue 5, 2008, Pages 320-325

  Crochemore, Maxime ^a,b   Iliopoulos, Costas S ^a   Rahman, M Sohel ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b Université de Marne la Vallée   (France)

Author keywords

Algorithms; Combinatorial problems; Data structures; Pattern matching

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER SCIENCE; DATA STRUCTURES; FILE ORGANIZATION; OPTIMAL CONTROL SYSTEMS; PATTERN MATCHING; TECHNOLOGY; TERMINOLOGY;

ALGORITHMS; COMBINATORIAL PROBLEMS; LECTURE NOTES; OPTIMAL QUERY; RESTRICTED PATTERN; SPACE COMPLEXITIES; SUB STRINGS; SUFFIX TREES;

TREES (MATHEMATICS);

EID: 53049089310     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.05.027     Document Type: Article

References (38)

1. Amir A., Keselman D., Landau G.M., Lewenstein M., Lewenstein N., and Rodeh M. Text indexing and dictionary matching with one error. J. Algorithms 37 2 (2000) 309-325
2. Apostolico A. The myriad virtues of subword trees. Combinatorial Algorithms on Words. NATO ISI (1985), Springer-Verlag 85-96
3. Bender M.A., and Farach-Colton M. The LCA problem revisited. In: Gonnet G.H., Panario D., and Viola A. (Eds). Latin American Theoretical INformatics (LATIN). Lecture Notes in Computer Science vol. 1776 (2000), Springer 88-94
4. Blum A., Jiang T., Li M., Tromp J., and Yannakakis M. Linear approximation of shortest superstrings. STOC (1991), ACM 328-336
5. Chan H.-L., Hon W.-K., and Lam T.W. Compressed index for a dynamic collection of texts. In: Sahinalp S.C., Muthukrishnan S., and Dogrusöz U. (Eds). CPM. Lecture Notes in Computer Science vol. 3109 (2004), Springer 445-456
6. Cole R., Gottlieb L.-A., and Lewenstein M. Dictionary matching and indexing with errors and don't cares. In: Babai L. (Ed). STOC (2004), ACM 91-100
7. Crochemore M., Iliopoulos C.S., Kubica M., Rahman M.S., and Walen T. Improved algorithms for the range next value problem and applications. In: Albers S., Weil P., and Rochange C. (Eds). STACS. Dagstuhl Seminar Proceedings vol. 08001 (2008), Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 205-216
8. Crochemore M., Iliopoulos C.S., and Rahman M.S. Finding patterns in given intervals. In: Kucera L., and Kucera A. (Eds). MFCS. Lecture Notes in Computer Science vol. 4708 (2007), Springer 645-656
9. Crochemore M., and Rytter W. Jewels of Stringology (2002), World Scientific
10. M. Farach, Optimal suffix tree construction with large alphabets, in: FOCS 1997, pp. 137-143
11. P. Ferragina, R. Grossi, Fast incremental text editing, in: SODA, 1995, pp. 531-540
12. Fischer J., and Heun V. A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen B., Paterson M., and Zhang G. (Eds). ESCAPE. Lecture Notes in Computer Science vol. 4614 (2007), Springer 459-470
13. T. Flouri, C.S. Iliopoulos, M.S. Rahman, L. Vagner, M. Vorácek, Indexing factors in DNA/RNA sequences, in: BIRD08-ALBIO08, 2008, in press
14. H. Gabow, J. Bentley, R. Tarjan, Scaling and related techniques for geometry problems, in: Symposium on the Theory of Computing (STOC), 1984, pp. 135-143
15. M. Gu, M. Farach, R. Beigel, An efficient algorithm for dynamic text indexing, in: SODA, 1994, pp. 697-704
16. Gusfield D. Algorithms on Strings, Trees, and Sequences-Computer Science and Computational Biology (1997), Cambridge University Press
17. Gusfield D., Landau G.M., and Schieber B. An efficient algorithm for the all pairs suffix-prefix problem. Inform. Process. Lett. 41 4 (1992) 181-185
18. C.S. Iliopoulos, M.S. Rahman, Indexing factors with gaps, Algorithmica, doi:10.1007/s00453-007-9141-3, in press
19. Iliopoulos C.S., and Rahman M.S. Faster index for property matching. Inform. Process. Lett. 105 6 (2008) 218-223
20. Iliopoulos C.S., and Rahman M.S. Indexing circular patterns. In: Nakano S.-I., and Rahman M.S. (Eds). WALCOM. Lecture Notes in Computer Science vol. 4921 (2008), Springer 46-57
21. J.M. Jr., V. Pratt, A linear pattern matching algorithm, University of California Technical report, 40, 1970
22. Kececioglu J.D., and Myers E.W. Combinatorial algorithms for DNA sequence assembly. Algorithmica 13 1-2 (1995) 7-51
23. Kedem Z.M., Landau G.M., and Palem K.V. Parallel suffix-prefix-matching algorithm and applications. SIAM J. Comput. 25 5 (1996) 998-1023
24. Knuth D.E., Jr. J.H.M., and Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6 2 (1977) 323-350
25. Lesk A. Computational Molecular Biology: Sources and Methods for Sequence Analysis (1988), Oxford University Press, Inc., New York, NY, USA
26. Maaß M.G., and Nowak J. Text indexing with errors. In: Apostolico A., Crochemore M., and Park K. (Eds). CPM. Lecture Notes in Computer Science vol. 3537 (2005), Springer 21-32
27. Mäkinen V., and Navarro G. Dynamic entropy-compressed sequences and full-text indexes. In: Lewenstein M., and Valiente G. (Eds). CPM. Lecture Notes in Computer Science vol. 4009 (2006), Springer 306-317
28. Mäkinen V., and Navarro G. Position-restricted substring searching. In: Correa J.R., Hevia A., and Kiwi M.A. (Eds). LATIN. Lecture Notes in Computer Science vol. 3887 (2006), Springer 703-714
29. McCreight E.M. A space-economical suffix tree construction algorithm. J. ACM 23 2 (1976) 262-272
30. S. Muthukrishnan, Efficient algorithms for document retrieval problems, in: SODA, 2002, pp. 657-666
31. Navarro G., and Mäkinen V. Compressed full-text indexes. ACM Comput. Surv. 39 1 (2007)
32. Navarro G., Sutinen E., Tanninen J., and Tarhio J. Indexing text with approximate q-grams. In: Giancarlo R., and Sankoff D. (Eds). CPM. Lecture Notes in Computer Science vol. 1848 (2000), Springer 350-363
33. Rahman M.S., and Iliopoulos C.S. Indexing factors with gaps. In: van Leeuwen J., Italiano G.F., van der Hoek W., Meinel C., Sack H., Plasil F., and Bieliková M. (Eds). SOFSEM. Lecture Notes in Computer Science vol. 4362 (2007), Springer 465-474
34. Rahman M.S., Iliopoulos C.S., Lee I., Mohamed M., and Smyth W.F. Finding patterns with variable length gaps or don't cares. In: Chen D.Z., and Lee D.T. (Eds). COCOON. Lecture Notes in Computer Science vol. 4112 (2006), Springer 146-155
35. Sadakane K. Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5 1 (2007) 12-22
36. Tarhio J., and Ukkonen E. A greedy approximation algorithm for constructing shortest common superstrings. Theoret. Comput. Sci. 57 (1988) 131-145
37. Ukkonen E. A linear-time algorithm for finding approximate shortest common superstrings. Algorithmica 5 3 (1990) 313-323
38. Ukkonen E. On-line construction of suffix trees. Algorithmica 14 3 (1995) 249-260