Skip to main content

Two-Dimensional Pattern Indexing

2005; Na, Giancarlo, Park

  • Reference work entry
Encyclopedia of Algorithms

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Cole, R. Hariharan, R.: Faster suffix tree construction with missing suffix links. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 2000, pp. 407–415

    Google Scholar 

  2. Giancarlo, R.: An index data structure for matrices, with applications to fast two‐dimensional pattern matching. In: Proceedings of Workshop on Algorithm and Data Structures, vol. 709, pp. 337–348. Springer Lect. Notes Comp. Sci. Montréal, Canada (1993)

    Google Scholar 

  3. Giancarlo, R.: A generalization of the suffix tree to square matrices, with application. SIAM J. Comput. 24, 520–562 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Giancarlo, R., Grossi, R.: On the construction of classes of suffix trees for square matrices: Algorithms and applications. Inf. Comput. 130, 151–182 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Giancarlo, R., Grossi, R.: Suffix tree data structures for matrices. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms, ch. 11,, pp. 293–340. Oxford University Press, Oxford (1997)

    Google Scholar 

  6. Giancarlo, R., Guaiana, D.: On-line construction of two‐dimensional suffix trees. J. Complex. 15, 72–127 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gonnet, G.H.: Efficient searching of text and pictures. Tech. Report OED-88-02, University of Waterloo (1988)

    Google Scholar 

  8. Kim, D.K., Kim, Y.A., Park, K.: Constructing suffix arrays for multi‐dimensional matrices. In: Proceedings of the 9th Symposium on Combinatorial Pattern Matching, 1998, pp. 249–260

    Google Scholar 

  9. Kim, D.K., Kim, Y.A., Park, K.: Generalizations of suffix arrays to multi‐dimensional matrices. Theor. Comput. Sci. 302, 401–416 (2003)

    Article  MATH  Google Scholar 

  10. Kim, D.K., Park, K.: Linear-time construction of two‐dimensional suffix trees. In: Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, 1999, pp. 463–372

    Google Scholar 

  11. Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22, 935–948 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. McCreight, E.M.: A space‐economical suffix tree construction algorithms. J. ACM 23, 262–272 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  13. Na, J.C., Giancarlo, R., Park, K.: \( { O(n^2 \log n) } \) time on-line construction of two‐dimensional suffix trees. In: Proceedings of the 11th International Computing and Combinatorics Conference, 2005, pp. 273–282

    Google Scholar 

  14. Storer, J.A.: Lossless image compression using generalized LZ1-type methods. In: Proceedings of Data Compression Conference, 1996, pp. 290–299

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Na, J., Ferragina, P., Giancarlo, R., Park, K. (2008). Two-Dimensional Pattern Indexing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_442

Download citation

Publish with us

Policies and ethics